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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.4K Feb 26 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 7.4K Feb 26 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 17:50 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 50K 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-04-CTLFireability-00
FORMULA_NAME HealthRecord-PT-04-CTLFireability-01
FORMULA_NAME HealthRecord-PT-04-CTLFireability-02
FORMULA_NAME HealthRecord-PT-04-CTLFireability-03
FORMULA_NAME HealthRecord-PT-04-CTLFireability-04
FORMULA_NAME HealthRecord-PT-04-CTLFireability-05
FORMULA_NAME HealthRecord-PT-04-CTLFireability-06
FORMULA_NAME HealthRecord-PT-04-CTLFireability-07
FORMULA_NAME HealthRecord-PT-04-CTLFireability-08
FORMULA_NAME HealthRecord-PT-04-CTLFireability-09
FORMULA_NAME HealthRecord-PT-04-CTLFireability-10
FORMULA_NAME HealthRecord-PT-04-CTLFireability-11
FORMULA_NAME HealthRecord-PT-04-CTLFireability-12
FORMULA_NAME HealthRecord-PT-04-CTLFireability-13
FORMULA_NAME HealthRecord-PT-04-CTLFireability-14
FORMULA_NAME HealthRecord-PT-04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678682650212

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

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

net check time: 0m 0.000sec

init dd package: 0m 3.492sec


RS generation: 0m 7.765sec


-> reachability set: #nodes 63028 (6.3e+04) #states 3,627,455 (6)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

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

MC time: 0m 3.541sec

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

abstracting: (1<=p55)
states: 1
abstracting: (p55<=1)
states: 3,627,455 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 4.391sec

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

abstracting: (0<=p55)
states: 3,627,455 (6)
abstracting: (p55<=0)
states: 3,627,454 (6)
abstracting: (0<=p60)
states: 3,627,455 (6)
abstracting: (p60<=0)
states: 3,621,307 (6)
..
EG iterations: 2
.-> the formula is FALSE

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

MC time: 0m 6.822sec

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

abstracting: (1<=p85)
states: 31,104 (4)
abstracting: (p85<=1)
states: 3,627,455 (6)
abstracting: (1<=p91)
states: 31,104 (4)
abstracting: (p91<=1)
states: 3,627,455 (6)
abstracting: (1<=p91)
states: 31,104 (4)
abstracting: (p91<=1)
states: 3,627,455 (6)
abstracting: (1<=p91)
states: 31,104 (4)
abstracting: (p91<=1)
states: 3,627,455 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HealthRecord-PT-04-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.606sec

checking: AG [EF [EG [AX [[[p13<=1 & 1<=p13] & [p96<=1 & 1<=p96]]]]]]
normalized: ~ [E [true U ~ [E [true U EG [~ [EX [~ [[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]]]]]]]]]]

abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m10.178sec

checking: AG [AF [[[p73<=0 & 0<=p73] | EF [~ [A [[p33<=1 & 1<=p33] U [[p58<=1 & 1<=p58] & [p64<=1 & 1<=p64]]]]]]]]
normalized: ~ [E [true U EG [~ [[E [true U ~ [[~ [EG [~ [[[p64<=1 & 1<=p64] & [p58<=1 & 1<=p58]]]]] & ~ [E [~ [[[p64<=1 & 1<=p64] & [p58<=1 & 1<=p58]]] U [~ [[p33<=1 & 1<=p33]] & ~ [[[p64<=1 & 1<=p64] & [p58<=1 & 1<=p58]]]]]]]]] | [p73<=0 & 0<=p73]]]]]]

abstracting: (0<=p73)
states: 3,627,455 (6)
abstracting: (p73<=0)
states: 3,498,719 (6)
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p64)
states: 128,736 (5)
abstracting: (p64<=1)
states: 3,627,455 (6)
abstracting: (1<=p33)
states: 705,136 (5)
abstracting: (p33<=1)
states: 3,627,455 (6)
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p64)
states: 128,736 (5)
abstracting: (p64<=1)
states: 3,627,455 (6)
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p64)
states: 128,736 (5)
abstracting: (p64<=1)
states: 3,627,455 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.949sec

checking: [EX [[p5<=1 & 1<=p5]] | [EF [[p78<=1 & 1<=p78]] & EF [EX [AX [[[p51<=1 & 1<=p51] | [p52<=1 & 1<=p52]]]]]]]
normalized: [[E [true U EX [~ [EX [~ [[[p52<=1 & 1<=p52] | [p51<=1 & 1<=p51]]]]]]] & E [true U [p78<=1 & 1<=p78]]] | EX [[p5<=1 & 1<=p5]]]

abstracting: (1<=p5)
states: 183,600 (5)
abstracting: (p5<=1)
states: 3,627,455 (6)
.abstracting: (1<=p78)
states: 32,400 (4)
abstracting: (p78<=1)
states: 3,627,455 (6)
abstracting: (1<=p51)
states: 238,480 (5)
abstracting: (p51<=1)
states: 3,627,455 (6)
abstracting: (1<=p52)
states: 376,936 (5)
abstracting: (p52<=1)
states: 3,627,455 (6)
..-> the formula is TRUE

FORMULA HealthRecord-PT-04-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.879sec

checking: AF [E [AG [~ [[p4<=1 & 1<=p4]]] U ~ [[~ [EF [[p64<=1 & 1<=p64]]] | [AG [[p27<=1 & 1<=p27]] | [p74<=1 & 1<=p74]]]]]]
normalized: ~ [EG [~ [E [~ [E [true U [p4<=1 & 1<=p4]]] U ~ [[[[p74<=1 & 1<=p74] | ~ [E [true U ~ [[p27<=1 & 1<=p27]]]]] | ~ [E [true U [p64<=1 & 1<=p64]]]]]]]]]

abstracting: (1<=p64)
states: 128,736 (5)
abstracting: (p64<=1)
states: 3,627,455 (6)
abstracting: (1<=p27)
states: 593,656 (5)
abstracting: (p27<=1)
states: 3,627,455 (6)
abstracting: (1<=p74)
states: 32,400 (4)
abstracting: (p74<=1)
states: 3,627,455 (6)
abstracting: (1<=p4)
states: 183,600 (5)
abstracting: (p4<=1)
states: 3,627,455 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m13.083sec

checking: AX [AF [[EF [[p47<=1 & 1<=p47]] | [[p9<=1 & 1<=p9] & E [A [[p17<=1 & 1<=p17] U [p51<=1 & 1<=p51]] U AX [[p45<=1 & 1<=p45]]]]]]]
normalized: ~ [EX [EG [~ [[[E [[~ [EG [~ [[p51<=1 & 1<=p51]]]] & ~ [E [~ [[p51<=1 & 1<=p51]] U [~ [[p17<=1 & 1<=p17]] & ~ [[p51<=1 & 1<=p51]]]]]] U ~ [EX [~ [[p45<=1 & 1<=p45]]]]] & [p9<=1 & 1<=p9]] | E [true U [p47<=1 & 1<=p47]]]]]]]

abstracting: (1<=p47)
states: 200,304 (5)
abstracting: (p47<=1)
states: 3,627,455 (6)
abstracting: (1<=p9)
states: 183,600 (5)
abstracting: (p9<=1)
states: 3,627,455 (6)
abstracting: (1<=p45)
states: 185,904 (5)
abstracting: (p45<=1)
states: 3,627,455 (6)
.abstracting: (1<=p51)
states: 238,480 (5)
abstracting: (p51<=1)
states: 3,627,455 (6)
abstracting: (1<=p17)
states: 906,861 (5)
abstracting: (p17<=1)
states: 3,627,455 (6)
abstracting: (1<=p51)
states: 238,480 (5)
abstracting: (p51<=1)
states: 3,627,455 (6)
abstracting: (1<=p51)
states: 238,480 (5)
abstracting: (p51<=1)
states: 3,627,455 (6)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m10.422sec

checking: AG [[AF [[E [A [[p35<=1 & 1<=p35] U [p22<=1 & 1<=p22]] U A [[p75<=1 & 1<=p75] U [p94<=1 & 1<=p94]]] | AG [[[p13<=0 & 0<=p13] | [p96<=0 & 0<=p96]]]]] | EF [[p86<=0 & 0<=p86]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [E [true U ~ [[[p96<=0 & 0<=p96] | [p13<=0 & 0<=p13]]]]] | E [[~ [EG [~ [[p22<=1 & 1<=p22]]]] & ~ [E [~ [[p22<=1 & 1<=p22]] U [~ [[p35<=1 & 1<=p35]] & ~ [[p22<=1 & 1<=p22]]]]]] U [~ [EG [~ [[p94<=1 & 1<=p94]]]] & ~ [E [~ [[p94<=1 & 1<=p94]] U [~ [[p75<=1 & 1<=p75]] & ~ [[p94<=1 & 1<=p94]]]]]]]]]]] | E [true U [p86<=0 & 0<=p86]]]]]]

abstracting: (0<=p86)
states: 3,627,455 (6)
abstracting: (p86<=0)
states: 3,486,719 (6)
abstracting: (1<=p94)
states: 137,844 (5)
abstracting: (p94<=1)
states: 3,627,455 (6)
abstracting: (1<=p75)
states: 32,400 (4)
abstracting: (p75<=1)
states: 3,627,455 (6)
abstracting: (1<=p94)
states: 137,844 (5)
abstracting: (p94<=1)
states: 3,627,455 (6)
abstracting: (1<=p94)
states: 137,844 (5)
abstracting: (p94<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p22)
states: 604,208 (5)
abstracting: (p22<=1)
states: 3,627,455 (6)
abstracting: (1<=p35)
states: 718,936 (5)
abstracting: (p35<=1)
states: 3,627,455 (6)
abstracting: (1<=p22)
states: 604,208 (5)
abstracting: (p22<=1)
states: 3,627,455 (6)
abstracting: (1<=p22)
states: 604,208 (5)
abstracting: (p22<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (0<=p13)
states: 3,627,455 (6)
abstracting: (p13<=0)
states: 2,824,491 (6)
abstracting: (0<=p96)
states: 3,627,455 (6)
abstracting: (p96<=0)
states: 3,377,967 (6)
.......
EG iterations: 7
-> the formula is TRUE

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

MC time: 0m12.177sec

checking: AX [[A [[[p17<=1 & 1<=p17] & AG [AX [[p26<=1 & 1<=p26]]]] U AG [~ [EG [[p48<=1 & 1<=p48]]]]] | [AX [[EG [[p16<=1 & 1<=p16]] & [p47<=1 & 1<=p47]]] | A [~ [AG [[[p13<=1 & 1<=p13] & [p96<=1 & 1<=p96]]]] U AX [E [[p73<=1 & 1<=p73] U [p44<=1 & 1<=p44]]]]]]]
normalized: ~ [EX [~ [[[[~ [EG [EX [~ [E [[p73<=1 & 1<=p73] U [p44<=1 & 1<=p44]]]]]] & ~ [E [EX [~ [E [[p73<=1 & 1<=p73] U [p44<=1 & 1<=p44]]]] U [~ [E [true U ~ [[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]]]]] & EX [~ [E [[p73<=1 & 1<=p73] U [p44<=1 & 1<=p44]]]]]]]] | ~ [EX [~ [[[p47<=1 & 1<=p47] & EG [[p16<=1 & 1<=p16]]]]]]] | [~ [EG [E [true U EG [[p48<=1 & 1<=p48]]]]] & ~ [E [E [true U EG [[p48<=1 & 1<=p48]]] U [~ [[~ [E [true U EX [~ [[p26<=1 & 1<=p26]]]]] & [p17<=1 & 1<=p17]]] & E [true U EG [[p48<=1 & 1<=p48]]]]]]]]]]]

abstracting: (1<=p48)
states: 200,304 (5)
abstracting: (p48<=1)
states: 3,627,455 (6)
..........
EG iterations: 10
abstracting: (1<=p17)
states: 906,861 (5)
abstracting: (p17<=1)
states: 3,627,455 (6)
abstracting: (1<=p26)
states: 591,736 (5)
abstracting: (p26<=1)
states: 3,627,455 (6)
.abstracting: (1<=p48)
states: 200,304 (5)
abstracting: (p48<=1)
states: 3,627,455 (6)
..........
EG iterations: 10
abstracting: (1<=p48)
states: 200,304 (5)
abstracting: (p48<=1)
states: 3,627,455 (6)
..........
EG iterations: 10
.
EG iterations: 1
abstracting: (1<=p16)
states: 906,861 (5)
abstracting: (p16<=1)
states: 3,627,455 (6)
..........
EG iterations: 10
abstracting: (1<=p47)
states: 200,304 (5)
abstracting: (p47<=1)
states: 3,627,455 (6)
.abstracting: (1<=p44)
states: 185,904 (5)
abstracting: (p44<=1)
states: 3,627,455 (6)
abstracting: (1<=p73)
states: 128,736 (5)
abstracting: (p73<=1)
states: 3,627,455 (6)
.abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p44)
states: 185,904 (5)
abstracting: (p44<=1)
states: 3,627,455 (6)
abstracting: (1<=p73)
states: 128,736 (5)
abstracting: (p73<=1)
states: 3,627,455 (6)
.abstracting: (1<=p44)
states: 185,904 (5)
abstracting: (p44<=1)
states: 3,627,455 (6)
abstracting: (1<=p73)
states: 128,736 (5)
abstracting: (p73<=1)
states: 3,627,455 (6)
..........
EG iterations: 9
.-> the formula is FALSE

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

MC time: 0m13.486sec

checking: E [EX [~ [[[EX [[p71<=1 & 1<=p71]] | [EG [[[p29<=1 & 1<=p29] & [p96<=1 & 1<=p96]]] | [p45<=1 & 1<=p45]]] & EF [[[p13<=1 & 1<=p13] | [p91<=1 & 1<=p91]]]]]] U ~ [E [AG [[~ [[p70<=1 & 1<=p70]] | [p32<=1 & 1<=p32]]] U AG [~ [[[p58<=1 & 1<=p58] & [p84<=1 & 1<=p84]]]]]]]
normalized: E [EX [~ [[E [true U [[p91<=1 & 1<=p91] | [p13<=1 & 1<=p13]]] & [[[p45<=1 & 1<=p45] | EG [[[p96<=1 & 1<=p96] & [p29<=1 & 1<=p29]]]] | EX [[p71<=1 & 1<=p71]]]]]] U ~ [E [~ [E [true U ~ [[[p32<=1 & 1<=p32] | ~ [[p70<=1 & 1<=p70]]]]]] U ~ [E [true U [[p84<=1 & 1<=p84] & [p58<=1 & 1<=p58]]]]]]]

abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p84)
states: 128,736 (5)
abstracting: (p84<=1)
states: 3,627,455 (6)
abstracting: (1<=p70)
states: 128,736 (5)
abstracting: (p70<=1)
states: 3,627,455 (6)
abstracting: (1<=p32)
states: 10
abstracting: (p32<=1)
states: 3,627,455 (6)
abstracting: (1<=p71)
states: 32,400 (4)
abstracting: (p71<=1)
states: 3,627,455 (6)
.abstracting: (1<=p29)
states: 619,476 (5)
abstracting: (p29<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
......
EG iterations: 6
abstracting: (1<=p45)
states: 185,904 (5)
abstracting: (p45<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p91)
states: 31,104 (4)
abstracting: (p91<=1)
states: 3,627,455 (6)
.-> the formula is TRUE

FORMULA HealthRecord-PT-04-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.863sec

checking: EF [[EX [[[p58<=1 & 1<=p58] & [p93<=1 & 1<=p93]]] & [[[[p7<=1 & 1<=p7] | [p33<=1 & 1<=p33]] | [[p38<=1 & 1<=p38] | [[p90<=0 & 0<=p90] & [[p55<=0 & 0<=p55] & [p57<=1 & 1<=p57]]]]] & [EX [[[p46<=0 & 0<=p46] & [[p58<=0 & 0<=p58] | [p70<=0 & 0<=p70]]]] | [EX [[[p13<=1 & 1<=p13] & [p72<=1 & 1<=p72]]] | ~ [A [[p69<=1 & 1<=p69] U AG [[[p58<=1 & 1<=p58] & [p81<=1 & 1<=p81]]]]]]]]]]
normalized: E [true U [[[[[p33<=1 & 1<=p33] | [p7<=1 & 1<=p7]] | [[[[p57<=1 & 1<=p57] & [p55<=0 & 0<=p55]] & [p90<=0 & 0<=p90]] | [p38<=1 & 1<=p38]]] & [[~ [[~ [EG [E [true U ~ [[[p81<=1 & 1<=p81] & [p58<=1 & 1<=p58]]]]]] & ~ [E [E [true U ~ [[[p81<=1 & 1<=p81] & [p58<=1 & 1<=p58]]]] U [E [true U ~ [[[p81<=1 & 1<=p81] & [p58<=1 & 1<=p58]]]] & ~ [[p69<=1 & 1<=p69]]]]]]] | EX [[[p72<=1 & 1<=p72] & [p13<=1 & 1<=p13]]]] | EX [[[[p70<=0 & 0<=p70] | [p58<=0 & 0<=p58]] & [p46<=0 & 0<=p46]]]]] & EX [[[p93<=1 & 1<=p93] & [p58<=1 & 1<=p58]]]]]

abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p93)
states: 243,672 (5)
abstracting: (p93<=1)
states: 3,627,455 (6)
.abstracting: (0<=p46)
states: 3,627,455 (6)
abstracting: (p46<=0)
states: 3,437,951 (6)
abstracting: (0<=p58)
states: 3,627,455 (6)
abstracting: (p58<=0)
states: 2,972,451 (6)
abstracting: (0<=p70)
states: 3,627,455 (6)
abstracting: (p70<=0)
states: 3,498,719 (6)
.abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p72)
states: 32,400 (4)
abstracting: (p72<=1)
states: 3,627,455 (6)
.abstracting: (1<=p69)
states: 32,400 (4)
abstracting: (p69<=1)
states: 3,627,455 (6)
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p81)
states: 128,736 (5)
abstracting: (p81<=1)
states: 3,627,455 (6)
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p81)
states: 128,736 (5)
abstracting: (p81<=1)
states: 3,627,455 (6)
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p81)
states: 128,736 (5)
abstracting: (p81<=1)
states: 3,627,455 (6)

EG iterations: 0
abstracting: (1<=p38)
states: 705,136 (5)
abstracting: (p38<=1)
states: 3,627,455 (6)
abstracting: (0<=p90)
states: 3,627,455 (6)
abstracting: (p90<=0)
states: 3,627,454 (6)
abstracting: (0<=p55)
states: 3,627,455 (6)
abstracting: (p55<=0)
states: 3,627,454 (6)
abstracting: (1<=p57)
states: 1
abstracting: (p57<=1)
states: 3,627,455 (6)
abstracting: (1<=p7)
states: 129,888 (5)
abstracting: (p7<=1)
states: 3,627,455 (6)
abstracting: (1<=p33)
states: 705,136 (5)
abstracting: (p33<=1)
states: 3,627,455 (6)
-> the formula is TRUE

FORMULA HealthRecord-PT-04-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.091sec

checking: EX [[[EF [[p21<=1 & 1<=p21]] | [p50<=1 & 1<=p50]] & [AX [[[AG [[p4<=0 & 0<=p4]] & EX [[[[[p14<=1 & 1<=p14] & [p18<=1 & 1<=p18]] & [[p24<=1 & 1<=p24] & [p30<=1 & 1<=p30]]] & [[[p37<=1 & 1<=p37] & [p41<=1 & 1<=p41]] & [[p58<=1 & 1<=p58] & [p97<=1 & 1<=p97]]]]]] & [[p11<=1 & 1<=p11] & [p19<=1 & 1<=p19]]]] | [EF [[p47<=1 & 1<=p47]] & [[p6<=0 & 0<=p6] & [p16<=0 & 0<=p16]]]]]]
normalized: EX [[[~ [EX [~ [[[[p19<=1 & 1<=p19] & [p11<=1 & 1<=p11]] & [EX [[[[[p97<=1 & 1<=p97] & [p58<=1 & 1<=p58]] & [[p41<=1 & 1<=p41] & [p37<=1 & 1<=p37]]] & [[[p30<=1 & 1<=p30] & [p24<=1 & 1<=p24]] & [[p18<=1 & 1<=p18] & [p14<=1 & 1<=p14]]]]] & ~ [E [true U ~ [[p4<=0 & 0<=p4]]]]]]]]] | [[[p16<=0 & 0<=p16] & [p6<=0 & 0<=p6]] & E [true U [p47<=1 & 1<=p47]]]] & [[p50<=1 & 1<=p50] | E [true U [p21<=1 & 1<=p21]]]]]

abstracting: (1<=p21)
states: 593,656 (5)
abstracting: (p21<=1)
states: 3,627,455 (6)
abstracting: (1<=p50)
states: 185,904 (5)
abstracting: (p50<=1)
states: 3,627,455 (6)
abstracting: (1<=p47)
states: 200,304 (5)
abstracting: (p47<=1)
states: 3,627,455 (6)
abstracting: (0<=p6)
states: 3,627,455 (6)
abstracting: (p6<=0)
states: 3,497,567 (6)
abstracting: (0<=p16)
states: 3,627,455 (6)
abstracting: (p16<=0)
states: 2,720,594 (6)
abstracting: (0<=p4)
states: 3,627,455 (6)
abstracting: (p4<=0)
states: 3,443,855 (6)
abstracting: (1<=p14)
states: 802,964 (5)
abstracting: (p14<=1)
states: 3,627,455 (6)
abstracting: (1<=p18)
states: 906,861 (5)
abstracting: (p18<=1)
states: 3,627,455 (6)
abstracting: (1<=p24)
states: 619,476 (5)
abstracting: (p24<=1)
states: 3,627,455 (6)
abstracting: (1<=p30)
states: 619,476 (5)
abstracting: (p30<=1)
states: 3,627,455 (6)
abstracting: (1<=p37)
states: 740,908 (5)
abstracting: (p37<=1)
states: 3,627,455 (6)
abstracting: (1<=p41)
states: 740,872 (5)
abstracting: (p41<=1)
states: 3,627,455 (6)
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p97)
states: 508,921 (5)
abstracting: (p97<=1)
states: 3,627,455 (6)
.abstracting: (1<=p11)
states: 183,600 (5)
abstracting: (p11<=1)
states: 3,627,455 (6)
abstracting: (1<=p19)
states: 906,861 (5)
abstracting: (p19<=1)
states: 3,627,455 (6)
..-> the formula is TRUE

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

MC time: 0m 7.409sec

checking: A [[[~ [[AX [~ [[[p13<=1 & 1<=p13] & [p96<=1 & 1<=p96]]]] & [[p36<=1 & 1<=p36] & [p96<=1 & 1<=p96]]]] | [AF [EG [[p82<=1 & 1<=p82]]] | A [[[[[p14<=1 & 1<=p14] & [p18<=1 & 1<=p18]] & [[p24<=1 & 1<=p24] & [p30<=1 & 1<=p30]]] & [[[p37<=1 & 1<=p37] & [p41<=1 & 1<=p41]] & [[p59<=1 & 1<=p59] & [p91<=1 & 1<=p91]]]] U [[p13<=1 & 1<=p13] & [p72<=1 & 1<=p72]]]]] | [[AF [[[[p23<=1 & 1<=p23] & [p96<=1 & 1<=p96]] | [p88<=1 & 1<=p88]]] | [p46<=1 & 1<=p46]] | [~ [[p60<=1 & 1<=p60]] | [[p42<=1 & 1<=p42] & [p48<=1 & 1<=p48]]]]] U [AG [[[[p13<=1 & 1<=p13] & [p76<=1 & 1<=p76]] | [[p13<=1 & 1<=p13] & [p96<=1 & 1<=p96]]]] | [EF [[[EG [[p65<=1 & 1<=p65]] & [AF [[p13<=1 & 1<=p13]] & A [[p26<=1 & 1<=p26] U [p61<=1 & 1<=p61]]]] | AG [~ [[[p58<=1 & 1<=p58] & [p95<=1 & 1<=p95]]]]]] | AG [[[AG [[p44<=1 & 1<=p44]] | [[p22<=1 & 1<=p22] | [[p13<=1 & 1<=p13] & [p96<=1 & 1<=p96]]]] & [[p29<=1 & 1<=p29] & [p96<=1 & 1<=p96]]]]]]]
normalized: [~ [EG [~ [[[~ [E [true U ~ [[[[p96<=1 & 1<=p96] & [p29<=1 & 1<=p29]] & [[[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]] | [p22<=1 & 1<=p22]] | ~ [E [true U ~ [[p44<=1 & 1<=p44]]]]]]]]] | E [true U [~ [E [true U [[p95<=1 & 1<=p95] & [p58<=1 & 1<=p58]]]] | [[[~ [EG [~ [[p61<=1 & 1<=p61]]]] & ~ [E [~ [[p61<=1 & 1<=p61]] U [~ [[p26<=1 & 1<=p26]] & ~ [[p61<=1 & 1<=p61]]]]]] & ~ [EG [~ [[p13<=1 & 1<=p13]]]]] & EG [[p65<=1 & 1<=p65]]]]]] | ~ [E [true U ~ [[[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]] | [[p76<=1 & 1<=p76] & [p13<=1 & 1<=p13]]]]]]]]]] & ~ [E [~ [[[~ [E [true U ~ [[[[p96<=1 & 1<=p96] & [p29<=1 & 1<=p29]] & [[[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]] | [p22<=1 & 1<=p22]] | ~ [E [true U ~ [[p44<=1 & 1<=p44]]]]]]]]] | E [true U [~ [E [true U [[p95<=1 & 1<=p95] & [p58<=1 & 1<=p58]]]] | [[[~ [EG [~ [[p61<=1 & 1<=p61]]]] & ~ [E [~ [[p61<=1 & 1<=p61]] U [~ [[p26<=1 & 1<=p26]] & ~ [[p61<=1 & 1<=p61]]]]]] & ~ [EG [~ [[p13<=1 & 1<=p13]]]]] & EG [[p65<=1 & 1<=p65]]]]]] | ~ [E [true U ~ [[[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]] | [[p76<=1 & 1<=p76] & [p13<=1 & 1<=p13]]]]]]]] U [~ [[[[[~ [EG [~ [[[p72<=1 & 1<=p72] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p72<=1 & 1<=p72] & [p13<=1 & 1<=p13]]] U [~ [[[[[p91<=1 & 1<=p91] & [p59<=1 & 1<=p59]] & [[p41<=1 & 1<=p41] & [p37<=1 & 1<=p37]]] & [[[p30<=1 & 1<=p30] & [p24<=1 & 1<=p24]] & [[p18<=1 & 1<=p18] & [p14<=1 & 1<=p14]]]]] & ~ [[[p72<=1 & 1<=p72] & [p13<=1 & 1<=p13]]]]]]] | ~ [EG [~ [EG [[p82<=1 & 1<=p82]]]]]] | ~ [[[[p96<=1 & 1<=p96] & [p36<=1 & 1<=p36]] & ~ [EX [[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]]]]]]] | [[[[p42<=1 & 1<=p42] & [p48<=1 & 1<=p48]] | ~ [[p60<=1 & 1<=p60]]] | [[p46<=1 & 1<=p46] | ~ [EG [~ [[[p88<=1 & 1<=p88] | [[p96<=1 & 1<=p96] & [p23<=1 & 1<=p23]]]]]]]]]] & ~ [[[~ [E [true U ~ [[[[p96<=1 & 1<=p96] & [p29<=1 & 1<=p29]] & [[[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]] | [p22<=1 & 1<=p22]] | ~ [E [true U ~ [[p44<=1 & 1<=p44]]]]]]]]] | E [true U [~ [E [true U [[p95<=1 & 1<=p95] & [p58<=1 & 1<=p58]]]] | [[[~ [EG [~ [[p61<=1 & 1<=p61]]]] & ~ [E [~ [[p61<=1 & 1<=p61]] U [~ [[p26<=1 & 1<=p26]] & ~ [[p61<=1 & 1<=p61]]]]]] & ~ [EG [~ [[p13<=1 & 1<=p13]]]]] & EG [[p65<=1 & 1<=p65]]]]]] | ~ [E [true U ~ [[[[p96<=1 & 1<=p96] & [p13<=1 & 1<=p13]] | [[p76<=1 & 1<=p76] & [p13<=1 & 1<=p13]]]]]]]]]]]]

abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p76)
states: 32,400 (4)
abstracting: (p76<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p65)
states: 32,400 (4)
abstracting: (p65<=1)
states: 3,627,455 (6)
.......
EG iterations: 7
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
abstracting: (1<=p26)
states: 591,736 (5)
abstracting: (p26<=1)
states: 3,627,455 (6)
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p95)
states: 242,276 (5)
abstracting: (p95<=1)
states: 3,627,455 (6)

before gc: list nodes free: 953043

after gc: idd nodes used:624175, unused:63375825; list nodes free:295023402
abstracting: (1<=p44)
states: 185,904 (5)
abstracting: (p44<=1)
states: 3,627,455 (6)
abstracting: (1<=p22)
states: 604,208 (5)
abstracting: (p22<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p29)
states: 619,476 (5)
abstracting: (p29<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p23)
states: 619,476 (5)
abstracting: (p23<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p88)
states: 1
abstracting: (p88<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p46)
states: 189,504 (5)
abstracting: (p46<=1)
states: 3,627,455 (6)
abstracting: (1<=p60)
states: 6,148 (3)
abstracting: (p60<=1)
states: 3,627,455 (6)
abstracting: (1<=p48)
states: 200,304 (5)
abstracting: (p48<=1)
states: 3,627,455 (6)
abstracting: (1<=p42)
states: 710,104 (5)
abstracting: (p42<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
.abstracting: (1<=p36)
states: 740,908 (5)
abstracting: (p36<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p82)
states: 9,216 (3)
abstracting: (p82<=1)
states: 3,627,455 (6)
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p72)
states: 32,400 (4)
abstracting: (p72<=1)
states: 3,627,455 (6)
abstracting: (1<=p14)
states: 802,964 (5)
abstracting: (p14<=1)
states: 3,627,455 (6)
abstracting: (1<=p18)
states: 906,861 (5)
abstracting: (p18<=1)
states: 3,627,455 (6)
abstracting: (1<=p24)
states: 619,476 (5)
abstracting: (p24<=1)
states: 3,627,455 (6)
abstracting: (1<=p30)
states: 619,476 (5)
abstracting: (p30<=1)
states: 3,627,455 (6)
abstracting: (1<=p37)
states: 740,908 (5)
abstracting: (p37<=1)
states: 3,627,455 (6)
abstracting: (1<=p41)
states: 740,872 (5)
abstracting: (p41<=1)
states: 3,627,455 (6)
abstracting: (1<=p59)
states: 655,005 (5)
abstracting: (p59<=1)
states: 3,627,455 (6)
abstracting: (1<=p91)
states: 31,104 (4)
abstracting: (p91<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p72)
states: 32,400 (4)
abstracting: (p72<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p72)
states: 32,400 (4)
abstracting: (p72<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p76)
states: 32,400 (4)
abstracting: (p76<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p65)
states: 32,400 (4)
abstracting: (p65<=1)
states: 3,627,455 (6)
.......
EG iterations: 7
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
abstracting: (1<=p26)
states: 591,736 (5)
abstracting: (p26<=1)
states: 3,627,455 (6)
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p95)
states: 242,276 (5)
abstracting: (p95<=1)
states: 3,627,455 (6)
abstracting: (1<=p44)
states: 185,904 (5)
abstracting: (p44<=1)
states: 3,627,455 (6)
abstracting: (1<=p22)
states: 604,208 (5)
abstracting: (p22<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p29)
states: 619,476 (5)
abstracting: (p29<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p76)
states: 32,400 (4)
abstracting: (p76<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p65)
states: 32,400 (4)
abstracting: (p65<=1)
states: 3,627,455 (6)
.......
EG iterations: 7
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
abstracting: (1<=p26)
states: 591,736 (5)
abstracting: (p26<=1)
states: 3,627,455 (6)
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
abstracting: (1<=p61)
states: 32,400 (4)
abstracting: (p61<=1)
states: 3,627,455 (6)
.
EG iterations: 1
abstracting: (1<=p58)
states: 655,004 (5)
abstracting: (p58<=1)
states: 3,627,455 (6)
abstracting: (1<=p95)
states: 242,276 (5)
abstracting: (p95<=1)
states: 3,627,455 (6)
abstracting: (1<=p44)
states: 185,904 (5)
abstracting: (p44<=1)
states: 3,627,455 (6)
abstracting: (1<=p22)
states: 604,208 (5)
abstracting: (p22<=1)
states: 3,627,455 (6)
abstracting: (1<=p13)
states: 802,964 (5)
abstracting: (p13<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
abstracting: (1<=p29)
states: 619,476 (5)
abstracting: (p29<=1)
states: 3,627,455 (6)
abstracting: (1<=p96)
states: 249,488 (5)
abstracting: (p96<=1)
states: 3,627,455 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m59.101sec

totally nodes used: 80857498 (8.1e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 72106828 230614164 302720992
used/not used/entry size/cache size: 40990245 26118619 16 1024MB
basic ops cache: hits/miss/sum: 30968535 101123250 132091785
used/not used/entry size/cache size: 13817026 2960190 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: 221114 791810 1012924
used/not used/entry size/cache size: 186106 8202502 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 52917399
1 11481362
2 2218260
3 415104
4 66524
5 9067
6 1032
7 98
8 13
9 0
>= 10 5

Total processing time: 3m27.023sec


BK_STOP 1678682869698

--------------------
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


iterations count:89000 (475), effective:3382 (18)

initing FirstDep: 0m 0.000sec


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

iterations count:14944 (79), effective:554 (2)

iterations count:8675 (46), effective:442 (2)

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

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

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

iterations count:14944 (79), effective:554 (2)

iterations count:19533 (104), effective:911 (4)

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

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

iterations count:2577 (13), effective:142 (0)

iterations count:21718 (116), effective:952 (5)

iterations count:2463 (13), effective:136 (0)

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

iterations count:2499 (13), effective:134 (0)

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

iterations count:2525 (13), effective:136 (0)

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

iterations count:6291 (33), effective:111 (0)

iterations count:384 (2), effective:13 (0)

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

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

iterations count:6374 (34), effective:349 (1)

iterations count:2491 (13), effective:136 (0)

iterations count:2506 (13), effective:136 (0)

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

iterations count:2506 (13), effective:136 (0)

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

iterations count:2506 (13), effective:136 (0)

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

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

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

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

iterations count:2591 (13), effective:146 (0)

iterations count:2451 (13), effective:134 (0)

iterations count:397 (2), effective:11 (0)

iterations count:496 (2), effective:18 (0)

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

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

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

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

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

iterations count:3764 (20), effective:207 (1)

iterations count:2601 (13), effective:127 (0)

iterations count:2525 (13), effective:136 (0)

iterations count:2499 (13), effective:134 (0)

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

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

iterations count:8797 (47), effective:470 (2)

iterations count:9380 (50), effective:456 (2)

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

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

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

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

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

iterations count:8797 (47), effective:470 (2)

iterations count:9380 (50), effective:456 (2)

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

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

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

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

iterations count:8797 (47), effective:470 (2)

iterations count:9380 (50), effective:456 (2)

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

iterations count:564 (3), effective:22 (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-04"
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-04, 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-167840348400258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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