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.r490-tall-167912709300946.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 UtahNoC-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709300946
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 205K Mar 5 18:23 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 UtahNoC-PT-none-CTLFireability-00
FORMULA_NAME UtahNoC-PT-none-CTLFireability-01
FORMULA_NAME UtahNoC-PT-none-CTLFireability-02
FORMULA_NAME UtahNoC-PT-none-CTLFireability-03
FORMULA_NAME UtahNoC-PT-none-CTLFireability-04
FORMULA_NAME UtahNoC-PT-none-CTLFireability-05
FORMULA_NAME UtahNoC-PT-none-CTLFireability-06
FORMULA_NAME UtahNoC-PT-none-CTLFireability-07
FORMULA_NAME UtahNoC-PT-none-CTLFireability-08
FORMULA_NAME UtahNoC-PT-none-CTLFireability-09
FORMULA_NAME UtahNoC-PT-none-CTLFireability-10
FORMULA_NAME UtahNoC-PT-none-CTLFireability-11
FORMULA_NAME UtahNoC-PT-none-CTLFireability-12
FORMULA_NAME UtahNoC-PT-none-CTLFireability-13
FORMULA_NAME UtahNoC-PT-none-CTLFireability-14
FORMULA_NAME UtahNoC-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679358372932

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=UtahNoC-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:26:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 00:26:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:26:14] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-21 00:26:14] [INFO ] Transformed 216 places.
[2023-03-21 00:26:14] [INFO ] Transformed 977 transitions.
[2023-03-21 00:26:14] [INFO ] Found NUPN structural information;
[2023-03-21 00:26:14] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Support contains 101 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 194 transition count 759
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 194 transition count 759
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 61 place count 194 transition count 742
Applied a total of 61 rules in 41 ms. Remains 194 /216 variables (removed 22) and now considering 742/829 (removed 87) transitions.
[2023-03-21 00:26:14] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
// Phase 1: matrix 376 rows 194 cols
[2023-03-21 00:26:14] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-21 00:26:15] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-21 00:26:15] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
[2023-03-21 00:26:15] [INFO ] Invariant cache hit.
[2023-03-21 00:26:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-21 00:26:15] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2023-03-21 00:26:15] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
[2023-03-21 00:26:15] [INFO ] Invariant cache hit.
[2023-03-21 00:26:15] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 194/216 places, 742/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 194/216 places, 742/829 transitions.
Support contains 101 out of 194 places after structural reductions.
[2023-03-21 00:26:15] [INFO ] Flatten gal took : 67 ms
[2023-03-21 00:26:15] [INFO ] Flatten gal took : 32 ms
[2023-03-21 00:26:15] [INFO ] Input system was already deterministic with 742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 86) seen :59
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-21 00:26:16] [INFO ] Flow matrix only has 376 transitions (discarded 366 similar events)
[2023-03-21 00:26:16] [INFO ] Invariant cache hit.
[2023-03-21 00:26:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-21 00:26:16] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:26
[2023-03-21 00:26:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 00:26:17] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :25
[2023-03-21 00:26:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-21 00:26:17] [INFO ] After 374ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :2 sat :25
[2023-03-21 00:26:18] [INFO ] After 1015ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :25
Attempting to minimize the solution found.
Minimization took 349 ms.
[2023-03-21 00:26:18] [INFO ] After 2004ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :25
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 228 ms.
Support contains 42 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 216 edges and 194 vertex of which 46 / 194 are part of one of the 14 SCC in 3 ms
Free SCC test removed 32 places
Drop transitions removed 167 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 162 transition count 539
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 159 transition count 537
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 157 transition count 537
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 157 transition count 535
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 15 place count 155 transition count 535
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 26 place count 144 transition count 493
Iterating global reduction 3 with 11 rules applied. Total rules applied 37 place count 144 transition count 493
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 44 place count 144 transition count 486
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 143 transition count 483
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 143 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 143 transition count 482
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 5 with 4 rules applied. Total rules applied 51 place count 141 transition count 480
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 55 place count 141 transition count 476
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 57 place count 139 transition count 472
Iterating global reduction 6 with 2 rules applied. Total rules applied 59 place count 139 transition count 472
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 60 place count 138 transition count 470
Iterating global reduction 6 with 1 rules applied. Total rules applied 61 place count 138 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 62 place count 138 transition count 469
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 78 place count 138 transition count 453
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 81 place count 135 transition count 450
Iterating global reduction 7 with 3 rules applied. Total rules applied 84 place count 135 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 86 place count 135 transition count 448
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 88 place count 134 transition count 461
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 97 place count 134 transition count 452
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 116 place count 125 transition count 442
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 117 place count 125 transition count 441
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 121 place count 125 transition count 441
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 122 place count 124 transition count 440
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 57 edges and 123 vertex of which 14 / 123 are part of one of the 5 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 124 place count 114 transition count 440
Drop transitions removed 16 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 10 with 28 rules applied. Total rules applied 152 place count 114 transition count 412
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 156 place count 110 transition count 396
Iterating global reduction 11 with 4 rules applied. Total rules applied 160 place count 110 transition count 396
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 161 place count 109 transition count 392
Iterating global reduction 11 with 1 rules applied. Total rules applied 162 place count 109 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 163 place count 109 transition count 391
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 168 place count 109 transition count 386
Applied a total of 168 rules in 172 ms. Remains 109 /194 variables (removed 85) and now considering 386/742 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 109/194 places, 386/742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 25) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 00:26:19] [INFO ] Flow matrix only has 218 transitions (discarded 168 similar events)
// Phase 1: matrix 218 rows 109 cols
[2023-03-21 00:26:19] [INFO ] Computed 7 place invariants in 10 ms
[2023-03-21 00:26:19] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-21 00:26:19] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 00:26:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-21 00:26:19] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 00:26:19] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-21 00:26:19] [INFO ] After 34ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 00:26:19] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-21 00:26:19] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 10 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 386/386 transitions.
Graph (trivial) has 81 edges and 109 vertex of which 26 / 109 are part of one of the 8 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions removed 27 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 54 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 91 transition count 331
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 89 transition count 331
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 59 edges and 89 vertex of which 3 / 89 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 10 place count 87 transition count 326
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 13 place count 87 transition count 323
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 23 place count 77 transition count 283
Iterating global reduction 2 with 10 rules applied. Total rules applied 33 place count 77 transition count 283
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 45 place count 77 transition count 271
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 74 transition count 263
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 74 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 74 transition count 261
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 59 place count 71 transition count 269
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 71 transition count 262
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 69 place count 71 transition count 259
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 76 place count 68 transition count 255
Applied a total of 76 rules in 24 ms. Remains 68 /109 variables (removed 41) and now considering 255/386 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 68/109 places, 255/386 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 00:26:19] [INFO ] Flow matrix only has 151 transitions (discarded 104 similar events)
// Phase 1: matrix 151 rows 68 cols
[2023-03-21 00:26:19] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-21 00:26:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-21 00:26:20] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 00:26:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-21 00:26:20] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 00:26:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-21 00:26:20] [INFO ] After 12ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 00:26:20] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-21 00:26:20] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 255/255 transitions.
Graph (trivial) has 49 edges and 68 vertex of which 9 / 68 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 21 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 2 place count 62 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 61 transition count 233
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 60 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 60 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 9 place count 60 transition count 225
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 60 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 11 place count 59 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 59 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 59 transition count 222
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 14 place count 59 transition count 221
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 17 place count 58 transition count 219
Applied a total of 17 rules in 17 ms. Remains 58 /68 variables (removed 10) and now considering 219/255 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 58/68 places, 219/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 00:26:20] [INFO ] Flow matrix only has 130 transitions (discarded 89 similar events)
// Phase 1: matrix 130 rows 58 cols
[2023-03-21 00:26:20] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-21 00:26:20] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned sat
[2023-03-21 00:26:20] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 00:26:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-21 00:26:20] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 00:26:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-21 00:26:20] [INFO ] After 6ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 00:26:20] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-21 00:26:20] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 219/219 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 57 transition count 213
Applied a total of 4 rules in 4 ms. Remains 57 /58 variables (removed 1) and now considering 213/219 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/58 places, 213/219 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 5799 steps, including 1 resets, run visited all 1 properties in 17 ms. (steps per millisecond=341 )
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-21 00:26:20] [INFO ] Flatten gal took : 51 ms
[2023-03-21 00:26:20] [INFO ] Flatten gal took : 43 ms
[2023-03-21 00:26:20] [INFO ] Input system was already deterministic with 742 transitions.
Support contains 91 out of 194 places (down from 96) after GAL structural reductions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 162 transition count 590
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 162 transition count 590
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 162 transition count 565
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 155 transition count 544
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 155 transition count 544
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 155 transition count 535
Applied a total of 112 rules in 18 ms. Remains 155 /194 variables (removed 39) and now considering 535/742 (removed 207) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 155/194 places, 535/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 33 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 16 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 535 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 162 transition count 590
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 162 transition count 590
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 162 transition count 565
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 97 place count 154 transition count 541
Iterating global reduction 1 with 8 rules applied. Total rules applied 105 place count 154 transition count 541
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 154 transition count 531
Applied a total of 115 rules in 20 ms. Remains 154 /194 variables (removed 40) and now considering 531/742 (removed 211) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 154/194 places, 531/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 36 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 14 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 601
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 601
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 80 place count 165 transition count 579
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 160 transition count 564
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 160 transition count 564
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 97 place count 160 transition count 557
Applied a total of 97 rules in 7 ms. Remains 160 /194 variables (removed 34) and now considering 557/742 (removed 185) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 160/194 places, 557/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 13 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 13 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 557 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 310 edges and 194 vertex of which 81 / 194 are part of one of the 13 SCC in 0 ms
Free SCC test removed 68 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 185 edges and 124 vertex of which 25 / 124 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 103 transition count 525
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 83 place count 103 transition count 445
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 105 place count 81 transition count 339
Iterating global reduction 2 with 22 rules applied. Total rules applied 127 place count 81 transition count 339
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 157 place count 81 transition count 309
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 164 place count 74 transition count 292
Iterating global reduction 3 with 7 rules applied. Total rules applied 171 place count 74 transition count 292
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 179 place count 74 transition count 284
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 4 with 4 rules applied. Total rules applied 183 place count 72 transition count 282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 187 place count 72 transition count 278
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 189 place count 70 transition count 272
Iterating global reduction 5 with 2 rules applied. Total rules applied 191 place count 70 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 69 transition count 270
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 69 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 194 place count 69 transition count 269
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 216 place count 69 transition count 247
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 69 transition count 247
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 218 place count 68 transition count 246
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 68 transition count 246
Applied a total of 219 rules in 64 ms. Remains 68 /194 variables (removed 126) and now considering 246/742 (removed 496) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 68/194 places, 246/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 6 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 8 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 160 transition count 579
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 160 transition count 579
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 95 place count 160 transition count 552
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 103 place count 152 transition count 528
Iterating global reduction 1 with 8 rules applied. Total rules applied 111 place count 152 transition count 528
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 121 place count 152 transition count 518
Applied a total of 121 rules in 34 ms. Remains 152 /194 variables (removed 42) and now considering 518/742 (removed 224) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 152/194 places, 518/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 13 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 12 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 307 edges and 194 vertex of which 78 / 194 are part of one of the 15 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 194 edges and 129 vertex of which 23 / 129 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 537
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 86 place count 109 transition count 454
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 109 place count 86 transition count 349
Iterating global reduction 2 with 23 rules applied. Total rules applied 132 place count 86 transition count 349
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 161 place count 86 transition count 320
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 170 place count 77 transition count 297
Iterating global reduction 3 with 9 rules applied. Total rules applied 179 place count 77 transition count 297
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 190 place count 77 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 196 place count 74 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 200 place count 74 transition count 279
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 72 transition count 273
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 72 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 206 place count 72 transition count 271
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 226 place count 72 transition count 251
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 72 transition count 251
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 71 transition count 250
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 71 transition count 250
Applied a total of 229 rules in 58 ms. Remains 71 /194 variables (removed 123) and now considering 250/742 (removed 492) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 71/194 places, 250/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 6 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 22 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 317 edges and 194 vertex of which 82 / 194 are part of one of the 14 SCC in 0 ms
Free SCC test removed 68 places
Ensure Unique test removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 196 edges and 124 vertex of which 26 / 124 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 102 transition count 527
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 89 place count 102 transition count 441
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 112 place count 79 transition count 330
Iterating global reduction 2 with 23 rules applied. Total rules applied 135 place count 79 transition count 330
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 167 place count 79 transition count 298
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 175 place count 71 transition count 278
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 71 transition count 278
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 193 place count 71 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 199 place count 68 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 203 place count 68 transition count 261
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 66 transition count 255
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 66 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 66 transition count 253
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 228 place count 66 transition count 234
Applied a total of 228 rules in 44 ms. Remains 66 /194 variables (removed 128) and now considering 234/742 (removed 508) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 66/194 places, 234/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 160 transition count 580
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 160 transition count 580
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 93 place count 160 transition count 555
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 153 transition count 534
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 153 transition count 534
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 116 place count 153 transition count 525
Applied a total of 116 rules in 17 ms. Remains 153 /194 variables (removed 41) and now considering 525/742 (removed 217) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 153/194 places, 525/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 24 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 525 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 318 edges and 194 vertex of which 84 / 194 are part of one of the 14 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 192 edges and 122 vertex of which 26 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 100 transition count 522
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 89 place count 100 transition count 436
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 112 place count 77 transition count 325
Iterating global reduction 2 with 23 rules applied. Total rules applied 135 place count 77 transition count 325
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 167 place count 77 transition count 293
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 175 place count 69 transition count 273
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 69 transition count 273
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 193 place count 69 transition count 263
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 199 place count 66 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 203 place count 66 transition count 256
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 64 transition count 250
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 64 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 64 transition count 248
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 228 place count 64 transition count 229
Applied a total of 228 rules in 23 ms. Remains 64 /194 variables (removed 130) and now considering 229/742 (removed 513) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 64/194 places, 229/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:26:21] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 604
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 604
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 78 place count 165 transition count 584
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 159 transition count 566
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 159 transition count 566
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 98 place count 159 transition count 558
Applied a total of 98 rules in 23 ms. Remains 159 /194 variables (removed 35) and now considering 558/742 (removed 184) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 159/194 places, 558/742 transitions.
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:26:21] [INFO ] Flatten gal took : 12 ms
[2023-03-21 00:26:22] [INFO ] Input system was already deterministic with 558 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 164 transition count 598
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 164 transition count 598
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 82 place count 164 transition count 576
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 157 transition count 555
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 157 transition count 555
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 105 place count 157 transition count 546
Applied a total of 105 rules in 20 ms. Remains 157 /194 variables (removed 37) and now considering 546/742 (removed 196) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 157/194 places, 546/742 transitions.
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:26:22] [INFO ] Input system was already deterministic with 546 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 162 transition count 589
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 162 transition count 589
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 89 place count 162 transition count 564
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 156 transition count 546
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 156 transition count 546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 107 place count 156 transition count 540
Applied a total of 107 rules in 5 ms. Remains 156 /194 variables (removed 38) and now considering 540/742 (removed 202) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 156/194 places, 540/742 transitions.
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 14 ms
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:26:22] [INFO ] Input system was already deterministic with 540 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 605
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 605
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 78 place count 165 transition count 585
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 160 transition count 570
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 160 transition count 570
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 95 place count 160 transition count 563
Applied a total of 95 rules in 5 ms. Remains 160 /194 variables (removed 34) and now considering 563/742 (removed 179) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 160/194 places, 563/742 transitions.
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 27 ms
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 12 ms
[2023-03-21 00:26:22] [INFO ] Input system was already deterministic with 563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 165 transition count 605
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 165 transition count 605
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 81 place count 165 transition count 582
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 159 transition count 564
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 159 transition count 564
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 100 place count 159 transition count 557
Applied a total of 100 rules in 4 ms. Remains 159 /194 variables (removed 35) and now considering 557/742 (removed 185) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 159/194 places, 557/742 transitions.
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 21 ms
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:26:22] [INFO ] Input system was already deterministic with 557 transitions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 170 transition count 629
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 170 transition count 629
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 69 place count 170 transition count 608
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 75 place count 164 transition count 590
Iterating global reduction 1 with 6 rules applied. Total rules applied 81 place count 164 transition count 590
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 164 transition count 582
Applied a total of 89 rules in 5 ms. Remains 164 /194 variables (removed 30) and now considering 582/742 (removed 160) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 164/194 places, 582/742 transitions.
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 12 ms
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:26:22] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 742/742 transitions.
Graph (trivial) has 310 edges and 194 vertex of which 81 / 194 are part of one of the 13 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 24 place count 103 transition count 415
Iterating global reduction 0 with 23 rules applied. Total rules applied 47 place count 103 transition count 415
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 72 place count 103 transition count 390
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 95 transition count 367
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 95 transition count 367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 98 place count 95 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 92 transition count 354
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 92 transition count 350
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 90 transition count 344
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 90 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 90 transition count 342
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 122 place count 90 transition count 334
Applied a total of 122 rules in 32 ms. Remains 90 /194 variables (removed 104) and now considering 334/742 (removed 408) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 90/194 places, 334/742 transitions.
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 6 ms
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:26:22] [INFO ] Input system was already deterministic with 334 transitions.
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 15 ms
[2023-03-21 00:26:22] [INFO ] Flatten gal took : 15 ms
[2023-03-21 00:26:22] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-21 00:26:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 742 transitions and 2329 arcs took 3 ms.
Total runtime 8393 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: 194 NrTr: 742 NrArc: 2329)

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

net check time: 0m 0.000sec

init dd package: 0m 2.773sec


RS generation: 0m27.764sec


-> reachability set: #nodes 10092 (1.0e+04) #states 2,290,447,549 (9)



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

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

abstracting: (1<=p138)
states: 104,950,260 (8)
abstracting: (p138<=1)
states: 2,290,447,549 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.199sec

checking: EF [AG [[p135<=0 & 0<=p135]]]
normalized: E [true U ~ [E [true U ~ [[p135<=0 & 0<=p135]]]]]

abstracting: (0<=p135)
states: 2,290,447,549 (9)
abstracting: (p135<=0)
states: 2,187,537,577 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.324sec

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

abstracting: (1<=p111)
states: 54,229,812 (7)
abstracting: (p111<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
.-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.797sec

checking: EF [EG [A [[p118<=1 & 1<=p118] U AG [~ [[[p86<=1 & 1<=p86] & [p191<=1 & 1<=p191]]]]]]]
normalized: E [true U EG [[~ [EG [E [true U [[p191<=1 & 1<=p191] & [p86<=1 & 1<=p86]]]]] & ~ [E [E [true U [[p191<=1 & 1<=p191] & [p86<=1 & 1<=p86]]] U [~ [[p118<=1 & 1<=p118]] & E [true U [[p191<=1 & 1<=p191] & [p86<=1 & 1<=p86]]]]]]]]]

abstracting: (1<=p86)
states: 54,974,670 (7)
abstracting: (p86<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p118)
states: 54,095,262 (7)
abstracting: (p118<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p86)
states: 54,974,670 (7)
abstracting: (p86<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p86)
states: 54,974,670 (7)
abstracting: (p86<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.598sec

checking: [EF [AG [[p30<=1 & 1<=p30]]] | AG [E [[p41<=1 & 1<=p41] U ~ [[[p1<=1 & 1<=p1] & [p193<=1 & 1<=p193]]]]]]
normalized: [~ [E [true U ~ [E [[p41<=1 & 1<=p41] U ~ [[[p193<=1 & 1<=p193] & [p1<=1 & 1<=p1]]]]]]] | E [true U ~ [E [true U ~ [[p30<=1 & 1<=p30]]]]]]

abstracting: (1<=p30)
states: 56,798,973 (7)
abstracting: (p30<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p1)
states: 763,482,516 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p193)
states: 104,873,328 (8)
abstracting: (p193<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p41)
states: 56,923,767 (7)
abstracting: (p41<=1)
states: 2,290,447,549 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.110sec

checking: A [EX [[EF [[[p111<=1 & 1<=p111] & [1<=p4 & p4<=1]]] | AX [EG [[1<=p101 & p101<=1]]]]] U EF [[[1<=p169 & p169<=1] & [1<=p28 & p28<=1]]]]
normalized: [~ [EG [~ [E [true U [[1<=p28 & p28<=1] & [1<=p169 & p169<=1]]]]]] & ~ [E [~ [E [true U [[1<=p28 & p28<=1] & [1<=p169 & p169<=1]]]] U [~ [EX [[~ [EX [~ [EG [[1<=p101 & p101<=1]]]]] | E [true U [[1<=p4 & p4<=1] & [p111<=1 & 1<=p111]]]]]] & ~ [E [true U [[1<=p28 & p28<=1] & [1<=p169 & p169<=1]]]]]]]]

abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p28<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p28)
states: 56,798,973 (7)
abstracting: (1<=p111)
states: 54,229,812 (7)
abstracting: (p111<=1)
states: 2,290,447,549 (9)
abstracting: (p4<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p4)
states: 2,290,447,548 (9)
abstracting: (p101<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p101)
states: 54,177,936 (7)
.
EG iterations: 1
..abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p28<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p28)
states: 56,798,973 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p28<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p28)
states: 56,798,973 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.540sec

checking: AG [EF [~ [E [[[p66<=1 & 1<=p66] & [p169<=1 & 1<=p169]] U [EF [[[p109<=1 & 1<=p109] & [p169<=1 & 1<=p169]]] & EG [[[p113<=1 & 1<=p113] & [p169<=1 & 1<=p169]]]]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [E [[[p169<=1 & 1<=p169] & [p66<=1 & 1<=p66]] U [EG [[[p169<=1 & 1<=p169] & [p113<=1 & 1<=p113]]] & E [true U [[p169<=1 & 1<=p169] & [p109<=1 & 1<=p109]]]]]]]]]]

abstracting: (1<=p109)
states: 54,229,812 (7)
abstracting: (p109<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p113)
states: 54,229,812 (7)
abstracting: (p113<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p66)
states: 59,852,412 (7)
abstracting: (p66<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.664sec

checking: EF [[AG [AX [[[[[p123<=1 & 1<=p123] & [p169<=1 & 1<=p169]] & [[p1<=1 & 1<=p1] & [p172<=1 & 1<=p172]]] | [p159<=1 & 1<=p159]]]] | AG [[[p122<=1 & 1<=p122] & [p158<=1 & 1<=p158]]]]]
normalized: E [true U [~ [E [true U ~ [[[p158<=1 & 1<=p158] & [p122<=1 & 1<=p122]]]]] | ~ [E [true U EX [~ [[[p159<=1 & 1<=p159] | [[[p172<=1 & 1<=p172] & [p1<=1 & 1<=p1]] & [[p169<=1 & 1<=p169] & [p123<=1 & 1<=p123]]]]]]]]]]

abstracting: (1<=p123)
states: 54,974,670 (7)
abstracting: (p123<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p1)
states: 763,482,516 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p172)
states: 104,873,328 (8)
abstracting: (p172<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p159)
states: 90,607,068 (7)
abstracting: (p159<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p122)
states: 54,974,670 (7)
abstracting: (p122<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p158)
states: 90,607,068 (7)
abstracting: (p158<=1)
states: 2,290,447,549 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.234sec

checking: AG [[[[p62<=0 & 0<=p62] | EX [[~ [[p99<=1 & 1<=p99]] | ~ [[p191<=1 & 1<=p191]]]]] | [[[p111<=1 & 1<=p111] & [p144<=1 & 1<=p144]] | [EF [[p9<=1 & 1<=p9]] & [[p109<=1 & 1<=p109] | [[p70<=1 & 1<=p70] & [p144<=1 & 1<=p144]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p144<=1 & 1<=p144] & [p70<=1 & 1<=p70]] | [p109<=1 & 1<=p109]] & E [true U [p9<=1 & 1<=p9]]] | [[p144<=1 & 1<=p144] & [p111<=1 & 1<=p111]]] | [EX [[~ [[p191<=1 & 1<=p191]] | ~ [[p99<=1 & 1<=p99]]]] | [p62<=0 & 0<=p62]]]]]]

abstracting: (0<=p62)
states: 2,290,447,549 (9)
abstracting: (p62<=0)
states: 2,230,595,137 (9)
abstracting: (1<=p99)
states: 54,177,936 (7)
abstracting: (p99<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p111)
states: 54,229,812 (7)
abstracting: (p111<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p9)
states: 57,703,797 (7)
abstracting: (p9<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p109)
states: 54,229,812 (7)
abstracting: (p109<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p70)
states: 59,908,104 (7)
abstracting: (p70<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.719sec

checking: AG [E [[[~ [AX [[[p71<=1 & 1<=p71] & [p166<=1 & 1<=p166]]]] & EG [[p56<=1 & 1<=p56]]] & [[p16<=1 & 1<=p16] & [AF [[p69<=1 & 1<=p69]] | [[p80<=1 & 1<=p80] & [p143<=1 & 1<=p143]]]]] U [~ [[[p40<=1 & 1<=p40] & [[p73<=1 & 1<=p73] & ~ [[p136<=1 & 1<=p136]]]]] | [[p31<=1 & 1<=p31] & [p122<=1 & 1<=p122]]]]]
normalized: ~ [E [true U ~ [E [[[[[[p143<=1 & 1<=p143] & [p80<=1 & 1<=p80]] | ~ [EG [~ [[p69<=1 & 1<=p69]]]]] & [p16<=1 & 1<=p16]] & [EG [[p56<=1 & 1<=p56]] & EX [~ [[[p166<=1 & 1<=p166] & [p71<=1 & 1<=p71]]]]]] U [[[p122<=1 & 1<=p122] & [p31<=1 & 1<=p31]] | ~ [[[~ [[p136<=1 & 1<=p136]] & [p73<=1 & 1<=p73]] & [p40<=1 & 1<=p40]]]]]]]]

abstracting: (1<=p40)
states: 56,923,767 (7)
abstracting: (p40<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p73)
states: 59,908,104 (7)
abstracting: (p73<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p136)
states: 104,950,260 (8)
abstracting: (p136<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p31)
states: 56,798,973 (7)
abstracting: (p31<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p122)
states: 54,974,670 (7)
abstracting: (p122<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p71)
states: 59,908,104 (7)
abstracting: (p71<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p166)
states: 90,653,220 (7)
abstracting: (p166<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p56)
states: 60,752,232 (7)
abstracting: (p56<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p16)
states: 57,703,797 (7)
abstracting: (p16<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p69)
states: 59,908,104 (7)
abstracting: (p69<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p80)
states: 60,752,232 (7)
abstracting: (p80<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p143)
states: 104,950,260 (8)
abstracting: (p143<=1)
states: 2,290,447,549 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.822sec

checking: A [[[p20<=1 & 1<=p20] & [p144<=1 & 1<=p144]] U [[p172<=1 & 1<=p172] | [[EG [EF [[p103<=1 & 1<=p103]]] & [[p162<=1 & 1<=p162] | ~ [[[[p66<=1 & 1<=p66] & [p144<=1 & 1<=p144]] | [p28<=1 & 1<=p28]]]]] | [[EX [~ [[[p87<=1 & 1<=p87] & [p144<=1 & 1<=p144]]]] & [p162<=1 & 1<=p162]] & [[p42<=1 & 1<=p42] & [p176<=1 & 1<=p176]]]]]]
normalized: [~ [EG [~ [[[[EG [E [true U [p103<=1 & 1<=p103]]] & [~ [[[p28<=1 & 1<=p28] | [[p144<=1 & 1<=p144] & [p66<=1 & 1<=p66]]]] | [p162<=1 & 1<=p162]]] | [[[p176<=1 & 1<=p176] & [p42<=1 & 1<=p42]] & [[p162<=1 & 1<=p162] & EX [~ [[[p144<=1 & 1<=p144] & [p87<=1 & 1<=p87]]]]]]] | [p172<=1 & 1<=p172]]]]] & ~ [E [~ [[[[EG [E [true U [p103<=1 & 1<=p103]]] & [~ [[[p28<=1 & 1<=p28] | [[p144<=1 & 1<=p144] & [p66<=1 & 1<=p66]]]] | [p162<=1 & 1<=p162]]] | [[[p176<=1 & 1<=p176] & [p42<=1 & 1<=p42]] & [[p162<=1 & 1<=p162] & EX [~ [[[p144<=1 & 1<=p144] & [p87<=1 & 1<=p87]]]]]]] | [p172<=1 & 1<=p172]]] U [~ [[[[EG [E [true U [p103<=1 & 1<=p103]]] & [~ [[[p28<=1 & 1<=p28] | [[p144<=1 & 1<=p144] & [p66<=1 & 1<=p66]]]] | [p162<=1 & 1<=p162]]] | [[[p176<=1 & 1<=p176] & [p42<=1 & 1<=p42]] & [[p162<=1 & 1<=p162] & EX [~ [[[p144<=1 & 1<=p144] & [p87<=1 & 1<=p87]]]]]]] | [p172<=1 & 1<=p172]]] & ~ [[[p144<=1 & 1<=p144] & [p20<=1 & 1<=p20]]]]]]]

abstracting: (1<=p20)
states: 56,980,602 (7)
abstracting: (p20<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p172)
states: 104,873,328 (8)
abstracting: (p172<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p87)
states: 54,974,670 (7)
abstracting: (p87<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p162)
states: 92,382,156 (7)
abstracting: (p162<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p42)
states: 57,703,797 (7)
abstracting: (p42<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p176)
states: 102,791,040 (8)
abstracting: (p176<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p162)
states: 92,382,156 (7)
abstracting: (p162<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p66)
states: 59,852,412 (7)
abstracting: (p66<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p28)
states: 56,798,973 (7)
abstracting: (p28<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p103)
states: 54,177,936 (7)
abstracting: (p103<=1)
states: 2,290,447,549 (9)

EG iterations: 0
abstracting: (1<=p172)
states: 104,873,328 (8)
abstracting: (p172<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p87)
states: 54,974,670 (7)
abstracting: (p87<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p162)
states: 92,382,156 (7)
abstracting: (p162<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p42)
states: 57,703,797 (7)
abstracting: (p42<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p176)
states: 102,791,040 (8)
abstracting: (p176<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p162)
states: 92,382,156 (7)
abstracting: (p162<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p66)
states: 59,852,412 (7)
abstracting: (p66<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p28)
states: 56,798,973 (7)
abstracting: (p28<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p103)
states: 54,177,936 (7)
abstracting: (p103<=1)
states: 2,290,447,549 (9)

EG iterations: 0
abstracting: (1<=p172)
states: 104,873,328 (8)
abstracting: (p172<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p87)
states: 54,974,670 (7)
abstracting: (p87<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p162)
states: 92,382,156 (7)
abstracting: (p162<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p42)
states: 57,703,797 (7)
abstracting: (p42<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p176)
states: 102,791,040 (8)
abstracting: (p176<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p162)
states: 92,382,156 (7)
abstracting: (p162<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p66)
states: 59,852,412 (7)
abstracting: (p66<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p28)
states: 56,798,973 (7)
abstracting: (p28<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p103)
states: 54,177,936 (7)
abstracting: (p103<=1)
states: 2,290,447,549 (9)

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.145sec

checking: EX [~ [A [[[~ [A [[p138<=1 & 1<=p138] U [[p1<=1 & 1<=p1] & [p185<=1 & 1<=p185]]]] | EX [[p135<=1 & 1<=p135]]] | [A [[[p118<=1 & 1<=p118] & [p169<=1 & 1<=p169]] U [p154<=1 & 1<=p154]] | [[p80<=1 & 1<=p80] & [p187<=1 & 1<=p187]]]] U EX [[EF [[[p112<=1 & 1<=p112] & [p157<=1 & 1<=p157]]] | [[p15<=1 & 1<=p15] & [p191<=1 & 1<=p191]]]]]]]
normalized: EX [~ [[~ [EG [~ [EX [[[[p191<=1 & 1<=p191] & [p15<=1 & 1<=p15]] | E [true U [[p157<=1 & 1<=p157] & [p112<=1 & 1<=p112]]]]]]]] & ~ [E [~ [EX [[[[p191<=1 & 1<=p191] & [p15<=1 & 1<=p15]] | E [true U [[p157<=1 & 1<=p157] & [p112<=1 & 1<=p112]]]]]] U [~ [[[[[p187<=1 & 1<=p187] & [p80<=1 & 1<=p80]] | [~ [EG [~ [[p154<=1 & 1<=p154]]]] & ~ [E [~ [[p154<=1 & 1<=p154]] U [~ [[[p169<=1 & 1<=p169] & [p118<=1 & 1<=p118]]] & ~ [[p154<=1 & 1<=p154]]]]]]] | [EX [[p135<=1 & 1<=p135]] | ~ [[~ [EG [~ [[[p185<=1 & 1<=p185] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[p185<=1 & 1<=p185] & [p1<=1 & 1<=p1]]] U [~ [[p138<=1 & 1<=p138]] & ~ [[[p185<=1 & 1<=p185] & [p1<=1 & 1<=p1]]]]]]]]]]] & ~ [EX [[[[p191<=1 & 1<=p191] & [p15<=1 & 1<=p15]] | E [true U [[p157<=1 & 1<=p157] & [p112<=1 & 1<=p112]]]]]]]]]]]]

abstracting: (1<=p112)
states: 54,229,812 (7)
abstracting: (p112<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p157)
states: 90,607,068 (7)
abstracting: (p157<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p15)
states: 57,703,797 (7)
abstracting: (p15<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p1)
states: 763,482,516 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p185)
states: 104,873,328 (8)
abstracting: (p185<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p138)
states: 104,950,260 (8)
abstracting: (p138<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p1)
states: 763,482,516 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p185)
states: 104,873,328 (8)
abstracting: (p185<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p1)
states: 763,482,516 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p185)
states: 104,873,328 (8)
abstracting: (p185<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p135)
states: 102,909,972 (8)
abstracting: (p135<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p154)
states: 90,685,404 (7)
abstracting: (p154<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p118)
states: 54,095,262 (7)
abstracting: (p118<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p154)
states: 90,685,404 (7)
abstracting: (p154<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p154)
states: 90,685,404 (7)
abstracting: (p154<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p80)
states: 60,752,232 (7)
abstracting: (p80<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p187)
states: 103,122,852 (8)
abstracting: (p187<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p112)
states: 54,229,812 (7)
abstracting: (p112<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p157)
states: 90,607,068 (7)
abstracting: (p157<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p15)
states: 57,703,797 (7)
abstracting: (p15<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p112)
states: 54,229,812 (7)
abstracting: (p112<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p157)
states: 90,607,068 (7)
abstracting: (p157<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p15)
states: 57,703,797 (7)
abstracting: (p15<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.478sec

checking: AG [~ [A [[[EX [[[p31<=1 & 1<=p31] & [p169<=1 & 1<=p169]]] | [[p131<=1 & 1<=p131] & [p51<=1 & 1<=p51]]] & [[p34<=1 & 1<=p34] & [p169<=1 & 1<=p169]]] U [[AX [[[p76<=1 & 1<=p76] & [p144<=1 & 1<=p144]]] & EX [[[p45<=1 & 1<=p45] & [p169<=1 & 1<=p169]]]] | [AF [[[p47<=1 & 1<=p47] & [p191<=1 & 1<=p191]]] & [p20<=1 & 1<=p20]]]]]]
normalized: ~ [E [true U [~ [EG [~ [[[[p20<=1 & 1<=p20] & ~ [EG [~ [[[p191<=1 & 1<=p191] & [p47<=1 & 1<=p47]]]]]] | [EX [[[p169<=1 & 1<=p169] & [p45<=1 & 1<=p45]]] & ~ [EX [~ [[[p144<=1 & 1<=p144] & [p76<=1 & 1<=p76]]]]]]]]]] & ~ [E [~ [[[[p20<=1 & 1<=p20] & ~ [EG [~ [[[p191<=1 & 1<=p191] & [p47<=1 & 1<=p47]]]]]] | [EX [[[p169<=1 & 1<=p169] & [p45<=1 & 1<=p45]]] & ~ [EX [~ [[[p144<=1 & 1<=p144] & [p76<=1 & 1<=p76]]]]]]]] U [~ [[[[p169<=1 & 1<=p169] & [p34<=1 & 1<=p34]] & [[[p51<=1 & 1<=p51] & [p131<=1 & 1<=p131]] | EX [[[p169<=1 & 1<=p169] & [p31<=1 & 1<=p31]]]]]] & ~ [[[[p20<=1 & 1<=p20] & ~ [EG [~ [[[p191<=1 & 1<=p191] & [p47<=1 & 1<=p47]]]]]] | [EX [[[p169<=1 & 1<=p169] & [p45<=1 & 1<=p45]]] & ~ [EX [~ [[[p144<=1 & 1<=p144] & [p76<=1 & 1<=p76]]]]]]]]]]]]]]

abstracting: (1<=p76)
states: 59,763,960 (7)
abstracting: (p76<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p45)
states: 60,752,232 (7)
abstracting: (p45<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p47)
states: 60,752,232 (7)
abstracting: (p47<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p20)
states: 56,980,602 (7)
abstracting: (p20<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p31)
states: 56,798,973 (7)
abstracting: (p31<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p131)
states: 102,827,856 (8)
abstracting: (p131<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p51)
states: 60,752,232 (7)
abstracting: (p51<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p34)
states: 56,798,973 (7)
abstracting: (p34<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p76)
states: 59,763,960 (7)
abstracting: (p76<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p45)
states: 60,752,232 (7)
abstracting: (p45<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p47)
states: 60,752,232 (7)
abstracting: (p47<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p20)
states: 56,980,602 (7)
abstracting: (p20<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p76)
states: 59,763,960 (7)
abstracting: (p76<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p45)
states: 60,752,232 (7)
abstracting: (p45<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p47)
states: 60,752,232 (7)
abstracting: (p47<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p20)
states: 56,980,602 (7)
abstracting: (p20<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.694sec

checking: AX [E [[p149<=1 & 1<=p149] U [[~ [[[[p107<=1 & 1<=p107] & [p144<=1 & 1<=p144]] | [p189<=1 & 1<=p189]]] & ~ [EX [[p23<=1 & 1<=p23]]]] & [[EX [[p58<=1 & 1<=p58]] | [EF [[p25<=1 & 1<=p25]] | [[[p100<=1 & 1<=p100] & [p133<=1 & 1<=p133]] & [[p63<=1 & 1<=p63] & [p169<=1 & 1<=p169]]]]] & [AF [~ [[p51<=1 & 1<=p51]]] | A [~ [[p125<=1 & 1<=p125]] U AX [[[p34<=1 & 1<=p34] & [p144<=1 & 1<=p144]]]]]]]]]
normalized: ~ [EX [~ [E [[p149<=1 & 1<=p149] U [[[[~ [EG [EX [~ [[[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]]]]]] & ~ [E [EX [~ [[[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]]]] U [[p125<=1 & 1<=p125] & EX [~ [[[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]]]]]]]] | ~ [EG [[p51<=1 & 1<=p51]]]] & [[[[[p169<=1 & 1<=p169] & [p63<=1 & 1<=p63]] & [[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]]] | E [true U [p25<=1 & 1<=p25]]] | EX [[p58<=1 & 1<=p58]]]] & [~ [EX [[p23<=1 & 1<=p23]]] & ~ [[[p189<=1 & 1<=p189] | [[p144<=1 & 1<=p144] & [p107<=1 & 1<=p107]]]]]]]]]]

abstracting: (1<=p107)
states: 54,229,812 (7)
abstracting: (p107<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p189)
states: 103,122,852 (8)
abstracting: (p189<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p23)
states: 56,980,602 (7)
abstracting: (p23<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p58)
states: 60,752,232 (7)
abstracting: (p58<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p25)
states: 56,980,602 (7)
abstracting: (p25<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p100)
states: 54,177,936 (7)
abstracting: (p100<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p133)
states: 102,909,972 (8)
abstracting: (p133<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p63)
states: 59,852,412 (7)
abstracting: (p63<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p51)
states: 60,752,232 (7)
abstracting: (p51<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p34)
states: 56,798,973 (7)
abstracting: (p34<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p125)
states: 104,950,260 (8)
abstracting: (p125<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p34)
states: 56,798,973 (7)
abstracting: (p34<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p34)
states: 56,798,973 (7)
abstracting: (p34<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.
EG iterations: 0
abstracting: (1<=p149)
states: 92,382,156 (7)
abstracting: (p149<=1)
states: 2,290,447,549 (9)
.-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.150sec

checking: [AG [[[[[[[EG [[1<=p50 & p50<=1]] | EG [[[1<=p172 & p172<=1] & [1<=p1 & p1<=1]]]] | AF [[p127<=1 & 1<=p127]]] & [[p56<=0 & 0<=p56] | [p169<=0 & 0<=p169]]] & [[p43<=0 & 0<=p43] & [p128<=0 & 0<=p128]]] | AX [[[p88<=1 & 1<=p88] & [p43<=1 & 1<=p43]]]] | [AF [[[1<=p88 & p88<=1] | [0<=p48 & p48<=0]]] | EX [EX [[p33<=1 & 1<=p33]]]]]] | EF [AX [[[AX [[p127<=1 & 1<=p127]] | E [[[p27<=1 & 1<=p27] & [p191<=1 & 1<=p191]] U [p96<=1 & 1<=p96]]] & [[p85<=1 & 1<=p85] & [p144<=1 & 1<=p144]]]]]]
normalized: [E [true U ~ [EX [~ [[[[p144<=1 & 1<=p144] & [p85<=1 & 1<=p85]] & [E [[[p191<=1 & 1<=p191] & [p27<=1 & 1<=p27]] U [p96<=1 & 1<=p96]] | ~ [EX [~ [[p127<=1 & 1<=p127]]]]]]]]]] | ~ [E [true U ~ [[[EX [EX [[p33<=1 & 1<=p33]]] | ~ [EG [~ [[[0<=p48 & p48<=0] | [1<=p88 & p88<=1]]]]]] | [~ [EX [~ [[[p43<=1 & 1<=p43] & [p88<=1 & 1<=p88]]]]] | [[[p128<=0 & 0<=p128] & [p43<=0 & 0<=p43]] & [[[p169<=0 & 0<=p169] | [p56<=0 & 0<=p56]] & [~ [EG [~ [[p127<=1 & 1<=p127]]]] | [EG [[[1<=p1 & p1<=1] & [1<=p172 & p172<=1]]] | EG [[1<=p50 & p50<=1]]]]]]]]]]]]

abstracting: (p50<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p50)
states: 60,752,232 (7)
.
EG iterations: 1
abstracting: (p172<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p172)
states: 104,873,328 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p1)
states: 763,482,516 (8)
.
EG iterations: 1
abstracting: (1<=p127)
states: 104,950,260 (8)
abstracting: (p127<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (0<=p56)
states: 2,290,447,549 (9)
abstracting: (p56<=0)
states: 2,229,695,317 (9)
abstracting: (0<=p169)
states: 2,290,447,549 (9)
abstracting: (p169<=0)
states: 2,198,065,393 (9)
abstracting: (0<=p43)
states: 2,290,447,549 (9)
abstracting: (p43<=0)
states: 2,232,743,752 (9)
abstracting: (0<=p128)
states: 2,290,447,549 (9)
abstracting: (p128<=0)
states: 2,185,497,289 (9)
abstracting: (1<=p88)
states: 54,974,670 (7)
abstracting: (p88<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p43)
states: 57,703,797 (7)
abstracting: (p43<=1)
states: 2,290,447,549 (9)
.abstracting: (p88<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p88)
states: 54,974,670 (7)
abstracting: (p48<=0)
states: 2,229,695,317 (9)
abstracting: (0<=p48)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p33)
states: 56,798,973 (7)
abstracting: (p33<=1)
states: 2,290,447,549 (9)
..abstracting: (1<=p127)
states: 104,950,260 (8)
abstracting: (p127<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p96)
states: 54,974,670 (7)
abstracting: (p96<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p27)
states: 56,980,602 (7)
abstracting: (p27<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p85)
states: 54,974,670 (7)
abstracting: (p85<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
.-> the formula is FALSE

FORMULA UtahNoC-PT-none-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.096sec

checking: [AG [[[[[AG [[[[1<=p144 & p144<=1] & [p45<=1 & 1<=p45]] | [p122<=1 & 1<=p122]]] | [[[[p32<=1 & 1<=p32] & [p144<=1 & 1<=p144]] | [p65<=1 & 1<=p65]] & [[p143<=1 & 1<=p143] | [[p9<=1 & 1<=p9] & [p169<=1 & 1<=p169]]]]] | [E [[A [[[p1<=1 & 1<=p1] & [p182<=1 & 1<=p182]] U [p138<=1 & 1<=p138]] & [[p127<=1 & 1<=p127] | [p91<=1 & 1<=p91]]] U [AX [[[p4<=1 & 1<=p4] & [p104<=1 & 1<=p104]]] | [[p42<=1 & 1<=p42] | [p39<=1 & 1<=p39]]]] | EG [[[p68<=1 & 1<=p68] & [p165<=1 & 1<=p165]]]]] & [AF [[[[p1<=1 & 1<=p1] & [p185<=1 & 1<=p185]] | [p111<=1 & 1<=p111]]] | [p151<=1 & 1<=p151]]] & [p150<=1 & 1<=p150]]] | EG [[EX [EF [[[[p5<=1 & 1<=p5] & [p169<=1 & 1<=p169]] | [[p26<=1 & 1<=p26] & [p191<=1 & 1<=p191]]]]] | [[[[p32<=1 & 1<=p32] & [[p191<=1 & 1<=p191] & [p86<=1 & 1<=p86]]] | [[p8<=1 & 1<=p8] | [p78<=1 & 1<=p78]]] & AX [EF [[[p25<=0 & 0<=p25] | [p132<=0 & 0<=p132]]]]]]]]
normalized: [EG [[[~ [EX [~ [E [true U [[p132<=0 & 0<=p132] | [p25<=0 & 0<=p25]]]]]] & [[[p78<=1 & 1<=p78] | [p8<=1 & 1<=p8]] | [[[p86<=1 & 1<=p86] & [p191<=1 & 1<=p191]] & [p32<=1 & 1<=p32]]]] | EX [E [true U [[[p191<=1 & 1<=p191] & [p26<=1 & 1<=p26]] | [[p169<=1 & 1<=p169] & [p5<=1 & 1<=p5]]]]]]] | ~ [E [true U ~ [[[p150<=1 & 1<=p150] & [[[p151<=1 & 1<=p151] | ~ [EG [~ [[[p111<=1 & 1<=p111] | [[p185<=1 & 1<=p185] & [p1<=1 & 1<=p1]]]]]]] & [[EG [[[p165<=1 & 1<=p165] & [p68<=1 & 1<=p68]]] | E [[[[p91<=1 & 1<=p91] | [p127<=1 & 1<=p127]] & [~ [EG [~ [[p138<=1 & 1<=p138]]]] & ~ [E [~ [[p138<=1 & 1<=p138]] U [~ [[[p182<=1 & 1<=p182] & [p1<=1 & 1<=p1]]] & ~ [[p138<=1 & 1<=p138]]]]]]] U [[[p39<=1 & 1<=p39] | [p42<=1 & 1<=p42]] | ~ [EX [~ [[[p104<=1 & 1<=p104] & [p4<=1 & 1<=p4]]]]]]]] | [[[[[p169<=1 & 1<=p169] & [p9<=1 & 1<=p9]] | [p143<=1 & 1<=p143]] & [[p65<=1 & 1<=p65] | [[p144<=1 & 1<=p144] & [p32<=1 & 1<=p32]]]] | ~ [E [true U ~ [[[p122<=1 & 1<=p122] | [[p45<=1 & 1<=p45] & [1<=p144 & p144<=1]]]]]]]]]]]]]]

abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (1<=p45)
states: 60,752,232 (7)
abstracting: (p45<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p122)
states: 54,974,670 (7)
abstracting: (p122<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p32)
states: 56,798,973 (7)
abstracting: (p32<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p144)
states: 104,950,260 (8)
abstracting: (p144<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p65)
states: 59,852,412 (7)
abstracting: (p65<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p143)
states: 104,950,260 (8)
abstracting: (p143<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p9)
states: 57,703,797 (7)
abstracting: (p9<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p4)
states: 2,290,447,548 (9)
abstracting: (p4<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p104)
states: 54,177,936 (7)
abstracting: (p104<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p42)
states: 57,703,797 (7)
abstracting: (p42<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p39)
states: 56,923,767 (7)
abstracting: (p39<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p138)
states: 104,950,260 (8)
abstracting: (p138<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p1)
states: 763,482,516 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p182)
states: 103,117,536 (8)
abstracting: (p182<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p138)
states: 104,950,260 (8)
abstracting: (p138<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p138)
states: 104,950,260 (8)
abstracting: (p138<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p127)
states: 104,950,260 (8)
abstracting: (p127<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p91)
states: 54,974,670 (7)
abstracting: (p91<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p68)
states: 59,908,104 (7)
abstracting: (p68<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p165)
states: 90,653,220 (7)
abstracting: (p165<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p1)
states: 763,482,516 (8)
abstracting: (p1<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p185)
states: 104,873,328 (8)
abstracting: (p185<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p111)
states: 54,229,812 (7)
abstracting: (p111<=1)
states: 2,290,447,549 (9)
.
EG iterations: 1
abstracting: (1<=p151)
states: 92,382,156 (7)
abstracting: (p151<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p150)
states: 92,382,156 (7)
abstracting: (p150<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p5)
states: 57,703,797 (7)
abstracting: (p5<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p169)
states: 92,382,156 (7)
abstracting: (p169<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p26)
states: 56,980,602 (7)
abstracting: (p26<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
.abstracting: (1<=p32)
states: 56,798,973 (7)
abstracting: (p32<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p191)
states: 104,873,328 (8)
abstracting: (p191<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p86)
states: 54,974,670 (7)
abstracting: (p86<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p8)
states: 57,703,797 (7)
abstracting: (p8<=1)
states: 2,290,447,549 (9)
abstracting: (1<=p78)
states: 59,763,960 (7)
abstracting: (p78<=1)
states: 2,290,447,549 (9)
abstracting: (0<=p25)
states: 2,290,447,549 (9)
abstracting: (p25<=0)
states: 2,233,466,947 (9)
abstracting: (0<=p132)
states: 2,290,447,549 (9)
abstracting: (p132<=0)
states: 2,185,497,289 (9)
.
EG iterations: 0
-> the formula is TRUE

FORMULA UtahNoC-PT-none-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.504sec

totally nodes used: 11489417 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 148110186 357489262 505599448
used/not used/entry size/cache size: 66782399 326465 16 1024MB
basic ops cache: hits/miss/sum: 4170552 8877944 13048496
used/not used/entry size/cache size: 8794428 7982788 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: 103885 232127 336012
used/not used/entry size/cache size: 229067 8159541 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 57500030
1 8043818
2 1295449
3 229226
4 35308
5 4469
6 505
7 56
8 3
9 0
>= 10 0

Total processing time: 1m34.003sec


BK_STOP 1679358477676

--------------------
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.002sec

3504 5778 5532 8543 7178 7968 10343 9105 8521 9020 9599 11598 11491
iterations count:1394175 (1878), effective:19241 (25)

initing FirstDep: 0m 0.002sec


iterations count:10950 (14), effective:219 (0)

iterations count:11898 (16), effective:249 (0)

iterations count:39632 (53), effective:971 (1)

iterations count:8996 (12), effective:203 (0)

iterations count:8996 (12), effective:203 (0)

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

iterations count:8996 (12), effective:203 (0)

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

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

iterations count:8742 (11), effective:236 (0)

iterations count:20369 (27), effective:492 (0)

iterations count:31905 (42), effective:765 (1)

iterations count:20369 (27), effective:492 (0)

iterations count:20369 (27), effective:492 (0)

iterations count:25097 (33), effective:566 (0)

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

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

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

iterations count:5786 (7), effective:150 (0)

iterations count:2674 (3), effective:40 (0)

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

iterations count:24099 (32), effective:589 (0)

iterations count:23486 (31), effective:537 (0)

iterations count:23486 (31), effective:537 (0)

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

iterations count:23486 (31), effective:537 (0)

iterations count:17515 (23), effective:363 (0)

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

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

iterations count:17515 (23), effective:363 (0)

iterations count:17515 (23), effective:363 (0)

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

iterations count:20151 (27), effective:493 (0)

iterations count:13594 (18), effective:341 (0)

iterations count:11057 (14), effective:219 (0)

iterations count:1134 (1), effective:8 (0)

iterations count:3961 (5), effective:90 (0)

iterations count:2843 (3), effective:41 (0)

iterations count:5902 (7), effective:151 (0)

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

iterations count:2009 (2), effective:38 (0)

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

iterations count:27117 (36), effective:680 (0)

iterations count:764 (1), effective:1 (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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r490-tall-167912709300946"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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