Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348500306.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is HealthRecord-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348500306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 26 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-10-CTLFireability-00
FORMULA_NAME HealthRecord-PT-10-CTLFireability-01
FORMULA_NAME HealthRecord-PT-10-CTLFireability-02
FORMULA_NAME HealthRecord-PT-10-CTLFireability-03
FORMULA_NAME HealthRecord-PT-10-CTLFireability-04
FORMULA_NAME HealthRecord-PT-10-CTLFireability-05
FORMULA_NAME HealthRecord-PT-10-CTLFireability-06
FORMULA_NAME HealthRecord-PT-10-CTLFireability-07
FORMULA_NAME HealthRecord-PT-10-CTLFireability-08
FORMULA_NAME HealthRecord-PT-10-CTLFireability-09
FORMULA_NAME HealthRecord-PT-10-CTLFireability-10
FORMULA_NAME HealthRecord-PT-10-CTLFireability-11
FORMULA_NAME HealthRecord-PT-10-CTLFireability-12
FORMULA_NAME HealthRecord-PT-10-CTLFireability-13
FORMULA_NAME HealthRecord-PT-10-CTLFireability-14
FORMULA_NAME HealthRecord-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678693786714

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 07:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 07:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:49:49] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-13 07:49:49] [INFO ] Transformed 158 places.
[2023-03-13 07:49:49] [INFO ] Transformed 333 transitions.
[2023-03-13 07:49:49] [INFO ] Found NUPN structural information;
[2023-03-13 07:49:49] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 85 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 115 transition count 227
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 115 transition count 227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 113 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 113 transition count 223
Applied a total of 90 rules in 34 ms. Remains 113 /158 variables (removed 45) and now considering 223/306 (removed 83) transitions.
[2023-03-13 07:49:49] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
// Phase 1: matrix 218 rows 113 cols
[2023-03-13 07:49:49] [INFO ] Computed 11 place invariants in 28 ms
[2023-03-13 07:49:50] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-13 07:49:50] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
[2023-03-13 07:49:50] [INFO ] Invariant cache hit.
[2023-03-13 07:49:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 07:49:50] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2023-03-13 07:49:50] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
[2023-03-13 07:49:50] [INFO ] Invariant cache hit.
[2023-03-13 07:49:50] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/158 places, 223/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 948 ms. Remains : 113/158 places, 223/306 transitions.
Support contains 85 out of 113 places after structural reductions.
[2023-03-13 07:49:50] [INFO ] Flatten gal took : 68 ms
[2023-03-13 07:49:51] [INFO ] Flatten gal took : 35 ms
[2023-03-13 07:49:51] [INFO ] Input system was already deterministic with 223 transitions.
Incomplete random walk after 10000 steps, including 630 resets, run finished after 857 ms. (steps per millisecond=11 ) properties (out of 77) seen :39
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) seen :3
Running SMT prover for 33 properties.
[2023-03-13 07:49:52] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
[2023-03-13 07:49:52] [INFO ] Invariant cache hit.
[2023-03-13 07:49:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-13 07:49:52] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 14 ms returned sat
[2023-03-13 07:49:53] [INFO ] After 337ms SMT Verify possible using state equation in real domain returned unsat :2 sat :5 real:26
[2023-03-13 07:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 07:49:53] [INFO ] After 80ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :2 sat :5 real:26
[2023-03-13 07:49:53] [INFO ] After 225ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :5 real:26
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-13 07:49:53] [INFO ] After 1093ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:31
[2023-03-13 07:49:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-13 07:49:53] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-13 07:49:54] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :29
[2023-03-13 07:49:54] [INFO ] After 382ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :29
[2023-03-13 07:49:55] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
[2023-03-13 07:49:55] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2023-03-13 07:49:55] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2023-03-13 07:49:55] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2023-03-13 07:49:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 404 ms
[2023-03-13 07:49:55] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-03-13 07:49:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 92 ms
[2023-03-13 07:49:55] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-13 07:49:55] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2023-03-13 07:49:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-03-13 07:49:56] [INFO ] After 1676ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :28
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-13 07:49:56] [INFO ] After 3059ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :28
Fused 33 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 263 ms.
Support contains 34 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 77 edges and 113 vertex of which 8 / 113 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 448 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 207
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 105 transition count 203
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 103 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 103 transition count 200
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 102 transition count 200
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 40 place count 78 transition count 152
Iterating global reduction 3 with 24 rules applied. Total rules applied 64 place count 78 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 69 place count 73 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 74 place count 73 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 81 place count 73 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 72 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 89 place count 69 transition count 143
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 69 transition count 142
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 105 place count 69 transition count 142
Applied a total of 105 rules in 85 ms. Remains 69 /113 variables (removed 44) and now considering 142/223 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 69/113 places, 142/223 transitions.
Incomplete random walk after 10000 steps, including 603 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 28) seen :4
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :1
Running SMT prover for 16 properties.
[2023-03-13 07:49:57] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
// Phase 1: matrix 137 rows 69 cols
[2023-03-13 07:49:57] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-13 07:49:57] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 07:49:57] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 07:49:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 07:49:57] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-13 07:49:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 07:49:57] [INFO ] After 105ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-13 07:49:57] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-13 07:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-13 07:49:58] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2023-03-13 07:49:58] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2023-03-13 07:49:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-13 07:49:58] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-13 07:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-13 07:49:58] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-13 07:49:58] [INFO ] After 909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 60 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 60 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 60 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 59 transition count 122
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 57 transition count 142
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 57 transition count 140
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 57 transition count 140
Applied a total of 30 rules in 48 ms. Remains 57 /69 variables (removed 12) and now considering 140/142 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 57/69 places, 140/142 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 118 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-13 07:49:59] [INFO ] Flow matrix only has 130 transitions (discarded 10 similar events)
// Phase 1: matrix 130 rows 57 cols
[2023-03-13 07:49:59] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-13 07:49:59] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 07:49:59] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 07:49:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 07:49:59] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-13 07:49:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-13 07:50:00] [INFO ] After 92ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-13 07:50:00] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-13 07:50:00] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 15 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 140/140 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 56 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 55 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 55 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 54 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 54 transition count 135
Applied a total of 7 rules in 20 ms. Remains 54 /57 variables (removed 3) and now considering 135/140 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 54/57 places, 135/140 transitions.
Incomplete random walk after 10000 steps, including 540 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 07:50:00] [INFO ] Flow matrix only has 125 transitions (discarded 10 similar events)
// Phase 1: matrix 125 rows 54 cols
[2023-03-13 07:50:00] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-13 07:50:00] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-13 07:50:00] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 07:50:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 07:50:01] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 07:50:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 07:50:01] [INFO ] After 59ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 07:50:01] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-13 07:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-13 07:50:01] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-13 07:50:01] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1 ms.
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 135/135 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 52 transition count 132
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 52 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 49 transition count 129
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 49 transition count 128
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 49 transition count 128
Applied a total of 12 rules in 47 ms. Remains 49 /54 variables (removed 5) and now considering 128/135 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 49/54 places, 128/135 transitions.
Incomplete random walk after 10000 steps, including 647 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-13 07:50:02] [INFO ] Flow matrix only has 113 transitions (discarded 15 similar events)
// Phase 1: matrix 113 rows 49 cols
[2023-03-13 07:50:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-13 07:50:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 07:50:02] [INFO ] After 41ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-13 07:50:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-13 07:50:02] [INFO ] After 11ms SMT Verify possible using 36 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 07:50:02] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 07:50:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 07:50:02] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-13 07:50:02] [INFO ] After 40ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 07:50:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-13 07:50:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-13 07:50:02] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-13 07:50:02] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 17 ms.
Support contains 10 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 128/128 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 128
Applied a total of 2 rules in 11 ms. Remains 48 /49 variables (removed 1) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 48/49 places, 128/128 transitions.
Incomplete random walk after 10000 steps, including 685 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 07:50:03] [INFO ] Flow matrix only has 113 transitions (discarded 15 similar events)
// Phase 1: matrix 113 rows 48 cols
[2023-03-13 07:50:03] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-13 07:50:03] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-13 07:50:03] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 07:50:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-13 07:50:03] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 07:50:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-13 07:50:03] [INFO ] After 37ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 07:50:03] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-13 07:50:03] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 128/128 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 127
Applied a total of 4 rules in 13 ms. Remains 46 /48 variables (removed 2) and now considering 127/128 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 46/48 places, 127/128 transitions.
Incomplete random walk after 10000 steps, including 653 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3924 steps, run visited all 4 properties in 38 ms. (steps per millisecond=103 )
Probabilistic random walk after 3924 steps, saw 1171 distinct states, run finished after 38 ms. (steps per millisecond=103 ) properties seen :4
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-10-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 19 ms
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 19 ms
[2023-03-13 07:50:03] [INFO ] Input system was already deterministic with 223 transitions.
Support contains 64 out of 113 places (down from 67) after GAL structural reductions.
Computed a total of 12 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 71 transition count 141
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 71 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 66 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 66 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 100 place count 66 transition count 125
Applied a total of 100 rules in 7 ms. Remains 66 /113 variables (removed 47) and now considering 125/223 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 66/113 places, 125/223 transitions.
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 14 ms
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 11 ms
[2023-03-13 07:50:03] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 159 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 61 transition count 127
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 61 transition count 127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 102 place count 52 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 111 place count 52 transition count 108
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 121 place count 52 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 50 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 50 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 49 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 49 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 49 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 47 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 45 transition count 77
Applied a total of 143 rules in 32 ms. Remains 45 /113 variables (removed 68) and now considering 77/223 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 45/113 places, 77/223 transitions.
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:03] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 63 transition count 125
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 63 transition count 125
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 107 place count 56 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 114 place count 56 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 123 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 54 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 52 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 137 place count 52 transition count 86
Applied a total of 137 rules in 10 ms. Remains 52 /113 variables (removed 61) and now considering 86/223 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 52/113 places, 86/223 transitions.
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:50:03] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:50:03] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 160 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 61 transition count 127
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 61 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 103 place count 51 transition count 106
Iterating global reduction 0 with 10 rules applied. Total rules applied 113 place count 51 transition count 106
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 123 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 48 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 132 place count 48 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 46 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 46 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 46 transition count 75
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 46 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 44 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 42 transition count 67
Applied a total of 152 rules in 26 ms. Remains 42 /113 variables (removed 71) and now considering 67/223 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 42/113 places, 67/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 67 transitions.
Incomplete random walk after 10000 steps, including 923 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 178577 steps, run visited all 1 properties in 319 ms. (steps per millisecond=559 )
Probabilistic random walk after 178577 steps, saw 25775 distinct states, run finished after 319 ms. (steps per millisecond=559 ) properties seen :1
FORMULA HealthRecord-PT-10-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 60 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 60 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 112 place count 60 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 57 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 57 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 57 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 55 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 55 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 129 place count 55 transition count 93
Applied a total of 129 rules in 7 ms. Remains 55 /113 variables (removed 58) and now considering 93/223 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 55/113 places, 93/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 120 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 69 transition count 142
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 69 transition count 142
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 86 place count 62 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 93 place count 62 transition count 128
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 103 place count 62 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 61 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 61 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 60 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 60 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 60 transition count 110
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 60 transition count 106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 122 place count 56 transition count 102
Applied a total of 122 rules in 21 ms. Remains 56 /113 variables (removed 57) and now considering 102/223 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 56/113 places, 102/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 66 transition count 131
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 66 transition count 131
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 59 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 59 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 59 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 57 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 57 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 55 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 55 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 125 place count 55 transition count 97
Applied a total of 125 rules in 6 ms. Remains 55 /113 variables (removed 58) and now considering 97/223 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 55/113 places, 97/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 160 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 61 transition count 127
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 61 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 103 place count 51 transition count 106
Iterating global reduction 0 with 10 rules applied. Total rules applied 113 place count 51 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 122 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 48 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 131 place count 48 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 46 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 46 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 46 transition count 76
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 46 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 44 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 42 transition count 68
Applied a total of 151 rules in 20 ms. Remains 42 /113 variables (removed 71) and now considering 68/223 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 42/113 places, 68/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 68 transitions.
Finished random walk after 5954 steps, including 544 resets, run visited all 1 properties in 14 ms. (steps per millisecond=425 )
FORMULA HealthRecord-PT-10-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 75 transition count 148
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 75 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 69 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 69 transition count 136
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 93 place count 69 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 68 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 68 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 67 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 67 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 67 transition count 125
Applied a total of 98 rules in 6 ms. Remains 67 /113 variables (removed 46) and now considering 125/223 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 67/113 places, 125/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 63 transition count 125
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 63 transition count 125
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 108 place count 55 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 116 place count 55 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 125 place count 55 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 53 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 53 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 132 place count 53 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 52 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 52 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 52 transition count 86
Applied a total of 137 rules in 7 ms. Remains 52 /113 variables (removed 61) and now considering 86/223 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 52/113 places, 86/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 65 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 65 transition count 129
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 57 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 57 transition count 112
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 57 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 56 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 56 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 56 transition count 99
Applied a total of 125 rules in 5 ms. Remains 56 /113 variables (removed 57) and now considering 99/223 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 56/113 places, 99/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 152 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 60 transition count 125
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 60 transition count 125
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 104 place count 51 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 113 place count 51 transition count 106
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 120 place count 51 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 49 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 49 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 49 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 48 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 132 place count 48 transition count 86
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 48 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 46 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 44 transition count 78
Applied a total of 142 rules in 16 ms. Remains 44 /113 variables (removed 69) and now considering 78/223 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 44/113 places, 78/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 8 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 61 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 61 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 105 place count 61 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 59 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 59 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 59 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 58 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 58 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 58 transition count 106
Applied a total of 117 rules in 7 ms. Remains 58 /113 variables (removed 55) and now considering 106/223 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 58/113 places, 106/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 160 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 61 transition count 127
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 61 transition count 127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 102 place count 52 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 111 place count 52 transition count 108
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 121 place count 52 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 50 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 50 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 49 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 49 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 49 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 47 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 45 transition count 77
Applied a total of 143 rules in 17 ms. Remains 45 /113 variables (removed 68) and now considering 77/223 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 45/113 places, 77/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 223/223 transitions.
Graph (trivial) has 134 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 63 transition count 130
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 63 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 99 place count 53 transition count 109
Iterating global reduction 0 with 10 rules applied. Total rules applied 109 place count 53 transition count 109
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 119 place count 53 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 50 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 50 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 50 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 48 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 48 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 137 place count 48 transition count 79
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 48 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 46 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 44 transition count 71
Applied a total of 147 rules in 16 ms. Remains 44 /113 variables (removed 69) and now considering 71/223 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 44/113 places, 71/223 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 3 ms
[2023-03-13 07:50:04] [INFO ] Input system was already deterministic with 71 transitions.
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 11 ms
[2023-03-13 07:50:04] [INFO ] Flatten gal took : 10 ms
[2023-03-13 07:50:04] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 07:50:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 223 transitions and 633 arcs took 2 ms.
Total runtime 15518 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 113 NrTr: 223 NrArc: 633)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 3.663sec


RS generation: 2m 6.591sec


-> reachability set: #nodes 947870 (9.5e+05) #states 208,876,076 (8)



starting MCC model checker
--------------------------

checking: EX [EF [[p87<=1 & 1<=p87]]]
normalized: EX [E [true U [p87<=1 & 1<=p87]]]

abstracting: (1<=p87)
states: 186,624 (5)
abstracting: (p87<=1)
states: 208,876,076 (8)
.-> the formula is TRUE

FORMULA HealthRecord-PT-10-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 6.535sec

checking: AF [AG [EF [[p87<=1 & 1<=p87]]]]
normalized: ~ [EG [E [true U ~ [E [true U [p87<=1 & 1<=p87]]]]]]

abstracting: (1<=p87)
states: 186,624 (5)
abstracting: (p87<=1)
states: 208,876,076 (8)

before gc: list nodes free: 1866075

after gc: idd nodes used:1266907, unused:62733093; list nodes free:285903818

EG iterations: 0
-> the formula is FALSE

FORMULA HealthRecord-PT-10-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 5.776sec

checking: EF [[[p92<=1 & 1<=p92] | AF [[p34<=1 & 1<=p34]]]]
normalized: E [true U [~ [EG [~ [[p34<=1 & 1<=p34]]]] | [p92<=1 & 1<=p92]]]

abstracting: (1<=p92)
states: 186,624 (5)
abstracting: (p92<=1)
states: 208,876,076 (8)
abstracting: (1<=p34)
states: 15,781,888 (7)
abstracting: (p34<=1)
states: 208,876,076 (8)
.
EG iterations: 1

before gc: list nodes free: 197313

after gc: idd nodes used:1069617, unused:62930383; list nodes free:297263331
-> the formula is TRUE

FORMULA HealthRecord-PT-10-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m54.522sec

checking: E [EG [~ [AX [[p86<=1 & 1<=p86]]]] U [EF [[p41<=1 & 1<=p41]] & EX [[p28<=1 & 1<=p28]]]]
normalized: E [EG [EX [~ [[p86<=1 & 1<=p86]]]] U [EX [[p28<=1 & 1<=p28]] & E [true U [p41<=1 & 1<=p41]]]]

abstracting: (1<=p41)
states: 52,219,016 (7)
abstracting: (p41<=1)
states: 208,876,076 (8)
abstracting: (1<=p28)
states: 8,931,456 (6)
abstracting: (p28<=1)
states: 208,876,076 (8)
.abstracting: (1<=p86)
states: 525,312 (5)
abstracting: (p86<=1)
states: 208,876,076 (8)

before gc: list nodes free: 2825283

after gc: idd nodes used:2410268, unused:61589732; list nodes free:289877243
.........
EG iterations: 8
-> the formula is TRUE

FORMULA HealthRecord-PT-10-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m38.025sec

checking: ~ [E [~ [[[p77<=1 & 1<=p77] & [p80<=1 & 1<=p80]]] U [p89<=1 & 1<=p89]]]
normalized: ~ [E [~ [[[p80<=1 & 1<=p80] & [p77<=1 & 1<=p77]]] U [p89<=1 & 1<=p89]]]

abstracting: (1<=p89)
states: 4,536,576 (6)
abstracting: (p89<=1)
states: 208,876,076 (8)
abstracting: (1<=p77)
states: 39,580,512 (7)
abstracting: (p77<=1)
states: 208,876,076 (8)
abstracting: (1<=p80)
states: 11,020,800 (7)
abstracting: (p80<=1)
states: 208,876,076 (8)

before gc: list nodes free: 2790339

after gc: idd nodes used:2785282, unused:61214718; list nodes free:289198971
-> the formula is FALSE

FORMULA HealthRecord-PT-10-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m38.002sec

checking: EG [EF [[A [[p89<=1 & 1<=p89] U EX [[p76<=1 & 1<=p76]]] & [EG [[p26<=1 & 1<=p26]] | EX [[p91<=0 & 0<=p91]]]]]]
normalized: EG [E [true U [[EX [[p91<=0 & 0<=p91]] | EG [[p26<=1 & 1<=p26]]] & [~ [EG [~ [EX [[p76<=1 & 1<=p76]]]]] & ~ [E [~ [EX [[p76<=1 & 1<=p76]]] U [~ [[p89<=1 & 1<=p89]] & ~ [EX [[p76<=1 & 1<=p76]]]]]]]]]]

abstracting: (1<=p76)
states: 1
abstracting: (p76<=1)
states: 208,876,076 (8)
.abstracting: (1<=p89)
states: 4,536,576 (6)
abstracting: (p89<=1)
states: 208,876,076 (8)
abstracting: (1<=p76)
states: 1
abstracting: (p76<=1)
states: 208,876,076 (8)
.abstracting: (1<=p76)
states: 1
abstracting: (p76<=1)
states: 208,876,076 (8)
.
before gc: list nodes free: 7297884

after gc: idd nodes used:2906750, unused:61093250; list nodes free:287684041
..
EG iterations: 2
abstracting: (1<=p26)
states: 16,043,968 (7)
abstracting: (p26<=1)
states: 208,876,076 (8)
.........
EG iterations: 9
abstracting: (0<=p91)
states: 208,876,076 (8)
abstracting: (p91<=0)
states: 208,689,452 (8)
.MC time: 5m11.068sec

checking: AF [AG [~ [A [[[[[[p19<=1 & 1<=p19] & [p111<=1 & 1<=p111]] | [p55<=1 & 1<=p55]] & [p6<=1 & 1<=p6]] & [[p19<=1 & 1<=p19] & [p111<=1 & 1<=p111]]] U A [[p106<=1 & 1<=p106] U [p39<=1 & 1<=p39]]]]]]
normalized: ~ [EG [E [true U [~ [EG [~ [[~ [EG [~ [[p39<=1 & 1<=p39]]]] & ~ [E [~ [[p39<=1 & 1<=p39]] U [~ [[p106<=1 & 1<=p106]] & ~ [[p39<=1 & 1<=p39]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p39<=1 & 1<=p39]]]] & ~ [E [~ [[p39<=1 & 1<=p39]] U [~ [[p106<=1 & 1<=p106]] & ~ [[p39<=1 & 1<=p39]]]]]]] U [~ [[[[p111<=1 & 1<=p111] & [p19<=1 & 1<=p19]] & [[p6<=1 & 1<=p6] & [[p55<=1 & 1<=p55] | [[p111<=1 & 1<=p111] & [p19<=1 & 1<=p19]]]]]] & ~ [[~ [EG [~ [[p39<=1 & 1<=p39]]]] & ~ [E [~ [[p39<=1 & 1<=p39]] U [~ [[p106<=1 & 1<=p106]] & ~ [[p39<=1 & 1<=p39]]]]]]]]]]]]]]

abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
abstracting: (1<=p106)
states: 174,960 (5)
abstracting: (p106<=1)
states: 208,876,076 (8)
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
...
EG iterations: 3
abstracting: (1<=p19)
states: 29,510,720 (7)
abstracting: (p19<=1)
states: 208,876,076 (8)
abstracting: (1<=p111)
states: 12,394,480 (7)
abstracting: (p111<=1)
states: 208,876,076 (8)
abstracting: (1<=p55)
states: 29,962,368 (7)
abstracting: (p55<=1)
states: 208,876,076 (8)
abstracting: (1<=p6)
states: 26,601,056 (7)
abstracting: (p6<=1)
states: 208,876,076 (8)
abstracting: (1<=p19)
states: 29,510,720 (7)
abstracting: (p19<=1)
states: 208,876,076 (8)
abstracting: (1<=p111)
states: 12,394,480 (7)
abstracting: (p111<=1)
states: 208,876,076 (8)
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
abstracting: (1<=p106)
states: 174,960 (5)
abstracting: (p106<=1)
states: 208,876,076 (8)
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
...
EG iterations: 3
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
abstracting: (1<=p106)
states: 174,960 (5)
abstracting: (p106<=1)
states: 208,876,076 (8)
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
abstracting: (1<=p39)
states: 11
abstracting: (p39<=1)
states: 208,876,076 (8)
...
EG iterations: 3
...
EG iterations: 3

before gc: list nodes free: 864178

after gc: idd nodes used:2455617, unused:61544383; list nodes free:290946946
MC time: 4m32.312sec

checking: [EX [A [[[p15<=1 & 1<=p15] & [E [[p67<=1 & 1<=p67] U [[p19<=1 & 1<=p19] & [p111<=1 & 1<=p111]]] & AX [~ [[p33<=1 & 1<=p33]]]]] U [EX [~ [[[p7<=1 & 1<=p7] & [p111<=1 & 1<=p111]]]] | E [~ [[p81<=1 & 1<=p81]] U EG [[p55<=1 & 1<=p55]]]]]] & EX [0<=0]]
normalized: [EX [[~ [EG [~ [[E [~ [[p81<=1 & 1<=p81]] U EG [[p55<=1 & 1<=p55]]] | EX [~ [[[p111<=1 & 1<=p111] & [p7<=1 & 1<=p7]]]]]]]] & ~ [E [~ [[E [~ [[p81<=1 & 1<=p81]] U EG [[p55<=1 & 1<=p55]]] | EX [~ [[[p111<=1 & 1<=p111] & [p7<=1 & 1<=p7]]]]]] U [~ [[[~ [EX [[p33<=1 & 1<=p33]]] & E [[p67<=1 & 1<=p67] U [[p111<=1 & 1<=p111] & [p19<=1 & 1<=p19]]]] & [p15<=1 & 1<=p15]]] & ~ [[E [~ [[p81<=1 & 1<=p81]] U EG [[p55<=1 & 1<=p55]]] | EX [~ [[[p111<=1 & 1<=p111] & [p7<=1 & 1<=p7]]]]]]]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 208,876,076 (8)
.abstracting: (1<=p7)
states: 41,624,832 (7)
abstracting: (p7<=1)
states: 208,876,076 (8)
abstracting: (1<=p111)
states: 12,394,480 (7)
abstracting: (p111<=1)
states: 208,876,076 (8)
.abstracting: (1<=p55)
states: 29,962,368 (7)
abstracting: (p55<=1)
states: 208,876,076 (8)
........
EG iterations: 8
abstracting: (1<=p81)
states: 4,536,576 (6)
abstracting: (p81<=1)
states: 208,876,076 (8)

before gc: list nodes free: 1411223

after gc: idd nodes used:3356347, unused:60643653; list nodes free:290668997
MC time: 3m58.016sec

checking: EF [[[AG [[p83<=0 & 0<=p83]] & EG [EX [[p3<=0 & 0<=p3]]]] & [AG [[[p27<=0 & 0<=p27] | [p18<=0 & 0<=p18]]] & ~ [A [E [[[p36<=1 & 1<=p36] & [p111<=1 & 1<=p111]] U [[p77<=1 & 1<=p77] & [p92<=1 & 1<=p92]]] U EX [[p64<=1 & 1<=p64]]]]]]]
normalized: E [true U [[~ [E [true U ~ [[[p18<=0 & 0<=p18] | [p27<=0 & 0<=p27]]]]] & ~ [[~ [EG [~ [EX [[p64<=1 & 1<=p64]]]]] & ~ [E [~ [EX [[p64<=1 & 1<=p64]]] U [~ [E [[[p111<=1 & 1<=p111] & [p36<=1 & 1<=p36]] U [[p92<=1 & 1<=p92] & [p77<=1 & 1<=p77]]]] & ~ [EX [[p64<=1 & 1<=p64]]]]]]]]] & [EG [EX [[p3<=0 & 0<=p3]]] & ~ [E [true U ~ [[p83<=0 & 0<=p83]]]]]]]

abstracting: (0<=p83)
states: 208,876,076 (8)
abstracting: (p83<=0)
states: 204,339,500 (8)
MC time: 3m29.240sec

checking: E [~ [[[p62<=1 & 1<=p62] & [p111<=1 & 1<=p111]]] U [[p50<=1 & 1<=p50] & [~ [A [[[p36<=1 & 1<=p36] & [p111<=1 & 1<=p111]] U E [[p68<=1 & 1<=p68] U [p81<=1 & 1<=p81]]]] & AX [~ [[[p66<=1 & 1<=p66] | [[[p62<=1 & 1<=p62] & [p111<=1 & 1<=p111]] | ~ [[[p77<=1 & 1<=p77] & [p108<=1 & 1<=p108]]]]]]]]]]
normalized: E [~ [[[p111<=1 & 1<=p111] & [p62<=1 & 1<=p62]]] U [[~ [EX [[[~ [[[p108<=1 & 1<=p108] & [p77<=1 & 1<=p77]]] | [[p111<=1 & 1<=p111] & [p62<=1 & 1<=p62]]] | [p66<=1 & 1<=p66]]]] & ~ [[~ [EG [~ [E [[p68<=1 & 1<=p68] U [p81<=1 & 1<=p81]]]]] & ~ [E [~ [E [[p68<=1 & 1<=p68] U [p81<=1 & 1<=p81]]] U [~ [[[p111<=1 & 1<=p111] & [p36<=1 & 1<=p36]]] & ~ [E [[p68<=1 & 1<=p68] U [p81<=1 & 1<=p81]]]]]]]]] & [p50<=1 & 1<=p50]]]

abstracting: (1<=p50)
states: 36,918,896 (7)
abstracting: (p50<=1)
states: 208,876,076 (8)
abstracting: (1<=p81)
states: 4,536,576 (6)
abstracting: (p81<=1)
states: 208,876,076 (8)
abstracting: (1<=p68)
states: 21,984,784 (7)
abstracting: (p68<=1)
states: 208,876,076 (8)
abstracting: (1<=p36)
states: 22,555,728 (7)
abstracting: (p36<=1)
states: 208,876,076 (8)
abstracting: (1<=p111)
states: 12,394,480 (7)
abstracting: (p111<=1)
states: 208,876,076 (8)
abstracting: (1<=p81)
states: 4,536,576 (6)
abstracting: (p81<=1)
states: 208,876,076 (8)
abstracting: (1<=p68)
states: 21,984,784 (7)
abstracting: (p68<=1)
states: 208,876,076 (8)

before gc: list nodes free: 19830055

after gc: idd nodes used:3772671, unused:60227329; list nodes free:289163405
abstracting: (1<=p81)
states: 4,536,576 (6)
abstracting: (p81<=1)
states: 208,876,076 (8)
abstracting: (1<=p68)
states: 21,984,784 (7)
abstracting: (p68<=1)
states: 208,876,076 (8)
MC time: 3m 3.010sec

checking: EG [EF [[[EG [[[p85<=1 & 1<=p85] | [p0<=1 & 1<=p0]]] | E [[[[p19<=1 & 1<=p19] & [p111<=1 & 1<=p111]] | [p14<=1 & 1<=p14]] U [[p32<=1 & 1<=p32] | [p87<=1 & 1<=p87]]]] & [EF [[p0<=1 & 1<=p0]] | [[E [[p29<=1 & 1<=p29] U [p7<=1 & 1<=p7]] & [p31<=1 & 1<=p31]] | [[p53<=0 & 0<=p53] & [p49<=0 & 0<=p49]]]]]]]
normalized: EG [E [true U [[E [[[p14<=1 & 1<=p14] | [[p111<=1 & 1<=p111] & [p19<=1 & 1<=p19]]] U [[p87<=1 & 1<=p87] | [p32<=1 & 1<=p32]]] | EG [[[p0<=1 & 1<=p0] | [p85<=1 & 1<=p85]]]] & [[[[p49<=0 & 0<=p49] & [p53<=0 & 0<=p53]] | [[p31<=1 & 1<=p31] & E [[p29<=1 & 1<=p29] U [p7<=1 & 1<=p7]]]] | E [true U [p0<=1 & 1<=p0]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 208,876,076 (8)
abstracting: (1<=p7)
states: 41,624,832 (7)
abstracting: (p7<=1)
states: 208,876,076 (8)
abstracting: (1<=p29)
states: 9,055,872 (6)
abstracting: (p29<=1)
states: 208,876,076 (8)
abstracting: (1<=p31)
states: 7,977,312 (6)
abstracting: (p31<=1)
states: 208,876,076 (8)
abstracting: (0<=p53)
states: 208,876,076 (8)
abstracting: (p53<=0)
states: 172,326,828 (8)
abstracting: (0<=p49)
states: 208,876,076 (8)
abstracting: (p49<=0)
states: 178,913,708 (8)
abstracting: (1<=p85)
states: 186,624 (5)
abstracting: (p85<=1)
states: 208,876,076 (8)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 208,876,076 (8)
......
EG iterations: 6
abstracting: (1<=p32)
states: 15,781,888 (7)
abstracting: (p32<=1)
states: 208,876,076 (8)
abstracting: (1<=p87)
states: 186,624 (5)
abstracting: (p87<=1)
states: 208,876,076 (8)
abstracting: (1<=p19)
states: 29,510,720 (7)
abstracting: (p19<=1)
states: 208,876,076 (8)
abstracting: (1<=p111)
states: 12,394,480 (7)
abstracting: (p111<=1)
states: 208,876,076 (8)
abstracting: (1<=p14)
states: 10,000,800 (7)
abstracting: (p14<=1)
states: 208,876,076 (8)

before gc: list nodes free: 13828081

after gc: idd nodes used:3531150, unused:60468850; list nodes free:290319232
MC time: 2m40.192sec

checking: [AX [AG [[[[[p43<=0 & 0<=p43] | [p23<=0 & 0<=p23]] & [[p54<=0 & 0<=p54] | [p28<=0 & 0<=p28]]] | AX [[p50<=0 & 0<=p50]]]]] | E [E [~ [[[[p0<=1 & 1<=p0] | [[p64<=1 & 1<=p64] | [p16<=1 & 1<=p16]]] & AX [[p15<=1 & 1<=p15]]]] U EF [[p12<=1 & 1<=p12]]] U [[[~ [[E [[p73<=1 & 1<=p73] U [p55<=1 & 1<=p55]] & AG [[p0<=1 & 1<=p0]]]] | [p38<=1 & 1<=p38]] & EF [EG [[p6<=1 & 1<=p6]]]] & [[p77<=1 & 1<=p77] & [p92<=1 & 1<=p92]]]]]
normalized: [E [E [~ [[~ [EX [~ [[p15<=1 & 1<=p15]]]] & [[[p16<=1 & 1<=p16] | [p64<=1 & 1<=p64]] | [p0<=1 & 1<=p0]]]] U E [true U [p12<=1 & 1<=p12]]] U [[[p92<=1 & 1<=p92] & [p77<=1 & 1<=p77]] & [E [true U EG [[p6<=1 & 1<=p6]]] & [[p38<=1 & 1<=p38] | ~ [[~ [E [true U ~ [[p0<=1 & 1<=p0]]]] & E [[p73<=1 & 1<=p73] U [p55<=1 & 1<=p55]]]]]]]] | ~ [EX [E [true U ~ [[~ [EX [~ [[p50<=0 & 0<=p50]]]] | [[[p28<=0 & 0<=p28] | [p54<=0 & 0<=p54]] & [[p23<=0 & 0<=p23] | [p43<=0 & 0<=p43]]]]]]]]]

abstracting: (0<=p43)
states: 208,876,076 (8)
abstracting: (p43<=0)
states: 156,657,060 (8)
abstracting: (0<=p23)
states: 208,876,076 (8)
abstracting: (p23<=0)
states: 208,876,065 (8)
abstracting: (0<=p54)
states: 208,876,076 (8)
abstracting: (p54<=0)
states: 178,917,596 (8)
abstracting: (0<=p28)
states: 208,876,076 (8)
abstracting: (p28<=0)
states: 199,944,620 (8)
abstracting: (0<=p50)
states: 208,876,076 (8)
abstracting: (p50<=0)
states: 171,957,180 (8)
.MC time: 2m20.051sec

checking: A [[[[1<=p7 & p7<=1] & [[p19<=1 & 1<=p19] & [p36<=1 & 1<=p36]]] & [[p98<=1 & 1<=p98] & [[AX [E [EX [[p69<=1 & 1<=p69]] U EX [[p84<=1 & 1<=p84]]]] | AX [[p35<=1 & 1<=p35]]] & [AF [[[[p77<=1 & 1<=p77] & [p100<=1 & 1<=p100]] | EF [[p73<=1 & 1<=p73]]]] | [[AF [[p13<=1 & 1<=p13]] & A [[p105<=1 & 1<=p105] U [[p57<=1 & 1<=p57] & [p111<=1 & 1<=p111]]]] & [EF [[p103<=1 & 1<=p103]] & [~ [[p90<=1 & 1<=p90]] & [[p17<=1 & 1<=p17] | [[p51<=1 & 1<=p51] & [p111<=1 & 1<=p111]]]]]]]]]] U EX [[~ [[~ [[[p7<=1 & 1<=p7] & [p111<=1 & 1<=p111]]] | [p87<=1 & 1<=p87]]] | [AX [EF [[p17<=1 & 1<=p17]]] | [AX [[p99<=1 & 1<=p99]] & [AG [[p59<=1 & 1<=p59]] | ~ [[p27<=1 & 1<=p27]]]]]]]]
normalized: [~ [EG [~ [EX [[[[[~ [[p27<=1 & 1<=p27]] | ~ [E [true U ~ [[p59<=1 & 1<=p59]]]]] & ~ [EX [~ [[p99<=1 & 1<=p99]]]]] | ~ [EX [~ [E [true U [p17<=1 & 1<=p17]]]]]] | ~ [[[p87<=1 & 1<=p87] | ~ [[[p111<=1 & 1<=p111] & [p7<=1 & 1<=p7]]]]]]]]]] & ~ [E [~ [EX [[[[[~ [[p27<=1 & 1<=p27]] | ~ [E [true U ~ [[p59<=1 & 1<=p59]]]]] & ~ [EX [~ [[p99<=1 & 1<=p99]]]]] | ~ [EX [~ [E [true U [p17<=1 & 1<=p17]]]]]] | ~ [[[p87<=1 & 1<=p87] | ~ [[[p111<=1 & 1<=p111] & [p7<=1 & 1<=p7]]]]]]]] U [~ [[[[[[[[[[[p111<=1 & 1<=p111] & [p51<=1 & 1<=p51]] | [p17<=1 & 1<=p17]] & ~ [[p90<=1 & 1<=p90]]] & E [true U [p103<=1 & 1<=p103]]] & [[~ [EG [~ [[[p111<=1 & 1<=p111] & [p57<=1 & 1<=p57]]]]] & ~ [E [~ [[[p111<=1 & 1<=p111] & [p57<=1 & 1<=p57]]] U [~ [[p105<=1 & 1<=p105]] & ~ [[[p111<=1 & 1<=p111] & [p57<=1 & 1<=p57]]]]]]] & ~ [EG [~ [[p13<=1 & 1<=p13]]]]]] | ~ [EG [~ [[E [true U [p73<=1 & 1<=p73]] | [[p100<=1 & 1<=p100] & [p77<=1 & 1<=p77]]]]]]] & [~ [EX [~ [[p35<=1 & 1<=p35]]]] | ~ [EX [~ [E [EX [[p69<=1 & 1<=p69]] U EX [[p84<=1 & 1<=p84]]]]]]]] & [p98<=1 & 1<=p98]] & [[[p36<=1 & 1<=p36] & [p19<=1 & 1<=p19]] & [1<=p7 & p7<=1]]]] & ~ [EX [[[[[~ [[p27<=1 & 1<=p27]] | ~ [E [true U ~ [[p59<=1 & 1<=p59]]]]] & ~ [EX [~ [[p99<=1 & 1<=p99]]]]] | ~ [EX [~ [E [true U [p17<=1 & 1<=p17]]]]]] | ~ [[[p87<=1 & 1<=p87] | ~ [[[p111<=1 & 1<=p111] & [p7<=1 & 1<=p7]]]]]]]]]]]]

abstracting: (1<=p7)
states: 41,624,832 (7)
abstracting: (p7<=1)
states: 208,876,076 (8)
abstracting: (1<=p111)
states: 12,394,480 (7)
abstracting: (p111<=1)
states: 208,876,076 (8)
abstracting: (1<=p87)
states: 186,624 (5)
abstracting: (p87<=1)
states: 208,876,076 (8)
abstracting: (1<=p17)
states: 9,934,704 (6)
abstracting: (p17<=1)
states: 208,876,076 (8)

before gc: list nodes free: 13636090

after gc: idd nodes used:4011374, unused:59988626; list nodes free:288201492
MC time: 2m 2.358sec

checking: EG [EF [[A [[p89<=1 & 1<=p89] U EX [[p76<=1 & 1<=p76]]] & [EG [[p26<=1 & 1<=p26]] | EX [[p91<=0 & 0<=p91]]]]]]
normalized: EG [E [true U [[EX [[p91<=0 & 0<=p91]] | EG [[p26<=1 & 1<=p26]]] & [~ [EG [~ [EX [[p76<=1 & 1<=p76]]]]] & ~ [E [~ [EX [[p76<=1 & 1<=p76]]] U [~ [[p89<=1 & 1<=p89]] & ~ [EX [[p76<=1 & 1<=p76]]]]]]]]]]

abstracting: (1<=p76)
states: 1
abstracting: (p76<=1)
states: 208,876,076 (8)
.abstracting: (1<=p89)
states: 4,536,576 (6)
abstracting: (p89<=1)
states: 208,876,076 (8)
abstracting: (1<=p76)
states: 1
abstracting: (p76<=1)
states: 208,876,076 (8)
.abstracting: (1<=p76)
states: 1
abstracting: (p76<=1)
states: 208,876,076 (8)
...
EG iterations: 2
abstracting: (1<=p26)
states: 16,043,968 (7)
abstracting: (p26<=1)
states: 208,876,076 (8)
.........
EG iterations: 9
abstracting: (0<=p91)
states: 208,876,076 (8)
abstracting: (p91<=0)
states: 208,689,452 (8)
.
before gc: list nodes free: 5546811

after gc: idd nodes used:3868421, unused:60131579; list nodes free:288834828

before gc: list nodes free: 19037184

after gc: idd nodes used:4211779, unused:59788221; list nodes free:287327299

before gc: list nodes free: 18633955

after gc: idd nodes used:4226843, unused:59773157; list nodes free:287260583
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5837044 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098268 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

12934 28989 76358 81193
iterations count:430151 (1928), effective:19745 (88)

initing FirstDep: 0m 0.000sec


iterations count:4159 (18), effective:329 (1)

iterations count:4159 (18), effective:329 (1)

iterations count:4082 (18), effective:319 (1)

iterations count:6775 (30), effective:543 (2)

iterations count:243 (1), effective:3 (0)

iterations count:4050 (18), effective:326 (1)

iterations count:5736 (25), effective:483 (2)

iterations count:235 (1), effective:1 (0)

sat_reach.icc:155: Timeout: after 310 sec


iterations count:281 (1), effective:1 (0)

iterations count:281 (1), effective:1 (0)

iterations count:282 (1), effective:5 (0)

iterations count:281 (1), effective:1 (0)

sat_reach.icc:155: Timeout: after 271 sec


sat_reach.icc:155: Timeout: after 237 sec


sat_reach.icc:155: Timeout: after 208 sec


iterations count:223 (1), effective:0 (0)

iterations count:223 (1), effective:0 (0)

iterations count:672 (3), effective:22 (0)

iterations count:223 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 182 sec


iterations count:223 (1), effective:0 (0)

iterations count:255 (1), effective:3 (0)

iterations count:1242 (5), effective:77 (0)

sat_reach.icc:155: Timeout: after 159 sec


iterations count:6709 (30), effective:477 (2)

net_ddint.h:600: Timeout: after 139 sec


iterations count:6561 (29), effective:550 (2)

net_ddint.h:600: Timeout: after 121 sec


iterations count:235 (1), effective:1 (0)

iterations count:31895 (143), effective:2411 (10)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is HealthRecord-PT-10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348500306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-PT-10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;