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-167840348400274.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348400274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 11K Feb 26 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:11 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 67K 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-06-CTLFireability-00
FORMULA_NAME HealthRecord-PT-06-CTLFireability-01
FORMULA_NAME HealthRecord-PT-06-CTLFireability-02
FORMULA_NAME HealthRecord-PT-06-CTLFireability-03
FORMULA_NAME HealthRecord-PT-06-CTLFireability-04
FORMULA_NAME HealthRecord-PT-06-CTLFireability-05
FORMULA_NAME HealthRecord-PT-06-CTLFireability-06
FORMULA_NAME HealthRecord-PT-06-CTLFireability-07
FORMULA_NAME HealthRecord-PT-06-CTLFireability-08
FORMULA_NAME HealthRecord-PT-06-CTLFireability-09
FORMULA_NAME HealthRecord-PT-06-CTLFireability-10
FORMULA_NAME HealthRecord-PT-06-CTLFireability-11
FORMULA_NAME HealthRecord-PT-06-CTLFireability-12
FORMULA_NAME HealthRecord-PT-06-CTLFireability-13
FORMULA_NAME HealthRecord-PT-06-CTLFireability-14
FORMULA_NAME HealthRecord-PT-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678683288182

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-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 04:54:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 04:54:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 04:54:51] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-13 04:54:51] [INFO ] Transformed 154 places.
[2023-03-13 04:54:51] [INFO ] Transformed 319 transitions.
[2023-03-13 04:54:51] [INFO ] Found NUPN structural information;
[2023-03-13 04:54:51] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 62 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 294/294 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 100 transition count 192
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 100 transition count 192
Applied a total of 108 rules in 29 ms. Remains 100 /154 variables (removed 54) and now considering 192/294 (removed 102) transitions.
[2023-03-13 04:54:51] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
// Phase 1: matrix 186 rows 100 cols
[2023-03-13 04:54:51] [INFO ] Computed 12 place invariants in 20 ms
[2023-03-13 04:54:51] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-13 04:54:51] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2023-03-13 04:54:51] [INFO ] Invariant cache hit.
[2023-03-13 04:54:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:54:51] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-13 04:54:51] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2023-03-13 04:54:51] [INFO ] Invariant cache hit.
[2023-03-13 04:54:51] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/154 places, 192/294 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 100/154 places, 192/294 transitions.
Support contains 62 out of 100 places after structural reductions.
[2023-03-13 04:54:52] [INFO ] Flatten gal took : 61 ms
[2023-03-13 04:54:52] [INFO ] Flatten gal took : 24 ms
[2023-03-13 04:54:52] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 61 out of 100 places (down from 62) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 493 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 59) seen :33
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
[2023-03-13 04:54:53] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2023-03-13 04:54:53] [INFO ] Invariant cache hit.
[2023-03-13 04:54:53] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-13 04:54:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-13 04:54:53] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-13 04:54:54] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :21
[2023-03-13 04:54:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 04:54:54] [INFO ] After 218ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :21
[2023-03-13 04:54:54] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 8 ms to minimize.
[2023-03-13 04:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-13 04:54:54] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2023-03-13 04:54:54] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2023-03-13 04:54:55] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2023-03-13 04:54:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2023-03-13 04:54:55] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2023-03-13 04:54:55] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2023-03-13 04:54:55] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2023-03-13 04:54:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 261 ms
[2023-03-13 04:54:55] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :21
Attempting to minimize the solution found.
Minimization took 230 ms.
[2023-03-13 04:54:55] [INFO ] After 2011ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :21
Fused 24 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 24 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 73 edges and 100 vertex of which 12 / 100 are part of one of the 6 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 392 edges and 94 vertex of which 91 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 91 transition count 169
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 87 transition count 163
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 85 transition count 162
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 19 place count 85 transition count 158
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 30 place count 78 transition count 158
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 48 place count 60 transition count 122
Iterating global reduction 3 with 18 rules applied. Total rules applied 66 place count 60 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 70 place count 56 transition count 114
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 56 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 80 place count 56 transition count 108
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 82 place count 55 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 55 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 54 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 54 transition count 108
Applied a total of 86 rules in 62 ms. Remains 54 /100 variables (removed 46) and now considering 108/192 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 54/100 places, 108/192 transitions.
Incomplete random walk after 10000 steps, including 1416 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 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 34 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 35 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 36 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Finished probabilistic random walk after 15002 steps, run visited all 20 properties in 109 ms. (steps per millisecond=137 )
Probabilistic random walk after 15002 steps, saw 3368 distinct states, run finished after 109 ms. (steps per millisecond=137 ) properties seen :20
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 04:54:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 04:54:56] [INFO ] Flatten gal took : 16 ms
FORMULA HealthRecord-PT-06-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 04:54:56] [INFO ] Flatten gal took : 14 ms
[2023-03-13 04:54:56] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 49 out of 100 places (down from 53) after GAL structural reductions.
Computed a total of 11 stabilizing places and 19 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 115 edges and 100 vertex of which 14 / 100 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 60 transition count 123
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 60 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 73 place count 52 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 81 place count 52 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 90 place count 52 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 50 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 50 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 48 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 48 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 104 place count 48 transition count 82
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 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 2 with 4 rules applied. Total rules applied 115 place count 46 transition count 73
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 42 transition count 69
Applied a total of 119 rules in 45 ms. Remains 42 /100 variables (removed 58) and now considering 69/192 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 42/100 places, 69/192 transitions.
[2023-03-13 04:54:56] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:56] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:56] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 64 transition count 123
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 64 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 56 transition count 107
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 56 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 56 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 55 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 55 transition count 95
Applied a total of 99 rules in 8 ms. Remains 55 /100 variables (removed 45) and now considering 95/192 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 55/100 places, 95/192 transitions.
[2023-03-13 04:54:56] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:56] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:56] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 122 edges and 100 vertex of which 14 / 100 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 61 transition count 124
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 61 transition count 124
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 71 place count 53 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 79 place count 53 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 88 place count 53 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 51 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 49 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 49 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 49 transition count 83
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 49 transition count 76
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 2 with 4 rules applied. Total rules applied 113 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 43 transition count 70
Applied a total of 117 rules in 26 ms. Remains 43 /100 variables (removed 57) and now considering 70/192 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 43/100 places, 70/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 128 edges and 100 vertex of which 12 / 100 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 63 transition count 128
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 63 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 67 place count 57 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 73 place count 57 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 82 place count 57 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 56 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 56 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 55 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 55 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 89 place count 55 transition count 99
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 55 transition count 94
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 2 with 2 rules applied. Total rules applied 96 place count 54 transition count 93
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 50 transition count 89
Applied a total of 100 rules in 29 ms. Remains 50 /100 variables (removed 50) and now considering 89/192 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 50/100 places, 89/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 133 edges and 100 vertex of which 14 / 100 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 60 transition count 123
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 60 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 72 place count 53 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 79 place count 53 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 88 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 51 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 51 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 49 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 49 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 102 place count 49 transition count 84
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 49 transition count 77
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 2 with 4 rules applied. Total rules applied 113 place count 47 transition count 75
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 43 transition count 71
Applied a total of 117 rules in 20 ms. Remains 43 /100 variables (removed 57) and now considering 71/192 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 43/100 places, 71/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 66 transition count 127
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 66 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 60 transition count 115
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 60 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 60 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 59 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 59 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 58 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 58 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 92 place count 58 transition count 102
Applied a total of 92 rules in 5 ms. Remains 58 /100 variables (removed 42) and now considering 102/192 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/100 places, 102/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 67 transition count 129
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 67 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 64 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 64 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 75 place count 64 transition count 120
Applied a total of 75 rules in 3 ms. Remains 64 /100 variables (removed 36) and now considering 120/192 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/100 places, 120/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 8 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 111 edges and 100 vertex of which 14 / 100 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 61 transition count 125
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 61 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 69 place count 55 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 75 place count 55 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 84 place count 55 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 53 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 51 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 51 transition count 94
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 97 place count 51 transition count 89
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 104 place count 51 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 2 with 4 rules applied. Total rules applied 108 place count 49 transition count 80
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 45 transition count 76
Applied a total of 112 rules in 26 ms. Remains 45 /100 variables (removed 55) and now considering 76/192 (removed 116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 45/100 places, 76/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 67 transition count 129
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 67 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 60 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 60 transition count 115
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 87 place count 60 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 57 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 54 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 54 transition count 93
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 108 place count 54 transition count 84
Applied a total of 108 rules in 4 ms. Remains 54 /100 variables (removed 46) and now considering 84/192 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/100 places, 84/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 65 transition count 124
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 65 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 59 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 59 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 88 place count 59 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 58 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 58 transition count 103
Applied a total of 90 rules in 3 ms. Remains 58 /100 variables (removed 42) and now considering 103/192 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 58/100 places, 103/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 7 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 66 transition count 127
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 66 transition count 127
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 58 transition count 111
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 58 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 90 place count 58 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 56 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 56 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 54 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 54 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 104 place count 54 transition count 89
Applied a total of 104 rules in 4 ms. Remains 54 /100 variables (removed 46) and now considering 89/192 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/100 places, 89/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 5 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 66 transition count 127
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 66 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 60 transition count 115
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 60 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 60 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 59 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 59 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 58 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 58 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 58 transition count 101
Applied a total of 93 rules in 4 ms. Remains 58 /100 variables (removed 42) and now considering 101/192 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/100 places, 101/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 6 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Graph (trivial) has 135 edges and 100 vertex of which 14 / 100 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 60 transition count 122
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 60 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 75 place count 52 transition count 106
Iterating global reduction 0 with 8 rules applied. Total rules applied 83 place count 52 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 92 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 49 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 46 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 46 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 113 place count 46 transition count 73
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 46 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 40 transition count 60
Applied a total of 132 rules in 14 ms. Remains 40 /100 variables (removed 60) and now considering 60/192 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 40/100 places, 60/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 62 transition count 119
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 62 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 55 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 55 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 99 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 53 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 51 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 51 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 113 place count 51 transition count 80
Applied a total of 113 rules in 4 ms. Remains 51 /100 variables (removed 49) and now considering 80/192 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 51/100 places, 80/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 192/192 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 62 transition count 119
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 62 transition count 119
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 54 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 54 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 101 place count 54 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 51 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 51 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 48 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 48 transition count 79
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 122 place count 48 transition count 70
Applied a total of 122 rules in 4 ms. Remains 48 /100 variables (removed 52) and now considering 70/192 (removed 122) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/100 places, 70/192 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 4 ms
[2023-03-13 04:54:57] [INFO ] Input system was already deterministic with 70 transitions.
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 9 ms
[2023-03-13 04:54:57] [INFO ] Flatten gal took : 9 ms
[2023-03-13 04:54:57] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 04:54:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 192 transitions and 564 arcs took 2 ms.
Total runtime 6560 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: 100 NrTr: 192 NrArc: 564)

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

net check time: 0m 0.000sec

init dd package: 0m 3.270sec


RS generation: 0m11.138sec


-> reachability set: #nodes 219261 (2.2e+05) #states 38,090,507 (7)



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

checking: AF [AG [AF [[p82<=0 & 0<=p82]]]]
normalized: ~ [EG [E [true U EG [~ [[p82<=0 & 0<=p82]]]]]]

abstracting: (0<=p82)
states: 38,090,507 (7)
abstracting: (p82<=0)
states: 38,028,299 (7)
....
EG iterations: 4
.
EG iterations: 1
-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.276sec

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

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 38,090,507 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.928sec

checking: EF [AX [[p37<=1 & 1<=p37]]]
normalized: E [true U ~ [EX [~ [[p37<=1 & 1<=p37]]]]]

abstracting: (1<=p37)
states: 9,522,624 (6)
abstracting: (p37<=1)
states: 38,090,507 (7)
.-> the formula is TRUE

FORMULA HealthRecord-PT-06-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.946sec

checking: AG [EX [EG [[[p63<=0 & 0<=p63] | [p83<=0 & 0<=p83]]]]]
normalized: ~ [E [true U ~ [EX [EG [[[p83<=0 & 0<=p83] | [p63<=0 & 0<=p63]]]]]]]

abstracting: (0<=p63)
states: 38,090,507 (7)
abstracting: (p63<=0)
states: 32,120,843 (7)
abstracting: (0<=p83)
states: 38,090,507 (7)
abstracting: (p83<=0)
states: 38,028,299 (7)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 3.765sec

checking: EG [EF [[[p71<=1 & 1<=p71] & [[p25<=0 & 0<=p25] | [p98<=0 & 0<=p98]]]]]
normalized: EG [E [true U [[[p98<=0 & 0<=p98] | [p25<=0 & 0<=p25]] & [p71<=1 & 1<=p71]]]]

abstracting: (1<=p71)
states: 62,208 (4)
abstracting: (p71<=1)
states: 38,090,507 (7)
abstracting: (0<=p25)
states: 38,090,507 (7)
abstracting: (p25<=0)
states: 32,424,203 (7)
abstracting: (0<=p98)
states: 38,090,507 (7)
abstracting: (p98<=0)
states: 35,853,323 (7)
....
EG iterations: 4
-> the formula is TRUE

FORMULA HealthRecord-PT-06-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.783sec

checking: EF [[[p5<=1 & 1<=p5] & AX [[AF [[p14<=0 & 0<=p14]] | [p77<=0 & 0<=p77]]]]]
normalized: E [true U [~ [EX [~ [[[p77<=0 & 0<=p77] | ~ [EG [~ [[p14<=0 & 0<=p14]]]]]]]] & [p5<=1 & 1<=p5]]]

abstracting: (1<=p5)
states: 1,684,224 (6)
abstracting: (p5<=1)
states: 38,090,507 (7)
abstracting: (0<=p14)
states: 38,090,507 (7)
abstracting: (p14<=0)
states: 35,033,867 (7)
.......
EG iterations: 7
abstracting: (0<=p77)
states: 38,090,507 (7)
abstracting: (p77<=0)
states: 35,938,571 (7)
.-> the formula is TRUE

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

MC time: 0m11.233sec

checking: AG [EF [[[p60<=0 & 0<=p60] | EF [[[p53<=0 & 0<=p53] & [p78<=0 & 0<=p78]]]]]]
normalized: ~ [E [true U ~ [E [true U [E [true U [[p78<=0 & 0<=p78] & [p53<=0 & 0<=p53]]] | [p60<=0 & 0<=p60]]]]]]

abstracting: (0<=p60)
states: 38,090,507 (7)
abstracting: (p60<=0)
states: 38,090,506 (7)
abstracting: (0<=p53)
states: 38,090,507 (7)
abstracting: (p53<=0)
states: 37,668,875 (7)
abstracting: (0<=p78)
states: 38,090,507 (7)
abstracting: (p78<=0)
states: 38,028,299 (7)
-> the formula is TRUE

FORMULA HealthRecord-PT-06-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.069sec

checking: [EG [EF [[EG [[p15<=0 & 0<=p15]] | [[p63<=1 & 1<=p63] & [p89<=1 & 1<=p89]]]]] & EF [[p40<=1 & 1<=p40]]]
normalized: [E [true U [p40<=1 & 1<=p40]] & EG [E [true U [[[p89<=1 & 1<=p89] & [p63<=1 & 1<=p63]] | EG [[p15<=0 & 0<=p15]]]]]]

abstracting: (0<=p15)
states: 38,090,507 (7)
abstracting: (p15<=0)
states: 35,033,867 (7)
.
EG iterations: 1
abstracting: (1<=p63)
states: 5,969,664 (6)
abstracting: (p63<=1)
states: 38,090,507 (7)
abstracting: (1<=p89)
states: 2,237,184 (6)
abstracting: (p89<=1)
states: 38,090,507 (7)

EG iterations: 0
abstracting: (1<=p40)
states: 10
abstracting: (p40<=1)
states: 38,090,507 (7)

before gc: list nodes free: 1882486

after gc: idd nodes used:1002741, unused:62997259; list nodes free:284983567
-> the formula is TRUE

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

MC time: 2m22.188sec

checking: AG [~ [E [[EG [[p83<=1 & 1<=p83]] & [AF [[p55<=1 & 1<=p55]] & [p6<=1 & 1<=p6]]] U [[p25<=1 & 1<=p25] & [p98<=1 & 1<=p98]]]]]
normalized: ~ [E [true U E [[[[p6<=1 & 1<=p6] & ~ [EG [~ [[p55<=1 & 1<=p55]]]]] & EG [[p83<=1 & 1<=p83]]] U [[p98<=1 & 1<=p98] & [p25<=1 & 1<=p25]]]]]

abstracting: (1<=p25)
states: 5,666,304 (6)
abstracting: (p25<=1)
states: 38,090,507 (7)
abstracting: (1<=p98)
states: 2,237,184 (6)
abstracting: (p98<=1)
states: 38,090,507 (7)
abstracting: (1<=p83)
states: 62,208 (4)
abstracting: (p83<=1)
states: 38,090,507 (7)
....
EG iterations: 4
abstracting: (1<=p55)
states: 1,910,016 (6)
abstracting: (p55<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,769,280 (6)
abstracting: (p6<=1)
states: 38,090,507 (7)
-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 2.396sec

checking: A [[A [[p10<=1 & 1<=p10] U [~ [AF [[p21<=1 & 1<=p21]]] | AX [EX [[p92<=1 & 1<=p92]]]]] | [p96<=1 & 1<=p96]] U ~ [EF [EG [[p2<=1 & 1<=p2]]]]]
normalized: [~ [EG [E [true U EG [[p2<=1 & 1<=p2]]]]] & ~ [E [E [true U EG [[p2<=1 & 1<=p2]]] U [~ [[[p96<=1 & 1<=p96] | [~ [EG [~ [[~ [EX [~ [EX [[p92<=1 & 1<=p92]]]]] | EG [~ [[p21<=1 & 1<=p21]]]]]]] & ~ [E [~ [[~ [EX [~ [EX [[p92<=1 & 1<=p92]]]]] | EG [~ [[p21<=1 & 1<=p21]]]]] U [~ [[p10<=1 & 1<=p10]] & ~ [[~ [EX [~ [EX [[p92<=1 & 1<=p92]]]]] | EG [~ [[p21<=1 & 1<=p21]]]]]]]]]]] & E [true U EG [[p2<=1 & 1<=p2]]]]]]]

abstracting: (1<=p2)
states: 4,758,528 (6)
abstracting: (p2<=1)
states: 38,090,507 (7)
.......
EG iterations: 7

before gc: list nodes free: 4078488

after gc: idd nodes used:905759, unused:63094241; list nodes free:285372084
abstracting: (1<=p21)
states: 4,422,912 (6)
abstracting: (p21<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p92)
states: 1
abstracting: (p92<=1)
states: 38,090,507 (7)
..abstracting: (1<=p10)
states: 2,939,136 (6)
abstracting: (p10<=1)
states: 38,090,507 (7)
abstracting: (1<=p21)
states: 4,422,912 (6)
abstracting: (p21<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p92)
states: 1
abstracting: (p92<=1)
states: 38,090,507 (7)
..abstracting: (1<=p21)
states: 4,422,912 (6)
abstracting: (p21<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p92)
states: 1
abstracting: (p92<=1)
states: 38,090,507 (7)
.........
EG iterations: 7
abstracting: (1<=p96)
states: 817,920 (5)
abstracting: (p96<=1)
states: 38,090,507 (7)
abstracting: (1<=p2)
states: 4,758,528 (6)
abstracting: (p2<=1)
states: 38,090,507 (7)
.......
EG iterations: 7
abstracting: (1<=p2)
states: 4,758,528 (6)
abstracting: (p2<=1)
states: 38,090,507 (7)
.......
EG iterations: 7
.
EG iterations: 1
-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m22.227sec

checking: AG [[EF [[~ [[p41<=1 & 1<=p41]] & ~ [[p8<=1 & 1<=p8]]]] | [E [~ [[p22<=1 & 1<=p22]] U [[p63<=1 & 1<=p63] & [p87<=1 & 1<=p87]]] | EX [AF [[p31<=1 & 1<=p31]]]]]]
normalized: ~ [E [true U ~ [[[EX [~ [EG [~ [[p31<=1 & 1<=p31]]]]] | E [~ [[p22<=1 & 1<=p22]] U [[p87<=1 & 1<=p87] & [p63<=1 & 1<=p63]]]] | E [true U [~ [[p8<=1 & 1<=p8]] & ~ [[p41<=1 & 1<=p41]]]]]]]]

abstracting: (1<=p41)
states: 9,522,624 (6)
abstracting: (p41<=1)
states: 38,090,507 (7)
abstracting: (1<=p8)
states: 5,899,008 (6)
abstracting: (p8<=1)
states: 38,090,507 (7)
abstracting: (1<=p63)
states: 5,969,664 (6)
abstracting: (p63<=1)
states: 38,090,507 (7)
abstracting: (1<=p87)
states: 2,151,936 (6)
abstracting: (p87<=1)
states: 38,090,507 (7)
abstracting: (1<=p22)
states: 2,279,424 (6)
abstracting: (p22<=1)
states: 38,090,507 (7)

before gc: list nodes free: 2652816

after gc: idd nodes used:1323737, unused:62676263; list nodes free:283543433
abstracting: (1<=p31)
states: 9,522,624 (6)
abstracting: (p31<=1)
states: 38,090,507 (7)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 5.575sec

checking: E [EX [[~ [AX [~ [[[p8<=1 & 1<=p8] & [p98<=1 & 1<=p98]]]]] | E [~ [[p51<=1 & 1<=p51]] U EX [[p15<=1 & 1<=p15]]]]] U [EX [AG [~ [AX [[p35<=1 & 1<=p35]]]]] & [p82<=1 & 1<=p82]]]
normalized: E [EX [[E [~ [[p51<=1 & 1<=p51]] U EX [[p15<=1 & 1<=p15]]] | EX [[[p98<=1 & 1<=p98] & [p8<=1 & 1<=p8]]]]] U [[p82<=1 & 1<=p82] & EX [~ [E [true U ~ [EX [~ [[p35<=1 & 1<=p35]]]]]]]]]

abstracting: (1<=p35)
states: 9,522,624 (6)
abstracting: (p35<=1)
states: 38,090,507 (7)
..abstracting: (1<=p82)
states: 62,208 (4)
abstracting: (p82<=1)
states: 38,090,507 (7)
abstracting: (1<=p8)
states: 5,899,008 (6)
abstracting: (p8<=1)
states: 38,090,507 (7)
abstracting: (1<=p98)
states: 2,237,184 (6)
abstracting: (p98<=1)
states: 38,090,507 (7)
.abstracting: (1<=p15)
states: 3,056,640 (6)
abstracting: (p15<=1)
states: 38,090,507 (7)
.abstracting: (1<=p51)
states: 3,588,864 (6)
abstracting: (p51<=1)
states: 38,090,507 (7)
.-> the formula is TRUE

FORMULA HealthRecord-PT-06-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m59.234sec

checking: AG [[EG [EF [[[p8<=0 & 0<=p8] | [p98<=0 & 0<=p98]]]] & [[[p85<=0 & 0<=p85] | [AX [[p67<=0 & 0<=p67]] & AX [[[p8<=0 & 0<=p8] | [p98<=0 & 0<=p98]]]]] & [EF [EG [[p15<=1 & 1<=p15]]] | ~ [A [~ [AF [[[p63<=1 & 1<=p63] & [p79<=1 & 1<=p79]]]] U ~ [AF [[p48<=1 & 1<=p48]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [EG [~ [EG [~ [[p48<=1 & 1<=p48]]]]]] & ~ [E [~ [EG [~ [[p48<=1 & 1<=p48]]]] U [~ [EG [~ [[[p79<=1 & 1<=p79] & [p63<=1 & 1<=p63]]]]] & ~ [EG [~ [[p48<=1 & 1<=p48]]]]]]]]] | E [true U EG [[p15<=1 & 1<=p15]]]] & [[~ [EX [~ [[[p98<=0 & 0<=p98] | [p8<=0 & 0<=p8]]]]] & ~ [EX [~ [[p67<=0 & 0<=p67]]]]] | [p85<=0 & 0<=p85]]] & EG [E [true U [[p98<=0 & 0<=p98] | [p8<=0 & 0<=p8]]]]]]]]

abstracting: (0<=p8)
states: 38,090,507 (7)
abstracting: (p8<=0)
states: 32,191,499 (7)
abstracting: (0<=p98)
states: 38,090,507 (7)
abstracting: (p98<=0)
states: 35,853,323 (7)

EG iterations: 0
abstracting: (0<=p85)
states: 38,090,507 (7)
abstracting: (p85<=0)
states: 35,931,659 (7)
abstracting: (0<=p67)
states: 38,090,507 (7)
abstracting: (p67<=0)
states: 37,350,923 (7)
.abstracting: (0<=p8)
states: 38,090,507 (7)
abstracting: (p8<=0)
states: 32,191,499 (7)
abstracting: (0<=p98)
states: 38,090,507 (7)
abstracting: (p98<=0)
states: 35,853,323 (7)
.abstracting: (1<=p15)
states: 3,056,640 (6)
abstracting: (p15<=1)
states: 38,090,507 (7)
.......
EG iterations: 7

before gc: list nodes free: 555670

after gc: idd nodes used:1415206, unused:62584794; list nodes free:283134616
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p63)
states: 5,969,664 (6)
abstracting: (p63<=1)
states: 38,090,507 (7)
abstracting: (1<=p79)
states: 62,208 (4)
abstracting: (p79<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 38,090,507 (7)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 2m48.264sec

checking: A [EX [[~ [EG [[p93<=1 & 1<=p93]]] & A [[~ [[[p8<=1 & 1<=p8] & [p98<=1 & 1<=p98]]] | ~ [[p28<=1 & 1<=p28]]] U A [[p67<=1 & 1<=p67] U [p7<=1 & 1<=p7]]]]] U EX [E [[~ [[[p75<=1 & 1<=p75] | [p23<=1 & 1<=p23]]] | AG [[p95<=1 & 1<=p95]]] U AG [[[p8<=1 & 1<=p8] | [[p25<=1 & 1<=p25] & [p98<=1 & 1<=p98]]]]]]]
normalized: [~ [EG [~ [EX [E [[~ [E [true U ~ [[p95<=1 & 1<=p95]]]] | ~ [[[p23<=1 & 1<=p23] | [p75<=1 & 1<=p75]]]] U ~ [E [true U ~ [[[[p98<=1 & 1<=p98] & [p25<=1 & 1<=p25]] | [p8<=1 & 1<=p8]]]]]]]]]] & ~ [E [~ [EX [E [[~ [E [true U ~ [[p95<=1 & 1<=p95]]]] | ~ [[[p23<=1 & 1<=p23] | [p75<=1 & 1<=p75]]]] U ~ [E [true U ~ [[[[p98<=1 & 1<=p98] & [p25<=1 & 1<=p25]] | [p8<=1 & 1<=p8]]]]]]]] U [~ [EX [[[~ [EG [~ [[~ [EG [~ [[p7<=1 & 1<=p7]]]] & ~ [E [~ [[p7<=1 & 1<=p7]] U [~ [[p67<=1 & 1<=p67]] & ~ [[p7<=1 & 1<=p7]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p7<=1 & 1<=p7]]]] & ~ [E [~ [[p7<=1 & 1<=p7]] U [~ [[p67<=1 & 1<=p67]] & ~ [[p7<=1 & 1<=p7]]]]]]] U [~ [[~ [[p28<=1 & 1<=p28]] | ~ [[[p98<=1 & 1<=p98] & [p8<=1 & 1<=p8]]]]] & ~ [[~ [EG [~ [[p7<=1 & 1<=p7]]]] & ~ [E [~ [[p7<=1 & 1<=p7]] U [~ [[p67<=1 & 1<=p67]] & ~ [[p7<=1 & 1<=p7]]]]]]]]]]] & ~ [EG [[p93<=1 & 1<=p93]]]]]] & ~ [EX [E [[~ [E [true U ~ [[p95<=1 & 1<=p95]]]] | ~ [[[p23<=1 & 1<=p23] | [p75<=1 & 1<=p75]]]] U ~ [E [true U ~ [[[[p98<=1 & 1<=p98] & [p25<=1 & 1<=p25]] | [p8<=1 & 1<=p8]]]]]]]]]]]]

abstracting: (1<=p8)
states: 5,899,008 (6)
abstracting: (p8<=1)
states: 38,090,507 (7)
abstracting: (1<=p25)
states: 5,666,304 (6)
abstracting: (p25<=1)
states: 38,090,507 (7)
abstracting: (1<=p98)
states: 2,237,184 (6)
abstracting: (p98<=1)
states: 38,090,507 (7)
abstracting: (1<=p75)
states: 62,208 (4)
abstracting: (p75<=1)
states: 38,090,507 (7)
abstracting: (1<=p23)
states: 2,181,888 (6)
abstracting: (p23<=1)
states: 38,090,507 (7)
abstracting: (1<=p95)
states: 2,237,184 (6)
abstracting: (p95<=1)
states: 38,090,507 (7)

before gc: list nodes free: 148327

after gc: idd nodes used:1691377, unused:62308623; list nodes free:281851750
.abstracting: (1<=p93)
states: 62,208 (4)
abstracting: (p93<=1)
states: 38,090,507 (7)
....
EG iterations: 4
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
abstracting: (1<=p67)
states: 739,584 (5)
abstracting: (p67<=1)
states: 38,090,507 (7)
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p8)
states: 5,899,008 (6)
abstracting: (p8<=1)
states: 38,090,507 (7)
abstracting: (1<=p98)
states: 2,237,184 (6)
abstracting: (p98<=1)
states: 38,090,507 (7)
abstracting: (1<=p28)
states: 9,522,624 (6)
abstracting: (p28<=1)
states: 38,090,507 (7)
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
abstracting: (1<=p67)
states: 739,584 (5)
abstracting: (p67<=1)
states: 38,090,507 (7)
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
.
EG iterations: 1
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
abstracting: (1<=p67)
states: 739,584 (5)
abstracting: (p67<=1)
states: 38,090,507 (7)
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
abstracting: (1<=p7)
states: 4,769,280 (6)
abstracting: (p7<=1)
states: 38,090,507 (7)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (1<=p8)
states: 5,899,008 (6)
abstracting: (p8<=1)
states: 38,090,507 (7)
abstracting: (1<=p25)
states: 5,666,304 (6)
abstracting: (p25<=1)
states: 38,090,507 (7)
abstracting: (1<=p98)
states: 2,237,184 (6)
abstracting: (p98<=1)
states: 38,090,507 (7)
abstracting: (1<=p75)
states: 62,208 (4)
abstracting: (p75<=1)
states: 38,090,507 (7)
abstracting: (1<=p23)
states: 2,181,888 (6)
abstracting: (p23<=1)
states: 38,090,507 (7)
abstracting: (1<=p95)
states: 2,237,184 (6)
abstracting: (p95<=1)
states: 38,090,507 (7)
.abstracting: (1<=p8)
states: 5,899,008 (6)
abstracting: (p8<=1)
states: 38,090,507 (7)
abstracting: (1<=p25)
states: 5,666,304 (6)
abstracting: (p25<=1)
states: 38,090,507 (7)
abstracting: (1<=p98)
states: 2,237,184 (6)
abstracting: (p98<=1)
states: 38,090,507 (7)
abstracting: (1<=p75)
states: 62,208 (4)
abstracting: (p75<=1)
states: 38,090,507 (7)
abstracting: (1<=p23)
states: 2,181,888 (6)
abstracting: (p23<=1)
states: 38,090,507 (7)
abstracting: (1<=p95)
states: 2,237,184 (6)
abstracting: (p95<=1)
states: 38,090,507 (7)
..
EG iterations: 1
-> the formula is TRUE

FORMULA HealthRecord-PT-06-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m17.916sec

checking: [EF [[AF [[[p46<=1 & 1<=p46] & [p98<=1 & 1<=p98]]] & [[p72<=0 & 0<=p72] & ~ [E [[p74<=1 & 1<=p74] U [p49<=1 & 1<=p49]]]]]] & AX [AG [[[AG [[p56<=1 & 1<=p56]] | [[[p83<=1 & 1<=p83] & [p67<=1 & 1<=p67]] | [p14<=0 & 0<=p14]]] & ~ [E [[[p63<=1 & 1<=p63] & [p97<=1 & 1<=p97]] U [[[p8<=1 & 1<=p8] & [p16<=1 & 1<=p16]] & [[p25<=1 & 1<=p25] & [p88<=1 & 1<=p88]]]]]]]]]
normalized: [E [true U [~ [EG [~ [[[p98<=1 & 1<=p98] & [p46<=1 & 1<=p46]]]]] & [~ [E [[p74<=1 & 1<=p74] U [p49<=1 & 1<=p49]]] & [p72<=0 & 0<=p72]]]] & ~ [EX [E [true U ~ [[~ [E [[[p97<=1 & 1<=p97] & [p63<=1 & 1<=p63]] U [[[p88<=1 & 1<=p88] & [p25<=1 & 1<=p25]] & [[p16<=1 & 1<=p16] & [p8<=1 & 1<=p8]]]]] & [[[p14<=0 & 0<=p14] | [[p67<=1 & 1<=p67] & [p83<=1 & 1<=p83]]] | ~ [E [true U ~ [[p56<=1 & 1<=p56]]]]]]]]]]]

abstracting: (1<=p56)
states: 870,144 (5)
abstracting: (p56<=1)
states: 38,090,507 (7)
abstracting: (1<=p83)
states: 62,208 (4)
abstracting: (p83<=1)
states: 38,090,507 (7)
abstracting: (1<=p67)
states: 739,584 (5)
abstracting: (p67<=1)
states: 38,090,507 (7)
abstracting: (0<=p14)
states: 38,090,507 (7)
abstracting: (p14<=0)
states: 35,033,867 (7)
abstracting: (1<=p8)
states: 5,899,008 (6)
abstracting: (p8<=1)
states: 38,090,507 (7)
abstracting: (1<=p16)
states: 9,300,480 (6)
abstracting: (p16<=1)
states: 38,090,507 (7)
abstracting: (1<=p25)
states: 5,666,304 (6)
abstracting: (p25<=1)
states: 38,090,507 (7)
abstracting: (1<=p88)
states: 817,920 (5)
abstracting: (p88<=1)
states: 38,090,507 (7)
abstracting: (1<=p63)
states: 5,969,664 (6)
abstracting: (p63<=1)
states: 38,090,507 (7)
abstracting: (1<=p97)
states: 2,237,184 (6)
abstracting: (p97<=1)
states: 38,090,507 (7)
.abstracting: (0<=p72)
states: 38,090,507 (7)
abstracting: (p72<=0)
states: 37,350,923 (7)
abstracting: (1<=p49)
states: 3,588,864 (6)
abstracting: (p49<=1)
states: 38,090,507 (7)
abstracting: (1<=p74)
states: 62,208 (4)
abstracting: (p74<=1)
states: 38,090,507 (7)
abstracting: (1<=p46)
states: 12,696,832 (7)
abstracting: (p46<=1)
states: 38,090,507 (7)
abstracting: (1<=p98)
states: 2,237,184 (6)
abstracting: (p98<=1)
states: 38,090,507 (7)
.
EG iterations: 1

before gc: list nodes free: 2582951

after gc: idd nodes used:2241491, unused:61758509; list nodes free:279415860
-> the formula is FALSE

FORMULA HealthRecord-PT-06-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m41.113sec

totally nodes used: 381653632 (3.8e+08)
number of garbage collections: 6
fire ops cache: hits/miss/sum: 365405060 1148498786 1513903846
used/not used/entry size/cache size: 14643977 52464887 16 1024MB
basic ops cache: hits/miss/sum: 147662029 454576219 602238248
used/not used/entry size/cache size: 6894372 9882844 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1053300 3527575 4580875
used/not used/entry size/cache size: 0 8388608 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61778278
1 4589289
2 605400
3 113402
4 19281
5 2812
6 356
7 40
8 6
9 0
>= 10 0

Total processing time: 21m 1.524sec


BK_STOP 1678684560456

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.003sec

7020
iterations count:122246 (636), effective:3177 (16)

initing FirstDep: 0m 0.000sec


iterations count:6514 (33), effective:365 (1)

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

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

iterations count:13890 (72), effective:669 (3)

iterations count:13890 (72), effective:669 (3)

iterations count:6554 (34), effective:364 (1)

iterations count:6561 (34), effective:365 (1)

iterations count:234 (1), effective:2 (0)

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

iterations count:1781 (9), effective:82 (0)

iterations count:20356 (106), effective:995 (5)

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

iterations count:4769 (24), effective:272 (1)

iterations count:3349 (17), effective:180 (0)

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

iterations count:3349 (17), effective:180 (0)

iterations count:4876 (25), effective:272 (1)

iterations count:3349 (17), effective:180 (0)

iterations count:13141 (68), effective:786 (4)

iterations count:9732 (50), effective:580 (3)

iterations count:2471 (12), effective:67 (0)

iterations count:13866 (72), effective:668 (3)

iterations count:5874 (30), effective:306 (1)

iterations count:6423 (33), effective:351 (1)

iterations count:733 (3), effective:17 (0)

iterations count:6533 (34), effective:363 (1)

iterations count:1965 (10), effective:66 (0)

iterations count:13433 (69), effective:793 (4)

iterations count:295 (1), effective:11 (0)

iterations count:2437 (12), effective:64 (0)

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

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

iterations count:3270 (17), effective:181 (0)

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

iterations count:13433 (69), effective:793 (4)

iterations count:295 (1), effective:11 (0)

iterations count:2437 (12), effective:64 (0)

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

iterations count:13433 (69), effective:793 (4)

iterations count:295 (1), effective:11 (0)

iterations count:2437 (12), effective:64 (0)

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

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

iterations count:11464 (59), effective:665 (3)

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

iterations count:3169 (16), effective:180 (0)

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-06"
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-06, 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-167840348400274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-06.tgz
mv HealthRecord-PT-06 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 ;