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.r522-tall-167987247100225.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 EisenbergMcGuire-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 255K Mar 31 16:48 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 EisenbergMcGuire-PT-04-CTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680820392861

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:33:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 22:33:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:33:14] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-04-06 22:33:14] [INFO ] Transformed 196 places.
[2023-04-06 22:33:14] [INFO ] Transformed 448 transitions.
[2023-04-06 22:33:14] [INFO ] Found NUPN structural information;
[2023-04-06 22:33:14] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 188 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 188 transition count 416
Applied a total of 16 rules in 28 ms. Remains 188 /196 variables (removed 8) and now considering 416/448 (removed 32) transitions.
[2023-04-06 22:33:14] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
// Phase 1: matrix 252 rows 188 cols
[2023-04-06 22:33:14] [INFO ] Computed 13 invariants in 26 ms
[2023-04-06 22:33:14] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-04-06 22:33:14] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 22:33:14] [INFO ] Invariant cache hit.
[2023-04-06 22:33:15] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-06 22:33:15] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2023-04-06 22:33:15] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 22:33:15] [INFO ] Invariant cache hit.
[2023-04-06 22:33:15] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 416/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 807 ms. Remains : 188/196 places, 416/448 transitions.
Support contains 77 out of 188 places after structural reductions.
[2023-04-06 22:33:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-06 22:33:15] [INFO ] Flatten gal took : 51 ms
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 22:33:15] [INFO ] Flatten gal took : 28 ms
[2023-04-06 22:33:15] [INFO ] Input system was already deterministic with 416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 50) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-04-06 22:33:16] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 22:33:16] [INFO ] Invariant cache hit.
[2023-04-06 22:33:16] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 22:33:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-04-06 22:33:16] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 5 ms returned sat
[2023-04-06 22:33:17] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :15
[2023-04-06 22:33:17] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-06 22:33:17] [INFO ] After 184ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :2 sat :15
[2023-04-06 22:33:17] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 4 ms to minimize.
[2023-04-06 22:33:17] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-06 22:33:17] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-04-06 22:33:17] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-04-06 22:33:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 374 ms
[2023-04-06 22:33:17] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-04-06 22:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 22:33:17] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 22:33:18] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:33:18] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2023-04-06 22:33:18] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:33:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2023-04-06 22:33:18] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:33:18] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 15 ms to minimize.
[2023-04-06 22:33:18] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:33:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2023-04-06 22:33:18] [INFO ] After 1410ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :14
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-04-06 22:33:18] [INFO ] After 2174ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :14
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 139 ms.
Support contains 20 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 8 place count 184 transition count 370
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 92 place count 142 transition count 370
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 138 transition count 354
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 138 transition count 354
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 122 place count 127 transition count 343
Applied a total of 122 rules in 42 ms. Remains 127 /188 variables (removed 61) and now considering 343/416 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 127/188 places, 343/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Finished probabilistic random walk after 295498 steps, run visited all 14 properties in 696 ms. (steps per millisecond=424 )
Probabilistic random walk after 295498 steps, saw 61241 distinct states, run finished after 696 ms. (steps per millisecond=424 ) properties seen :14
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 18 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 19 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 416 transitions.
Support contains 66 out of 188 places (down from 68) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 13 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 8 place count 184 transition count 362
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 108 place count 134 transition count 362
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 131 transition count 350
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 131 transition count 350
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 136 place count 120 transition count 339
Applied a total of 136 rules in 33 ms. Remains 120 /188 variables (removed 68) and now considering 339/416 (removed 77) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 120/188 places, 339/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 13 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 339 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 185 transition count 404
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 185 transition count 404
Applied a total of 6 rules in 6 ms. Remains 185 /188 variables (removed 3) and now considering 404/416 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 185/188 places, 404/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 5 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 5 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 185 transition count 404
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 185 transition count 404
Applied a total of 6 rules in 5 ms. Remains 185 /188 variables (removed 3) and now considering 404/416 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 185/188 places, 404/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 5 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 416/416 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 3 place count 188 transition count 413
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 185 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 8 place count 184 transition count 361
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 110 place count 133 transition count 361
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 129 transition count 345
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 142 place count 117 transition count 333
Applied a total of 142 rules in 30 ms. Remains 117 /188 variables (removed 71) and now considering 333/416 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 117/188 places, 333/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 333 transitions.
Finished random walk after 206 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=103 )
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 184 transition count 360
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 132 transition count 360
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 128 transition count 344
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 144 place count 116 transition count 332
Applied a total of 144 rules in 20 ms. Remains 116 /188 variables (removed 72) and now considering 332/416 (removed 84) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 116/188 places, 332/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 8 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:20] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:20] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 5 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:21] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 8 place count 184 transition count 363
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 106 place count 135 transition count 363
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 131 transition count 347
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 138 place count 119 transition count 335
Applied a total of 138 rules in 20 ms. Remains 119 /188 variables (removed 69) and now considering 335/416 (removed 81) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 119/188 places, 335/416 transitions.
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:21] [INFO ] Input system was already deterministic with 335 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 4 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:21] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 4 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/188 places, 400/416 transitions.
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:21] [INFO ] Input system was already deterministic with 400 transitions.
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:21] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:21] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-06 22:33:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 416 transitions and 1824 arcs took 2 ms.
Total runtime 6848 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 188 NrTr: 416 NrArc: 1824)

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

net check time: 0m 0.000sec

init dd package: 0m 2.773sec


RS generation: 0m36.414sec


-> reachability set: #nodes 132869 (1.3e+05) #states 1,382,609 (6)



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

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

abstracting: (0<=p130)
states: 1,382,609 (6)
abstracting: (p130<=0)
states: 1,358,110 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.791sec

checking: AX [EX [[p135<=1 & 1<=p135]]]
normalized: ~ [EX [~ [EX [[p135<=1 & 1<=p135]]]]]

abstracting: (1<=p135)
states: 27,058 (4)
abstracting: (p135<=1)
states: 1,382,609 (6)
..-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.259sec

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

abstracting: (1<=p129)
states: 39,020 (4)
abstracting: (p129<=1)
states: 1,382,609 (6)
abstracting: (0<=p73)
states: 1,382,609 (6)
abstracting: (p73<=0)
states: 1,382,134 (6)
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.003sec

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

abstracting: (1<=p26)
states: 51,194 (4)
abstracting: (p26<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (0<=p26)
states: 1,382,609 (6)
abstracting: (p26<=0)
states: 1,331,415 (6)
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.774sec

checking: AX [EG [E [E [~ [[p155<=1 & 1<=p155]] U [p178<=1 & 1<=p178]] U AG [~ [[[p176<=0 & 0<=p176] | [p153<=1 & 1<=p153]]]]]]]
normalized: ~ [EX [~ [EG [E [E [~ [[p155<=1 & 1<=p155]] U [p178<=1 & 1<=p178]] U ~ [E [true U [[p153<=1 & 1<=p153] | [p176<=0 & 0<=p176]]]]]]]]]

abstracting: (0<=p176)
states: 1,382,609 (6)
abstracting: (p176<=0)
states: 1,370,353 (6)
abstracting: (1<=p153)
states: 100
abstracting: (p153<=1)
states: 1,382,609 (6)
abstracting: (1<=p178)
states: 368
abstracting: (p178<=1)
states: 1,382,609 (6)
abstracting: (1<=p155)
states: 1,968 (3)
abstracting: (p155<=1)
states: 1,382,609 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.625sec

checking: [AG [[p87<=0 & 0<=p87]] | [EF [[[p169<=0 & 0<=p169] & EF [~ [A [[p99<=0 & 0<=p99] U [[p148<=0 & 0<=p148] | [p38<=1 & 1<=p38]]]]]]] & AX [EG [EF [[p135<=0 & 0<=p135]]]]]]
normalized: [[~ [EX [~ [EG [E [true U [p135<=0 & 0<=p135]]]]]] & E [true U [E [true U ~ [[~ [EG [~ [[[p38<=1 & 1<=p38] | [p148<=0 & 0<=p148]]]]] & ~ [E [~ [[[p38<=1 & 1<=p38] | [p148<=0 & 0<=p148]]] U [~ [[p99<=0 & 0<=p99]] & ~ [[[p38<=1 & 1<=p38] | [p148<=0 & 0<=p148]]]]]]]]] & [p169<=0 & 0<=p169]]]] | ~ [E [true U ~ [[p87<=0 & 0<=p87]]]]]

abstracting: (0<=p87)
states: 1,382,609 (6)
abstracting: (p87<=0)
states: 1,330,354 (6)
abstracting: (0<=p169)
states: 1,382,609 (6)
abstracting: (p169<=0)
states: 1,382,509 (6)
abstracting: (0<=p148)
states: 1,382,609 (6)
abstracting: (p148<=0)
states: 1,382,509 (6)
abstracting: (1<=p38)
states: 45,750 (4)
abstracting: (p38<=1)
states: 1,382,609 (6)
abstracting: (0<=p99)
states: 1,382,609 (6)
abstracting: (p99<=0)
states: 1,334,210 (6)
abstracting: (0<=p148)
states: 1,382,609 (6)
abstracting: (p148<=0)
states: 1,382,509 (6)
abstracting: (1<=p38)
states: 45,750 (4)
abstracting: (p38<=1)
states: 1,382,609 (6)
abstracting: (0<=p148)
states: 1,382,609 (6)
abstracting: (p148<=0)
states: 1,382,509 (6)
abstracting: (1<=p38)
states: 45,750 (4)
abstracting: (p38<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (0<=p135)
states: 1,382,609 (6)
abstracting: (p135<=0)
states: 1,355,551 (6)

EG iterations: 0
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.592sec

checking: AG [A [[[p14<=0 & 0<=p14] | [p35<=1 & 1<=p35]] U AG [[[EG [[p110<=1 & 1<=p110]] | [p187<=1 & 1<=p187]] | [[p132<=0 & 0<=p132] | [p172<=1 & 1<=p172]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [E [true U ~ [[[[p172<=1 & 1<=p172] | [p132<=0 & 0<=p132]] | [[p187<=1 & 1<=p187] | EG [[p110<=1 & 1<=p110]]]]]]]] & ~ [E [E [true U ~ [[[[p172<=1 & 1<=p172] | [p132<=0 & 0<=p132]] | [[p187<=1 & 1<=p187] | EG [[p110<=1 & 1<=p110]]]]]] U [~ [[[p14<=0 & 0<=p14] | [p35<=1 & 1<=p35]]] & E [true U ~ [[[[p172<=1 & 1<=p172] | [p132<=0 & 0<=p132]] | [[p187<=1 & 1<=p187] | EG [[p110<=1 & 1<=p110]]]]]]]]]]]]]

abstracting: (1<=p110)
states: 23,364 (4)
abstracting: (p110<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (1<=p187)
states: 12,822 (4)
abstracting: (p187<=1)
states: 1,382,609 (6)
abstracting: (0<=p132)
states: 1,382,609 (6)
abstracting: (p132<=0)
states: 1,336,684 (6)
abstracting: (1<=p172)
states: 2,200 (3)
abstracting: (p172<=1)
states: 1,382,609 (6)
abstracting: (1<=p35)
states: 38,804 (4)
abstracting: (p35<=1)
states: 1,382,609 (6)
abstracting: (0<=p14)
states: 1,382,609 (6)
abstracting: (p14<=0)
states: 780,526 (5)
abstracting: (1<=p110)
states: 23,364 (4)
abstracting: (p110<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (1<=p187)
states: 12,822 (4)
abstracting: (p187<=1)
states: 1,382,609 (6)
abstracting: (0<=p132)
states: 1,382,609 (6)
abstracting: (p132<=0)
states: 1,336,684 (6)
abstracting: (1<=p172)
states: 2,200 (3)
abstracting: (p172<=1)
states: 1,382,609 (6)
abstracting: (1<=p110)
states: 23,364 (4)
abstracting: (p110<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (1<=p187)
states: 12,822 (4)
abstracting: (p187<=1)
states: 1,382,609 (6)
abstracting: (0<=p132)
states: 1,382,609 (6)
abstracting: (p132<=0)
states: 1,336,684 (6)
abstracting: (1<=p172)
states: 2,200 (3)
abstracting: (p172<=1)
states: 1,382,609 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.164sec

checking: AX [[[AF [~ [E [[p119<=1 & 1<=p119] U [p185<=0 & 0<=p185]]]] | EF [AX [A [[[p158<=0 & 0<=p158] | [p185<=1 & 1<=p185]] U [p64<=1 & 1<=p64]]]]] & [[p140<=0 & 0<=p140] | [p88<=1 & 1<=p88]]]]
normalized: ~ [EX [~ [[[E [true U ~ [EX [~ [[~ [EG [~ [[p64<=1 & 1<=p64]]]] & ~ [E [~ [[p64<=1 & 1<=p64]] U [~ [[p64<=1 & 1<=p64]] & ~ [[[p185<=1 & 1<=p185] | [p158<=0 & 0<=p158]]]]]]]]]]] | ~ [EG [E [[p119<=1 & 1<=p119] U [p185<=0 & 0<=p185]]]]] & [[p88<=1 & 1<=p88] | [p140<=0 & 0<=p140]]]]]]

abstracting: (0<=p140)
states: 1,382,609 (6)
abstracting: (p140<=0)
states: 1,372,974 (6)
abstracting: (1<=p88)
states: 68,463 (4)
abstracting: (p88<=1)
states: 1,382,609 (6)
abstracting: (0<=p185)
states: 1,382,609 (6)
abstracting: (p185<=0)
states: 1,375,201 (6)
abstracting: (1<=p119)
states: 27,058 (4)
abstracting: (p119<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (0<=p158)
states: 1,382,609 (6)
abstracting: (p158<=0)
states: 1,382,529 (6)
abstracting: (1<=p185)
states: 7,408 (3)
abstracting: (p185<=1)
states: 1,382,609 (6)
abstracting: (1<=p64)
states: 25,231 (4)
abstracting: (p64<=1)
states: 1,382,609 (6)
abstracting: (1<=p64)
states: 25,231 (4)
abstracting: (p64<=1)
states: 1,382,609 (6)
abstracting: (1<=p64)
states: 25,231 (4)
abstracting: (p64<=1)
states: 1,382,609 (6)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.585sec

checking: EG [[AX [[[p140<=0 & 0<=p140] | [p9<=1 & 1<=p9]]] & [[[p97<=0 & 0<=p97] | [p41<=1 & 1<=p41]] | [[p84<=1 & 1<=p84] | [[p137<=1 & 1<=p137] & [[p53<=0 & 0<=p53] | [p64<=1 & 1<=p64]]]]]]]
normalized: EG [[[[[[[p64<=1 & 1<=p64] | [p53<=0 & 0<=p53]] & [p137<=1 & 1<=p137]] | [p84<=1 & 1<=p84]] | [[p41<=1 & 1<=p41] | [p97<=0 & 0<=p97]]] & ~ [EX [~ [[[p9<=1 & 1<=p9] | [p140<=0 & 0<=p140]]]]]]]

abstracting: (0<=p140)
states: 1,382,609 (6)
abstracting: (p140<=0)
states: 1,372,974 (6)
abstracting: (1<=p9)
states: 667,620 (5)
abstracting: (p9<=1)
states: 1,382,609 (6)
.abstracting: (0<=p97)
states: 1,382,609 (6)
abstracting: (p97<=0)
states: 1,363,499 (6)
abstracting: (1<=p41)
states: 51,194 (4)
abstracting: (p41<=1)
states: 1,382,609 (6)
abstracting: (1<=p84)
states: 68,463 (4)
abstracting: (p84<=1)
states: 1,382,609 (6)
abstracting: (1<=p137)
states: 37,524 (4)
abstracting: (p137<=1)
states: 1,382,609 (6)
abstracting: (0<=p53)
states: 1,382,609 (6)
abstracting: (p53<=0)
states: 1,333,714 (6)
abstracting: (1<=p64)
states: 25,231 (4)
abstracting: (p64<=1)
states: 1,382,609 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.984sec

checking: AG [[EG [A [AX [[[p75<=0 & 0<=p75] | [p71<=1 & 1<=p71]]] U AF [[[p44<=0 & 0<=p44] | [p50<=1 & 1<=p50]]]]] & E [[p133<=0 & 0<=p133] U [~ [[[p40<=0 & 0<=p40] | [p186<=1 & 1<=p186]]] | [AX [[p117<=1 & 1<=p117]] | ~ [AX [[p0<=1 & 1<=p0]]]]]]]]
normalized: ~ [E [true U ~ [[E [[p133<=0 & 0<=p133] U [[EX [~ [[p0<=1 & 1<=p0]]] | ~ [EX [~ [[p117<=1 & 1<=p117]]]]] | ~ [[[p186<=1 & 1<=p186] | [p40<=0 & 0<=p40]]]]] & EG [[~ [EG [EG [~ [[[p50<=1 & 1<=p50] | [p44<=0 & 0<=p44]]]]]] & ~ [E [EG [~ [[[p50<=1 & 1<=p50] | [p44<=0 & 0<=p44]]]] U [EX [~ [[[p71<=1 & 1<=p71] | [p75<=0 & 0<=p75]]]] & EG [~ [[[p50<=1 & 1<=p50] | [p44<=0 & 0<=p44]]]]]]]]]]]]]

abstracting: (0<=p44)
states: 1,382,609 (6)
abstracting: (p44<=0)
states: 1,342,604 (6)
abstracting: (1<=p50)
states: 40,500 (4)
abstracting: (p50<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (0<=p75)
states: 1,382,609 (6)
abstracting: (p75<=0)
states: 1,382,529 (6)
abstracting: (1<=p71)
states: 100
abstracting: (p71<=1)
states: 1,382,609 (6)
.abstracting: (0<=p44)
states: 1,382,609 (6)
abstracting: (p44<=0)
states: 1,342,604 (6)
abstracting: (1<=p50)
states: 40,500 (4)
abstracting: (p50<=1)
states: 1,382,609 (6)
.
EG iterations: 1
abstracting: (0<=p44)
states: 1,382,609 (6)
abstracting: (p44<=0)
states: 1,342,604 (6)
abstracting: (1<=p50)
states: 40,500 (4)
abstracting: (p50<=1)
states: 1,382,609 (6)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p40)
states: 1,382,609 (6)
abstracting: (p40<=0)
states: 1,339,811 (6)
abstracting: (1<=p186)
states: 10,448 (4)
abstracting: (p186<=1)
states: 1,382,609 (6)
abstracting: (1<=p117)
states: 37,476 (4)
abstracting: (p117<=1)
states: 1,382,609 (6)
.abstracting: (1<=p0)
states: 338,065 (5)
abstracting: (p0<=1)
states: 1,382,609 (6)
.abstracting: (0<=p133)
states: 1,382,609 (6)
abstracting: (p133<=0)
states: 1,343,820 (6)
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.414sec

checking: AG [[EX [[~ [[p32<=1 & 1<=p32]] | ~ [[p17<=0 & 0<=p17]]]] | [~ [[p40<=0 & 0<=p40]] | [[~ [[p173<=1 & 1<=p173]] | EX [~ [[p172<=0 & 0<=p172]]]] & [[[p80<=0 & 0<=p80] | [p36<=1 & 1<=p36]] & [[p116<=0 & 0<=p116] | [p69<=1 & 1<=p69]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p69<=1 & 1<=p69] | [p116<=0 & 0<=p116]] & [[p36<=1 & 1<=p36] | [p80<=0 & 0<=p80]]] & [EX [~ [[p172<=0 & 0<=p172]]] | ~ [[p173<=1 & 1<=p173]]]] | ~ [[p40<=0 & 0<=p40]]] | EX [[~ [[p17<=0 & 0<=p17]] | ~ [[p32<=1 & 1<=p32]]]]]]]]

abstracting: (1<=p32)
states: 43,691 (4)
abstracting: (p32<=1)
states: 1,382,609 (6)
abstracting: (0<=p17)
states: 1,382,609 (6)
abstracting: (p17<=0)
states: 1,245,602 (6)
.abstracting: (0<=p40)
states: 1,382,609 (6)
abstracting: (p40<=0)
states: 1,339,811 (6)
abstracting: (1<=p173)
states: 420
abstracting: (p173<=1)
states: 1,382,609 (6)
abstracting: (0<=p172)
states: 1,382,609 (6)
abstracting: (p172<=0)
states: 1,380,409 (6)
.abstracting: (0<=p80)
states: 1,382,609 (6)
abstracting: (p80<=0)
states: 1,318,226 (6)
abstracting: (1<=p36)
states: 34,660 (4)
abstracting: (p36<=1)
states: 1,382,609 (6)
abstracting: (0<=p116)
states: 1,382,609 (6)
abstracting: (p116<=0)
states: 1,334,210 (6)
abstracting: (1<=p69)
states: 380
abstracting: (p69<=1)
states: 1,382,609 (6)
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.968sec

checking: EF [[[AG [[[p10<=0 & 0<=p10] & [p163<=1 & 1<=p163]]] & [p129<=0 & 0<=p129]] & [[~ [E [[p67<=1 & 1<=p67] U [p55<=0 & 0<=p55]]] | [[p143<=0 & 0<=p143] & [p19<=1 & 1<=p19]]] & [[p43<=0 & 0<=p43] | [[p1<=0 & 0<=p1] | [p124<=1 & 1<=p124]]]]]]
normalized: E [true U [[[[[p1<=0 & 0<=p1] | [p124<=1 & 1<=p124]] | [p43<=0 & 0<=p43]] & [[[p19<=1 & 1<=p19] & [p143<=0 & 0<=p143]] | ~ [E [[p67<=1 & 1<=p67] U [p55<=0 & 0<=p55]]]]] & [[p129<=0 & 0<=p129] & ~ [E [true U ~ [[[p163<=1 & 1<=p163] & [p10<=0 & 0<=p10]]]]]]]]

abstracting: (0<=p10)
states: 1,382,609 (6)
abstracting: (p10<=0)
states: 1,311,954 (6)
abstracting: (1<=p163)
states: 64
abstracting: (p163<=1)
states: 1,382,609 (6)
abstracting: (0<=p129)
states: 1,382,609 (6)
abstracting: (p129<=0)
states: 1,343,589 (6)
abstracting: (0<=p55)
states: 1,382,609 (6)
abstracting: (p55<=0)
states: 1,342,518 (6)
abstracting: (1<=p67)
states: 39,789 (4)
abstracting: (p67<=1)
states: 1,382,609 (6)
abstracting: (0<=p143)
states: 1,382,609 (6)
abstracting: (p143<=0)
states: 1,353,993 (6)
abstracting: (1<=p19)
states: 118,453 (5)
abstracting: (p19<=1)
states: 1,382,609 (6)
abstracting: (0<=p43)
states: 1,382,609 (6)
abstracting: (p43<=0)
states: 1,330,252 (6)
abstracting: (1<=p124)
states: 56,057 (4)
abstracting: (p124<=1)
states: 1,382,609 (6)
abstracting: (0<=p1)
states: 1,382,609 (6)
abstracting: (p1<=0)
states: 1,042,313 (6)
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.777sec

checking: [~ [A [[p84<=1 & 1<=p84] U ~ [[EF [[[p17<=0 & 0<=p17] | [p3<=1 & 1<=p3]]] & [[[p31<=0 & 0<=p31] | [p91<=1 & 1<=p91]] & [[p90<=0 & 0<=p90] | [[p23<=1 & 1<=p23] | [p110<=0 & 0<=p110]]]]]]]] & [AF [[[p61<=0 & 0<=p61] | AG [[p129<=0 & 0<=p129]]]] & EX [AG [[[p47<=0 & 0<=p47] | [p111<=1 & 1<=p111]]]]]]
normalized: [[EX [~ [E [true U ~ [[[p111<=1 & 1<=p111] | [p47<=0 & 0<=p47]]]]]] & ~ [EG [~ [[~ [E [true U ~ [[p129<=0 & 0<=p129]]]] | [p61<=0 & 0<=p61]]]]]] & ~ [[~ [EG [[[[[[p110<=0 & 0<=p110] | [p23<=1 & 1<=p23]] | [p90<=0 & 0<=p90]] & [[p91<=1 & 1<=p91] | [p31<=0 & 0<=p31]]] & E [true U [[p3<=1 & 1<=p3] | [p17<=0 & 0<=p17]]]]]] & ~ [E [[[[[[p110<=0 & 0<=p110] | [p23<=1 & 1<=p23]] | [p90<=0 & 0<=p90]] & [[p91<=1 & 1<=p91] | [p31<=0 & 0<=p31]]] & E [true U [[p3<=1 & 1<=p3] | [p17<=0 & 0<=p17]]]] U [~ [[p84<=1 & 1<=p84]] & [[[[[p110<=0 & 0<=p110] | [p23<=1 & 1<=p23]] | [p90<=0 & 0<=p90]] & [[p91<=1 & 1<=p91] | [p31<=0 & 0<=p31]]] & E [true U [[p3<=1 & 1<=p3] | [p17<=0 & 0<=p17]]]]]]]]]]

abstracting: (0<=p17)
states: 1,382,609 (6)
abstracting: (p17<=0)
states: 1,245,602 (6)
abstracting: (1<=p3)
states: 356,308 (5)
abstracting: (p3<=1)
states: 1,382,609 (6)
abstracting: (0<=p31)
states: 1,382,609 (6)
abstracting: (p31<=0)
states: 1,335,549 (6)
abstracting: (1<=p91)
states: 23,364 (4)
abstracting: (p91<=1)
states: 1,382,609 (6)
abstracting: (0<=p90)
states: 1,382,609 (6)
abstracting: (p90<=0)
states: 1,340,554 (6)
abstracting: (1<=p23)
states: 70,923 (4)
abstracting: (p23<=1)
states: 1,382,609 (6)
abstracting: (0<=p110)
states: 1,382,609 (6)
abstracting: (p110<=0)
states: 1,359,245 (6)
abstracting: (1<=p84)
states: 68,463 (4)
abstracting: (p84<=1)
states: 1,382,609 (6)
abstracting: (0<=p17)
states: 1,382,609 (6)
abstracting: (p17<=0)
states: 1,245,602 (6)
abstracting: (1<=p3)
states: 356,308 (5)
abstracting: (p3<=1)
states: 1,382,609 (6)
abstracting: (0<=p31)
states: 1,382,609 (6)
abstracting: (p31<=0)
states: 1,335,549 (6)
abstracting: (1<=p91)
states: 23,364 (4)
abstracting: (p91<=1)
states: 1,382,609 (6)
abstracting: (0<=p90)
states: 1,382,609 (6)
abstracting: (p90<=0)
states: 1,340,554 (6)
abstracting: (1<=p23)
states: 70,923 (4)
abstracting: (p23<=1)
states: 1,382,609 (6)
abstracting: (0<=p110)
states: 1,382,609 (6)
abstracting: (p110<=0)
states: 1,359,245 (6)
abstracting: (0<=p17)
states: 1,382,609 (6)
abstracting: (p17<=0)
states: 1,245,602 (6)
abstracting: (1<=p3)
states: 356,308 (5)
abstracting: (p3<=1)
states: 1,382,609 (6)
abstracting: (0<=p31)
states: 1,382,609 (6)
abstracting: (p31<=0)
states: 1,335,549 (6)
abstracting: (1<=p91)
states: 23,364 (4)
abstracting: (p91<=1)
states: 1,382,609 (6)
abstracting: (0<=p90)
states: 1,382,609 (6)
abstracting: (p90<=0)
states: 1,340,554 (6)
abstracting: (1<=p23)
states: 70,923 (4)
abstracting: (p23<=1)
states: 1,382,609 (6)
abstracting: (0<=p110)
states: 1,382,609 (6)
abstracting: (p110<=0)
states: 1,359,245 (6)
.
EG iterations: 1
abstracting: (0<=p61)
states: 1,382,609 (6)
abstracting: (p61<=0)
states: 1,346,652 (6)
abstracting: (0<=p129)
states: 1,382,609 (6)
abstracting: (p129<=0)
states: 1,343,589 (6)

before gc: list nodes free: 366672

after gc: idd nodes used:890156, unused:63109844; list nodes free:281423978
.
EG iterations: 1
abstracting: (0<=p47)
states: 1,382,609 (6)
abstracting: (p47<=0)
states: 1,332,695 (6)
abstracting: (1<=p111)
states: 13,218 (4)
abstracting: (p111<=1)
states: 1,382,609 (6)
.-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.705sec

totally nodes used: 75489127 (7.5e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 195591969 853418303 1049010272
used/not used/entry size/cache size: 56118130 10990734 16 1024MB
basic ops cache: hits/miss/sum: 28714030 87707019 116421049
used/not used/entry size/cache size: 12493283 4283933 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: 156888 999256 1156144
used/not used/entry size/cache size: 153519 8235089 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 56997782
1 8259958
2 1499381
3 295019
4 49153
5 6667
6 788
7 100
8 13
9 3
>= 10 0

Total processing time: 5m21.775sec


BK_STOP 1680820724187

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.001sec

41137 66832 88454 117380 127803 132815
iterations count:638269 (1534), effective:7173 (17)

initing FirstDep: 0m 0.000sec

99389 135420
iterations count:228867 (550), effective:2660 (6)
58275 127253
iterations count:227624 (547), effective:2646 (6)
122664
iterations count:141537 (340), effective:1596 (3)

iterations count:541 (1), effective:1 (0)
51967 127418
iterations count:221768 (533), effective:2599 (6)
122170
iterations count:168086 (404), effective:2058 (4)
31343 127374
iterations count:227159 (546), effective:2648 (6)

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

iterations count:6923 (16), effective:65 (0)
99233 138963
iterations count:212175 (510), effective:2355 (5)
99233 138963
iterations count:212175 (510), effective:2355 (5)

iterations count:41733 (100), effective:498 (1)
99233 138963
iterations count:212175 (510), effective:2355 (5)

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

iterations count:416 (1), effective:0 (0)
76661 123209
iterations count:217898 (523), effective:2540 (6)

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

iterations count:48171 (115), effective:575 (1)
114969
iterations count:149191 (358), effective:1667 (4)

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

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

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

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

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

iterations count:675 (1), effective:2 (0)
94869 137336
iterations count:207460 (498), effective:2317 (5)
126658
iterations count:126252 (303), effective:1428 (3)

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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="CTLCardinality"
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 EisenbergMcGuire-PT-04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247100225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-PT-04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;