prism.explicit-rel.default

Model:	(haddad-monmege)
Parameter(s)	N = 20, p = 0.7

	$ARTIFACT_DIR/bin/prism $ARTIFACT_DIR/benchmarks/dtmc/haddad-monmege/haddad-monmege.pm -const N=20,p=0.7 -steadystate  -explicit -relative  -epsilon 0.001

Explicit engine and relative error criterion

Walltime (MC-Time):	1.20578932762146s (0.032s)
Return code:	0
Note(s):	Tool does not support file export.

PRISM
=====

Version: 4.8.1
Date: Fri Sep 13 10:51:03 GMT+01:00 2024
Hostname: n23m0131.hpc.itc.rwth-aachen.de
Memory limits: cudd=1g, java(heap)=1g
Command line: prism /rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/dtmc/haddad-monmege/haddad-monmege.pm -const 'N=20,p=0.7' -steadystate -explicit -relative -epsilon 0.001

Parsing model file "/rwthfs/rz/clusterevts/evt-benchmarking/benchmarks/dtmc/haddad-monmege/haddad-monmege.pm"...

Type:        DTMC
Modules:     main
Variables:   x

---------------------------------------------------------------------

Computing steady-state probabilities...

Building model...
Model constants: N=20,p=0.7

Computing reachable states... 41 states
Reachable states exploration and model construction done in 0.006 secs.
Sorting reachable states list...

Time for model construction: 0.024 seconds.

Type:        DTMC
States:      41 (1 initial)
Transitions: 80

Computing probability of reaching BSCC 1

Starting probabilistic reachability...
Calculating predecessor relation for discrete-time Markov chain...  done (0.001 seconds)
Starting Prob0...
Prob0 took 0.001 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=1, no=1, maybe=39
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 1021 iterations, 79638 multiplications and 0.005 seconds.
Probabilistic reachability took 0.013 seconds.

Probability of reaching BSCC 1: 4.4639478087232743E-4

Computing probability of reaching BSCC 2

Starting probabilistic reachability...
Starting Prob0...
Prob0 took 0.0 seconds.
Starting Prob1...
Prob1 took 0.0 seconds.
target=1, yes=1, no=1, maybe=39
Starting value iteration (with Jacobi)...
Value iteration (with Jacobi) took 1021 iterations, 79638 multiplications and 0.001 seconds.
Probabilistic reachability took 0.001 seconds.

Probability of reaching BSCC 2: 1.9131204894528336E-4

Computing steady-state probabilities for BSCC 1
Starting value iteration...
Power method: 1 iterations in 0.001 seconds.

Computing steady-state probabilities for BSCC 2
Starting value iteration...
Power method: 1 iterations in 0.0 seconds.

Printing steady-state probabilities in plain text format below:
0:(0)=4.4639478087232743E-4
40:(40)=1.9131204894528336E-4

Time for steady-state probability computation: 0.032 seconds.	

Picked up JAVA_TOOL_OPTIONS: -Xmx16g