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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:21 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 121K 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-03-CTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680820202855

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-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:30:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 22:30:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:30:04] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-04-06 22:30:04] [INFO ] Transformed 117 places.
[2023-04-06 22:30:04] [INFO ] Transformed 216 transitions.
[2023-04-06 22:30:04] [INFO ] Found NUPN structural information;
[2023-04-06 22:30:04] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 213
Applied a total of 2 rules in 20 ms. Remains 116 /117 variables (removed 1) and now considering 213/216 (removed 3) transitions.
[2023-04-06 22:30:04] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
// Phase 1: matrix 150 rows 116 cols
[2023-04-06 22:30:04] [INFO ] Computed 10 invariants in 14 ms
[2023-04-06 22:30:04] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-04-06 22:30:04] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2023-04-06 22:30:04] [INFO ] Invariant cache hit.
[2023-04-06 22:30:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-04-06 22:30:04] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-04-06 22:30:04] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2023-04-06 22:30:04] [INFO ] Invariant cache hit.
[2023-04-06 22:30:05] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 213/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 116/117 places, 213/216 transitions.
Support contains 58 out of 116 places after structural reductions.
[2023-04-06 22:30:05] [INFO ] Flatten gal took : 47 ms
[2023-04-06 22:30:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 22:30:05] [INFO ] Flatten gal took : 16 ms
[2023-04-06 22:30:05] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 53 out of 116 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 45) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-04-06 22:30:06] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2023-04-06 22:30:06] [INFO ] Invariant cache hit.
[2023-04-06 22:30:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 22:30:06] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 22:30:06] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 22:30:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 22:30:06] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 22:30:07] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-04-06 22:30:07] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-04-06 22:30:07] [INFO ] After 60ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 10 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 360 ms
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 1 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2023-04-06 22:30:07] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:30:08] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:30:08] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:30:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 440 ms
[2023-04-06 22:30:08] [INFO ] After 962ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-06 22:30:08] [INFO ] After 1334ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 213/213 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 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 6 place count 113 transition count 183
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 60 place count 86 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 81 transition count 168
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 81 transition count 168
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 75 transition count 162
Applied a total of 82 rules in 41 ms. Remains 75 /116 variables (removed 41) and now considering 162/213 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 75/116 places, 162/213 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-06 22:30:08] [INFO ] Flow matrix only has 99 transitions (discarded 63 similar events)
// Phase 1: matrix 99 rows 75 cols
[2023-04-06 22:30:08] [INFO ] Computed 10 invariants in 2 ms
[2023-04-06 22:30:08] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-04-06 22:30:08] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 22:30:08] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 22:30:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 22:30:08] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 22:30:08] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 22:30:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-04-06 22:30:08] [INFO ] After 32ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 22:30:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:30:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:30:08] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 22:30:09] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2023-04-06 22:30:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 162 ms
[2023-04-06 22:30:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:30:09] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2023-04-06 22:30:09] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-04-06 22:30:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 114 ms
[2023-04-06 22:30:09] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-06 22:30:09] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 162/162 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 75/75 places, 162/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Finished probabilistic random walk after 14658 steps, run visited all 6 properties in 59 ms. (steps per millisecond=248 )
Probabilistic random walk after 14658 steps, saw 3928 distinct states, run finished after 63 ms. (steps per millisecond=232 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:30:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 213 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 113 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 113 transition count 204
Applied a total of 6 rules in 9 ms. Remains 113 /116 variables (removed 3) and now considering 204/213 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 113/116 places, 204/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 22 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 15 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 113 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 113 transition count 204
Applied a total of 6 rules in 5 ms. Remains 113 /116 variables (removed 3) and now considering 204/213 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 113/116 places, 204/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 24 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 5 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 112 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 112 transition count 201
Applied a total of 8 rules in 4 ms. Remains 112 /116 variables (removed 4) and now considering 201/213 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 112/116 places, 201/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 33 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 112 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 112 transition count 201
Applied a total of 8 rules in 4 ms. Remains 112 /116 variables (removed 4) and now considering 201/213 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 112/116 places, 201/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 213/213 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 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 113 transition count 181
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 79 transition count 166
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 73 transition count 160
Applied a total of 86 rules in 15 ms. Remains 73 /116 variables (removed 43) and now considering 160/213 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 73/116 places, 160/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 5 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:09] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 3 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:09] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:10] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 3 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:10] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 213/213 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 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 113 transition count 181
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 80 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 80 transition count 169
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 74 transition count 163
Applied a total of 84 rules in 13 ms. Remains 74 /116 variables (removed 42) and now considering 163/213 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 74/116 places, 163/213 transitions.
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 5 ms
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 5 ms
[2023-04-06 22:30:10] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 3 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:10] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 112 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 112 transition count 201
Applied a total of 8 rules in 2 ms. Remains 112 /116 variables (removed 4) and now considering 201/213 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 112/116 places, 201/213 transitions.
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:10] [INFO ] Input system was already deterministic with 201 transitions.
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:30:10] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-06 22:30:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 213 transitions and 888 arcs took 1 ms.
Total runtime 5904 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: 116 NrTr: 213 NrArc: 888)

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

net check time: 0m 0.000sec

init dd package: 0m 2.760sec


RS generation: 0m 1.328sec


-> reachability set: #nodes 12368 (1.2e+04) #states 30,213 (4)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 30,213 (4)
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.357sec

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

abstracting: (1<=p76)
states: 880
abstracting: (p76<=1)
states: 30,213 (4)
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.223sec

checking: AG [AX [[EF [AG [[p75<=1 & 1<=p75]]] | [p52<=1 & 1<=p52]]]]
normalized: ~ [E [true U EX [~ [[[p52<=1 & 1<=p52] | E [true U ~ [E [true U ~ [[p75<=1 & 1<=p75]]]]]]]]]]

abstracting: (1<=p75)
states: 880
abstracting: (p75<=1)
states: 30,213 (4)
abstracting: (1<=p52)
states: 1,341 (3)
abstracting: (p52<=1)
states: 30,213 (4)
.-> the formula is FALSE

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

MC time: 0m 0.117sec

checking: AG [AX [EF [[[p16<=0 & 0<=p16] & [p115<=1 & 1<=p115]]]]]
normalized: ~ [E [true U EX [~ [E [true U [[p115<=1 & 1<=p115] & [p16<=0 & 0<=p16]]]]]]]

abstracting: (0<=p16)
states: 30,213 (4)
abstracting: (p16<=0)
states: 28,353 (4)
abstracting: (1<=p115)
states: 401
abstracting: (p115<=1)
states: 30,213 (4)
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.735sec

checking: ~ [E [~ [EX [AG [[p13<=0 & 0<=p13]]]] U AX [[p15<=1 & 1<=p15]]]]
normalized: ~ [E [~ [EX [~ [E [true U ~ [[p13<=0 & 0<=p13]]]]]] U ~ [EX [~ [[p15<=1 & 1<=p15]]]]]]

abstracting: (1<=p15)
states: 1,911 (3)
abstracting: (p15<=1)
states: 30,213 (4)
.abstracting: (0<=p13)
states: 30,213 (4)
abstracting: (p13<=0)
states: 27,082 (4)
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.932sec

checking: AF [AG [EF [EG [[[p3<=0 & 0<=p3] | [p72<=1 & 1<=p72]]]]]]
normalized: ~ [EG [E [true U ~ [E [true U EG [[[p3<=0 & 0<=p3] | [p72<=1 & 1<=p72]]]]]]]]

abstracting: (1<=p72)
states: 1,041 (3)
abstracting: (p72<=1)
states: 30,213 (4)
abstracting: (0<=p3)
states: 30,213 (4)
abstracting: (p3<=0)
states: 28,483 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

checking: AG [~ [A [~ [[p47<=0 & 0<=p47]] U [p36<=1 & 1<=p36]]]]
normalized: ~ [E [true U [~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [[p47<=0 & 0<=p47] & ~ [[p36<=1 & 1<=p36]]]]]]]]

abstracting: (1<=p36)
states: 1,033 (3)
abstracting: (p36<=1)
states: 30,213 (4)
abstracting: (0<=p47)
states: 30,213 (4)
abstracting: (p47<=0)
states: 30,123 (4)
abstracting: (1<=p36)
states: 1,033 (3)
abstracting: (p36<=1)
states: 30,213 (4)
abstracting: (1<=p36)
states: 1,033 (3)
abstracting: (p36<=1)
states: 30,213 (4)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.348sec

checking: AG [EF [[EF [[[p18<=0 & 0<=p18] & [p69<=1 & 1<=p69]]] | EG [AX [[p94<=0 & 0<=p94]]]]]]
normalized: ~ [E [true U ~ [E [true U [EG [~ [EX [~ [[p94<=0 & 0<=p94]]]]] | E [true U [[p69<=1 & 1<=p69] & [p18<=0 & 0<=p18]]]]]]]]

abstracting: (0<=p18)
states: 30,213 (4)
abstracting: (p18<=0)
states: 28,784 (4)
abstracting: (1<=p69)
states: 889
abstracting: (p69<=1)
states: 30,213 (4)
abstracting: (0<=p94)
states: 30,213 (4)
abstracting: (p94<=0)
states: 30,138 (4)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.146sec

checking: EF [[[p7<=1 & 1<=p7] & AX [[[[p0<=0 & 0<=p0] | [[p25<=0 & 0<=p25] & [p114<=1 & 1<=p114]]] & AX [[p8<=1 & 1<=p8]]]]]]
normalized: E [true U [~ [EX [~ [[~ [EX [~ [[p8<=1 & 1<=p8]]]] & [[[p114<=1 & 1<=p114] & [p25<=0 & 0<=p25]] | [p0<=0 & 0<=p0]]]]]] & [p7<=1 & 1<=p7]]]

abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (0<=p0)
states: 30,213 (4)
abstracting: (p0<=0)
states: 20,796 (4)
abstracting: (0<=p25)
states: 30,213 (4)
abstracting: (p25<=0)
states: 28,916 (4)
abstracting: (1<=p114)
states: 306
abstracting: (p114<=1)
states: 30,213 (4)
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
..-> the formula is FALSE

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

MC time: 0m 0.169sec

checking: [[AX [~ [E [[[p19<=0 & 0<=p19] | A [[[p30<=0 & 0<=p30] | [p33<=1 & 1<=p33]] U [[p31<=0 & 0<=p31] | [p21<=1 & 1<=p21]]]] U ~ [[p26<=1 & 1<=p26]]]]] | [AX [1<=0] | AG [EF [[p39<=1 & 1<=p39]]]]] & [AF [~ [E [[p48<=1 & 1<=p48] U [[p36<=0 & 0<=p36] | [p64<=1 & 1<=p64]]]]] | AX [[p99<=0 & 0<=p99]]]]
normalized: [[~ [EX [~ [[p99<=0 & 0<=p99]]]] | ~ [EG [E [[p48<=1 & 1<=p48] U [[p64<=1 & 1<=p64] | [p36<=0 & 0<=p36]]]]]] & [[~ [E [true U ~ [E [true U [p39<=1 & 1<=p39]]]]] | ~ [EX [~ [1<=0]]]] | ~ [EX [E [[[~ [EG [~ [[[p21<=1 & 1<=p21] | [p31<=0 & 0<=p31]]]]] & ~ [E [~ [[[p21<=1 & 1<=p21] | [p31<=0 & 0<=p31]]] U [~ [[[p33<=1 & 1<=p33] | [p30<=0 & 0<=p30]]] & ~ [[[p21<=1 & 1<=p21] | [p31<=0 & 0<=p31]]]]]]] | [p19<=0 & 0<=p19]] U ~ [[p26<=1 & 1<=p26]]]]]]]

abstracting: (1<=p26)
states: 1,341 (3)
abstracting: (p26<=1)
states: 30,213 (4)
abstracting: (0<=p19)
states: 30,213 (4)
abstracting: (p19<=0)
states: 29,148 (4)
abstracting: (0<=p31)
states: 30,213 (4)
abstracting: (p31<=0)
states: 29,159 (4)
abstracting: (1<=p21)
states: 1,297 (3)
abstracting: (p21<=1)
states: 30,213 (4)
abstracting: (0<=p30)
states: 30,213 (4)
abstracting: (p30<=0)
states: 29,178 (4)
abstracting: (1<=p33)
states: 1,063 (3)
abstracting: (p33<=1)
states: 30,213 (4)
abstracting: (0<=p31)
states: 30,213 (4)
abstracting: (p31<=0)
states: 29,159 (4)
abstracting: (1<=p21)
states: 1,297 (3)
abstracting: (p21<=1)
states: 30,213 (4)
abstracting: (0<=p31)
states: 30,213 (4)
abstracting: (p31<=0)
states: 29,159 (4)
abstracting: (1<=p21)
states: 1,297 (3)
abstracting: (p21<=1)
states: 30,213 (4)
.
EG iterations: 1
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p39)
states: 1,068 (3)
abstracting: (p39<=1)
states: 30,213 (4)
abstracting: (0<=p36)
states: 30,213 (4)
abstracting: (p36<=0)
states: 29,180 (4)
abstracting: (1<=p64)
states: 1,392 (3)
abstracting: (p64<=1)
states: 30,213 (4)
abstracting: (1<=p48)
states: 100
abstracting: (p48<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (0<=p99)
states: 30,213 (4)
abstracting: (p99<=0)
states: 30,113 (4)
.-> the formula is TRUE

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

MC time: 0m 1.123sec

checking: AX [[[[[AG [[p78<=1 & 1<=p78]] & [p93<=1 & 1<=p93]] & [[p60<=0 & 0<=p60] & [[[p46<=0 & 0<=p46] | [p5<=1 & 1<=p5]] & [[p56<=0 & 0<=p56] | [p4<=1 & 1<=p4]]]]] | [AF [[p86<=0 & 0<=p86]] & [EF [[p101<=1 & 1<=p101]] | [[p46<=0 & 0<=p46] & [p107<=1 & 1<=p107]]]]] | [p71<=1 & 1<=p71]]]
normalized: ~ [EX [~ [[[p71<=1 & 1<=p71] | [[[[[p107<=1 & 1<=p107] & [p46<=0 & 0<=p46]] | E [true U [p101<=1 & 1<=p101]]] & ~ [EG [~ [[p86<=0 & 0<=p86]]]]] | [[[[[p4<=1 & 1<=p4] | [p56<=0 & 0<=p56]] & [[p5<=1 & 1<=p5] | [p46<=0 & 0<=p46]]] & [p60<=0 & 0<=p60]] & [[p93<=1 & 1<=p93] & ~ [E [true U ~ [[p78<=1 & 1<=p78]]]]]]]]]]]

abstracting: (1<=p78)
states: 706
abstracting: (p78<=1)
states: 30,213 (4)
abstracting: (1<=p93)
states: 220
abstracting: (p93<=1)
states: 30,213 (4)
abstracting: (0<=p60)
states: 30,213 (4)
abstracting: (p60<=0)
states: 28,765 (4)
abstracting: (0<=p46)
states: 30,213 (4)
abstracting: (p46<=0)
states: 30,188 (4)
abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (0<=p56)
states: 30,213 (4)
abstracting: (p56<=0)
states: 28,710 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (0<=p86)
states: 30,213 (4)
abstracting: (p86<=0)
states: 29,794 (4)
.
EG iterations: 1
abstracting: (1<=p101)
states: 20
abstracting: (p101<=1)
states: 30,213 (4)
abstracting: (0<=p46)
states: 30,213 (4)
abstracting: (p46<=0)
states: 30,188 (4)
abstracting: (1<=p107)
states: 381
abstracting: (p107<=1)
states: 30,213 (4)
abstracting: (1<=p71)
states: 1,041 (3)
abstracting: (p71<=1)
states: 30,213 (4)
.-> the formula is TRUE

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

MC time: 0m 0.604sec

checking: [[AX [EX [[p9<=0 & 0<=p9]]] & [EF [[p5<=1 & 1<=p5]] | EG [AF [[EX [[[p7<=0 & 0<=p7] | [p69<=1 & 1<=p69]]] | EG [[p56<=0 & 0<=p56]]]]]]] & [[AF [AX [AG [~ [[p19<=0 & 0<=p19]]]]] | AF [AX [[p115<=0 & 0<=p115]]]] & [AG [[[p19<=1 & 1<=p19] | EG [[p47<=0 & 0<=p47]]]] | AF [[AX [[[p36<=0 & 0<=p36] & [p33<=1 & 1<=p33]]] & AG [[p74<=0 & 0<=p74]]]]]]]
normalized: [[[~ [EG [~ [[~ [E [true U ~ [[p74<=0 & 0<=p74]]]] & ~ [EX [~ [[[p33<=1 & 1<=p33] & [p36<=0 & 0<=p36]]]]]]]]] | ~ [E [true U ~ [[EG [[p47<=0 & 0<=p47]] | [p19<=1 & 1<=p19]]]]]] & [~ [EG [EX [~ [[p115<=0 & 0<=p115]]]]] | ~ [EG [EX [E [true U [p19<=0 & 0<=p19]]]]]]] & [[EG [~ [EG [~ [[EG [[p56<=0 & 0<=p56]] | EX [[[p69<=1 & 1<=p69] | [p7<=0 & 0<=p7]]]]]]]] | E [true U [p5<=1 & 1<=p5]]] & ~ [EX [~ [EX [[p9<=0 & 0<=p9]]]]]]]

abstracting: (0<=p9)
states: 30,213 (4)
abstracting: (p9<=0)
states: 28,506 (4)
..abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (0<=p7)
states: 30,213 (4)
abstracting: (p7<=0)
states: 16,856 (4)
abstracting: (1<=p69)
states: 889
abstracting: (p69<=1)
states: 30,213 (4)
.abstracting: (0<=p56)
states: 30,213 (4)
abstracting: (p56<=0)
states: 28,710 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p19)
states: 30,213 (4)
abstracting: (p19<=0)
states: 29,148 (4)
.
EG iterations: 0
abstracting: (0<=p115)
states: 30,213 (4)
abstracting: (p115<=0)
states: 29,812 (4)
..
EG iterations: 1
abstracting: (1<=p19)
states: 1,065 (3)
abstracting: (p19<=1)
states: 30,213 (4)
abstracting: (0<=p47)
states: 30,213 (4)
abstracting: (p47<=0)
states: 30,123 (4)
.
EG iterations: 1
abstracting: (0<=p36)
states: 30,213 (4)
abstracting: (p36<=0)
states: 29,180 (4)
abstracting: (1<=p33)
states: 1,063 (3)
abstracting: (p33<=1)
states: 30,213 (4)
.abstracting: (0<=p74)
states: 30,213 (4)
abstracting: (p74<=0)
states: 29,071 (4)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 1.655sec

checking: EX [[AF [~ [A [[p71<=1 & 1<=p71] U [[p99<=0 & 0<=p99] | [p95<=1 & 1<=p95]]]]] & EF [[[[[p51<=0 & 0<=p51] | [p30<=1 & 1<=p30]] & EG [[[p79<=0 & 0<=p79] | [p78<=1 & 1<=p78]]]] | [[[[p8<=1 & 1<=p8] & [p55<=1 & 1<=p55]] | [p91<=0 & 0<=p91]] & EG [[[p37<=0 & 0<=p37] | [p28<=1 & 1<=p28]]]]]]]]
normalized: EX [[E [true U [[EG [[[p28<=1 & 1<=p28] | [p37<=0 & 0<=p37]]] & [[p91<=0 & 0<=p91] | [[p55<=1 & 1<=p55] & [p8<=1 & 1<=p8]]]] | [EG [[[p78<=1 & 1<=p78] | [p79<=0 & 0<=p79]]] & [[p30<=1 & 1<=p30] | [p51<=0 & 0<=p51]]]]] & ~ [EG [[~ [EG [~ [[[p95<=1 & 1<=p95] | [p99<=0 & 0<=p99]]]]] & ~ [E [~ [[[p95<=1 & 1<=p95] | [p99<=0 & 0<=p99]]] U [~ [[p71<=1 & 1<=p71]] & ~ [[[p95<=1 & 1<=p95] | [p99<=0 & 0<=p99]]]]]]]]]]]

abstracting: (0<=p99)
states: 30,213 (4)
abstracting: (p99<=0)
states: 30,113 (4)
abstracting: (1<=p95)
states: 90
abstracting: (p95<=1)
states: 30,213 (4)
abstracting: (1<=p71)
states: 1,041 (3)
abstracting: (p71<=1)
states: 30,213 (4)
abstracting: (0<=p99)
states: 30,213 (4)
abstracting: (p99<=0)
states: 30,113 (4)
abstracting: (1<=p95)
states: 90
abstracting: (p95<=1)
states: 30,213 (4)
abstracting: (0<=p99)
states: 30,213 (4)
abstracting: (p99<=0)
states: 30,113 (4)
abstracting: (1<=p95)
states: 90
abstracting: (p95<=1)
states: 30,213 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p51)
states: 30,213 (4)
abstracting: (p51<=0)
states: 28,829 (4)
abstracting: (1<=p30)
states: 1,035 (3)
abstracting: (p30<=1)
states: 30,213 (4)
abstracting: (0<=p79)
states: 30,213 (4)
abstracting: (p79<=0)
states: 29,719 (4)
abstracting: (1<=p78)
states: 706
abstracting: (p78<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p55)
states: 1,392 (3)
abstracting: (p55<=1)
states: 30,213 (4)
abstracting: (0<=p91)
states: 30,213 (4)
abstracting: (p91<=0)
states: 29,812 (4)
abstracting: (0<=p37)
states: 30,213 (4)
abstracting: (p37<=0)
states: 28,932 (4)
abstracting: (1<=p28)
states: 1,358 (3)
abstracting: (p28<=1)
states: 30,213 (4)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.282sec

totally nodes used: 3793715 (3.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8858174 30881555 39739729
used/not used/entry size/cache size: 26873517 40235347 16 1024MB
basic ops cache: hits/miss/sum: 1450188 3749821 5200009
used/not used/entry size/cache size: 5453332 11323884 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: 15648 81897 97545
used/not used/entry size/cache size: 81520 8307088 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 63837089
1 2837243
2 359322
3 64516
4 9339
5 1217
6 127
7 11
8 0
9 0
>= 10 0

Total processing time: 0m15.044sec


BK_STOP 1680820229353

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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.000sec


iterations count:54834 (257), effective:1213 (5)

initing FirstDep: 0m 0.000sec


iterations count:27181 (127), effective:630 (2)

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

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

iterations count:33953 (159), effective:792 (3)

iterations count:19885 (93), effective:448 (2)

iterations count:383 (1), effective:9 (0)

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

iterations count:30669 (143), effective:750 (3)

iterations count:27991 (131), effective:614 (2)

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

iterations count:8191 (38), effective:181 (0)

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

iterations count:34900 (163), effective:807 (3)

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

iterations count:1005 (4), effective:13 (0)

iterations count:35854 (168), effective:838 (3)

iterations count:11933 (56), effective:264 (1)

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

iterations count:34639 (162), effective:809 (3)

iterations count:26446 (124), effective:624 (2)

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

iterations count:448 (2), effective:6 (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="EisenbergMcGuire-PT-03"
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-03, 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-167987247100217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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