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.r106-tall-167814482700441.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 DES-PT-30a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-30a-CTLCardinality-00
FORMULA_NAME DES-PT-30a-CTLCardinality-01
FORMULA_NAME DES-PT-30a-CTLCardinality-02
FORMULA_NAME DES-PT-30a-CTLCardinality-03
FORMULA_NAME DES-PT-30a-CTLCardinality-04
FORMULA_NAME DES-PT-30a-CTLCardinality-05
FORMULA_NAME DES-PT-30a-CTLCardinality-06
FORMULA_NAME DES-PT-30a-CTLCardinality-07
FORMULA_NAME DES-PT-30a-CTLCardinality-08
FORMULA_NAME DES-PT-30a-CTLCardinality-09
FORMULA_NAME DES-PT-30a-CTLCardinality-10
FORMULA_NAME DES-PT-30a-CTLCardinality-11
FORMULA_NAME DES-PT-30a-CTLCardinality-12
FORMULA_NAME DES-PT-30a-CTLCardinality-13
FORMULA_NAME DES-PT-30a-CTLCardinality-14
FORMULA_NAME DES-PT-30a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678393255006

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=DES-PT-30a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 20:20:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 20:20:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:20:56] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 20:20:56] [INFO ] Transformed 234 places.
[2023-03-09 20:20:56] [INFO ] Transformed 191 transitions.
[2023-03-09 20:20:56] [INFO ] Found NUPN structural information;
[2023-03-09 20:20:56] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 86 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 176
Applied a total of 2 rules in 30 ms. Remains 233 /234 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 233 cols
[2023-03-09 20:20:56] [INFO ] Computed 59 place invariants in 32 ms
[2023-03-09 20:20:57] [INFO ] Implicit Places using invariants in 508 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 533 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 232/234 places, 176/177 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 572 ms. Remains : 232/234 places, 176/177 transitions.
Support contains 86 out of 232 places after structural reductions.
[2023-03-09 20:20:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-09 20:20:57] [INFO ] Flatten gal took : 46 ms
FORMULA DES-PT-30a-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30a-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 20:20:57] [INFO ] Flatten gal took : 28 ms
[2023-03-09 20:20:57] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 76 out of 232 places (down from 86) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 54) seen :37
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 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 5 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 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 4 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 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 176 rows 232 cols
[2023-03-09 20:20:58] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-09 20:20:58] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 20:20:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-09 20:20:58] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 81 ms returned sat
[2023-03-09 20:20:59] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 20:20:59] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 5 ms to minimize.
[2023-03-09 20:20:59] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2023-03-09 20:20:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-09 20:20:59] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-09 20:20:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-09 20:21:00] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-09 20:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 20:21:00] [INFO ] After 1106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-03-09 20:21:00] [INFO ] After 1797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 16 properties in 531 ms.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 231 transition count 173
Applied a total of 9 rules in 56 ms. Remains 231 /232 variables (removed 1) and now considering 173/176 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 231/232 places, 173/176 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1629777 steps, run timeout after 3001 ms. (steps per millisecond=543 ) properties seen :{}
Probabilistic random walk after 1629777 steps, saw 228724 distinct states, run finished after 3002 ms. (steps per millisecond=542 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:21:04] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 20:21:04] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-09 20:21:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-09 20:21:04] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:21:04] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:04] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 20:21:04] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:21:04] [INFO ] Invariant cache hit.
[2023-03-09 20:21:04] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-09 20:21:04] [INFO ] Invariant cache hit.
[2023-03-09 20:21:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:21:04] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-09 20:21:04] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 20:21:04] [INFO ] Invariant cache hit.
[2023-03-09 20:21:05] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 231/231 places, 173/173 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 173
Applied a total of 1 rules in 17 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:21:05] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 20:21:05] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-09 20:21:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-09 20:21:05] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:05] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 20:21:05] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 24 ms
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 21 ms
[2023-03-09 20:21:05] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 14 ms
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 15 ms
[2023-03-09 20:21:05] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 11 ms
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 12 ms
[2023-03-09 20:21:05] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 12 ms
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 12 ms
[2023-03-09 20:21:05] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 11 ms
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 11 ms
[2023-03-09 20:21:05] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 15 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 231/232 places, 175/176 transitions.
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 10 ms
[2023-03-09 20:21:05] [INFO ] Flatten gal took : 11 ms
[2023-03-09 20:21:05] [INFO ] Input system was already deterministic with 175 transitions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1747976 steps, run timeout after 3001 ms. (steps per millisecond=582 ) properties seen :{}
Probabilistic random walk after 1747976 steps, saw 237474 distinct states, run finished after 3001 ms. (steps per millisecond=582 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 175 rows 231 cols
[2023-03-09 20:21:08] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-09 20:21:08] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:08] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 20:21:08] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-09 20:21:09] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-09 20:21:09] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:09] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 20:21:09] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 522 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=174 )
FORMULA DES-PT-30a-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 231/232 places, 175/176 transitions.
[2023-03-09 20:21:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:09] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:09] [INFO ] Input system was already deterministic with 175 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1807569 steps, run timeout after 3001 ms. (steps per millisecond=602 ) properties seen :{}
Probabilistic random walk after 1807569 steps, saw 245233 distinct states, run finished after 3001 ms. (steps per millisecond=602 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 20:21:12] [INFO ] Invariant cache hit.
[2023-03-09 20:21:12] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 20:21:12] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 20:21:12] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 20:21:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-09 20:21:12] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 20:21:12] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 20:21:12] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 20:21:12] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 5285 steps, including 71 resets, run visited all 1 properties in 17 ms. (steps per millisecond=310 )
FORMULA DES-PT-30a-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 16 ms.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 231/232 places, 175/176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 10 ms
[2023-03-09 20:21:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 232/232 places, 176/176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 8 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:12] [INFO ] Input system was already deterministic with 176 transitions.
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 9 ms
[2023-03-09 20:21:12] [INFO ] Flatten gal took : 18 ms
[2023-03-09 20:21:12] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-09 20:21:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 176 transitions and 855 arcs took 18 ms.
Total runtime 16533 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: 232 NrTr: 176 NrArc: 855)

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

net check time: 0m 0.000sec

init dd package: 0m 2.708sec


RS generation: 0m41.810sec


-> reachability set: #nodes 800631 (8.0e+05) #states 16,369,951,883,674 (13)



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

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

abstracting: (1<=p88)
states: 421,485,867,730 (11)
abstracting: (p88<=1)
states: 16,369,951,883,674 (13)
.
before gc: list nodes free: 1178107

after gc: idd nodes used:2712802, unused:61287198; list nodes free:274945242
-> the formula is TRUE

FORMULA DES-PT-30a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m58.402sec

checking: AX [[AF [[[p199<=0 & 0<=p199] & [p193<=1 & 1<=p193]]] | [p89<=1 & 1<=p89]]]
normalized: ~ [EX [~ [[[p89<=1 & 1<=p89] | ~ [EG [~ [[[p193<=1 & 1<=p193] & [p199<=0 & 0<=p199]]]]]]]]]

abstracting: (0<=p199)
states: 16,369,951,883,674 (13)
abstracting: (p199<=0)
states: 6,637,678,476,638 (12)
abstracting: (1<=p193)
states: 9,732,273,407,036 (12)
abstracting: (p193<=1)
states: 16,369,951,883,674 (13)
.
EG iterations: 1
abstracting: (1<=p89)
states: 159,981,852,896 (11)
abstracting: (p89<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 147852

after gc: idd nodes used:2396064, unused:61603936; list nodes free:276322325
.-> the formula is FALSE

FORMULA DES-PT-30a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.791sec

checking: AF [E [~ [[p220<=1 & 1<=p220]] U EF [[[p124<=1 & 1<=p124] & [[p150<=0 & 0<=p150] | [p13<=1 & 1<=p13]]]]]]
normalized: ~ [EG [~ [E [~ [[p220<=1 & 1<=p220]] U E [true U [[[p13<=1 & 1<=p13] | [p150<=0 & 0<=p150]] & [p124<=1 & 1<=p124]]]]]]]

abstracting: (1<=p124)
states: 5,450,074,885,492 (12)
abstracting: (p124<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p150)
states: 16,369,951,883,674 (13)
abstracting: (p150<=0)
states: 5,386,321,603,764 (12)
abstracting: (1<=p13)
states: 598,709,743,096 (11)
abstracting: (p13<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p220)
states: 5,207,133,995,340 (12)
abstracting: (p220<=1)
states: 16,369,951,883,674 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-30a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m59.457sec

checking: EF [~ [A [E [[p2<=0 & 0<=p2] U [p157<=1 & 1<=p157]] U E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]]]]
normalized: E [true U ~ [[~ [EG [~ [E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]]]] & ~ [E [~ [E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]] U [~ [E [[p2<=0 & 0<=p2] U [p157<=1 & 1<=p157]]] & ~ [E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]]]]]]]]

abstracting: (1<=p27)
states: 558,679,645,865 (11)
abstracting: (p27<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p137)
states: 16,369,951,883,674 (13)
abstracting: (p137<=0)
states: 13,873,705,733,234 (13)

before gc: list nodes free: 858278

after gc: idd nodes used:2675568, unused:61324432; list nodes free:275146669
abstracting: (1<=p157)
states: 10,523,975,738,352 (13)
abstracting: (p157<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p2)
states: 16,369,951,883,674 (13)
abstracting: (p2<=0)
states: 15,848,340,021,406 (13)
abstracting: (1<=p27)
states: 558,679,645,865 (11)
abstracting: (p27<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p137)
states: 16,369,951,883,674 (13)
abstracting: (p137<=0)
states: 13,873,705,733,234 (13)

before gc: list nodes free: 560360

after gc: idd nodes used:4105989, unused:59894011; list nodes free:268692479
abstracting: (1<=p27)
states: 558,679,645,865 (11)
abstracting: (p27<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p137)
states: 16,369,951,883,674 (13)
abstracting: (p137<=0)
states: 13,873,705,733,234 (13)
MC time: 6m34.058sec

checking: AG [AF [[~ [E [[p180<=0 & 0<=p180] U [[p15<=0 & 0<=p15] | [p198<=1 & 1<=p198]]]] & AF [[p212<=0 & 0<=p212]]]]]
normalized: ~ [E [true U EG [~ [[~ [EG [~ [[p212<=0 & 0<=p212]]]] & ~ [E [[p180<=0 & 0<=p180] U [[p198<=1 & 1<=p198] | [p15<=0 & 0<=p15]]]]]]]]]

abstracting: (0<=p15)
states: 16,369,951,883,674 (13)
abstracting: (p15<=0)
states: 15,771,242,140,578 (13)
abstracting: (1<=p198)
states: 5,474,436,783,462 (12)
abstracting: (p198<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p180)
states: 16,369,951,883,674 (13)
abstracting: (p180<=0)
states: 6,048,566,677,811 (12)
abstracting: (0<=p212)
states: 16,369,951,883,674 (13)
abstracting: (p212<=0)
states: 14,654,579,499,460 (13)
...
before gc: list nodes free: 1103984

after gc: idd nodes used:4864338, unused:59135662; list nodes free:267206649
.......
before gc: list nodes free: 1598617

after gc: idd nodes used:6058166, unused:57941834; list nodes free:262005436
.
before gc: list nodes free: 1865418

after gc: idd nodes used:11758272, unused:52241728; list nodes free:238309204
.
before gc: list nodes free: 869705

after gc: idd nodes used:12901826, unused:51098174; list nodes free:232865639
MC time: 5m45.178sec

checking: EG [[[EX [[p4<=0 & 0<=p4]] | AX [AF [[p17<=1 & 1<=p17]]]] | [[p0<=0 & 0<=p0] | EF [AX [[[p92<=0 & 0<=p92] | [p70<=1 & 1<=p70]]]]]]]
normalized: EG [[[E [true U ~ [EX [~ [[[p70<=1 & 1<=p70] | [p92<=0 & 0<=p92]]]]]] | [p0<=0 & 0<=p0]] | [~ [EX [EG [~ [[p17<=1 & 1<=p17]]]]] | EX [[p4<=0 & 0<=p4]]]]]

abstracting: (0<=p4)
states: 16,369,951,883,674 (13)
abstracting: (p4<=0)
states: 15,771,242,350,510 (13)
.abstracting: (1<=p17)
states: 598,709,743,096 (11)
abstracting: (p17<=1)
states: 16,369,951,883,674 (13)
..............
before gc: list nodes free: 1196497

after gc: idd nodes used:8234093, unused:55765907; list nodes free:254222318
..
before gc: list nodes free: 276190

after gc: idd nodes used:10976969, unused:53023031; list nodes free:241533358
.MC time: 5m 2.670sec

checking: [AG [AF [~ [A [[p167<=0 & 0<=p167] U [p74<=1 & 1<=p74]]]]] & EX [AF [[[p189<=0 & 0<=p189] | AX [[[p55<=0 & 0<=p55] & [p176<=1 & 1<=p176]]]]]]]
normalized: [EX [~ [EG [~ [[~ [EX [~ [[[p55<=0 & 0<=p55] & [p176<=1 & 1<=p176]]]]] | [p189<=0 & 0<=p189]]]]]] & ~ [E [true U EG [[~ [EG [~ [[p74<=1 & 1<=p74]]]] & ~ [E [~ [[p74<=1 & 1<=p74]] U [~ [[p167<=0 & 0<=p167]] & ~ [[p74<=1 & 1<=p74]]]]]]]]]]

abstracting: (1<=p74)
states: 564,617,457,142 (11)
abstracting: (p74<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p167)
states: 16,369,951,883,674 (13)
abstracting: (p167<=0)
states: 10,321,385,205,864 (13)
abstracting: (1<=p74)
states: 564,617,457,142 (11)
abstracting: (p74<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 2091970

after gc: idd nodes used:3370021, unused:60629979; list nodes free:276217698
abstracting: (1<=p74)
states: 564,617,457,142 (11)
abstracting: (p74<=1)
states: 16,369,951,883,674 (13)
...........
before gc: list nodes free: 7480931

after gc: idd nodes used:4941844, unused:59058156; list nodes free:269146288
..MC time: 4m24.027sec

checking: EG [[AF [[p121<=1 & 1<=p121]] | [AX [[p213<=1 & 1<=p213]] | [EX [[[p139<=0 & 0<=p139] | [p193<=1 & 1<=p193]]] & [[[p149<=0 & 0<=p149] | [p65<=1 & 1<=p65]] & [[p163<=0 & 0<=p163] | [E [[p158<=1 & 1<=p158] U [p230<=1 & 1<=p230]] & EX [0<=0]]]]]]]]
normalized: EG [[[[[[[EX [0<=0] & E [[p158<=1 & 1<=p158] U [p230<=1 & 1<=p230]]] | [p163<=0 & 0<=p163]] & [[p65<=1 & 1<=p65] | [p149<=0 & 0<=p149]]] & EX [[[p193<=1 & 1<=p193] | [p139<=0 & 0<=p139]]]] | ~ [EX [~ [[p213<=1 & 1<=p213]]]]] | ~ [EG [~ [[p121<=1 & 1<=p121]]]]]]

abstracting: (1<=p121)
states: 8,081,922,419,536 (12)
abstracting: (p121<=1)
states: 16,369,951,883,674 (13)
....
before gc: list nodes free: 4285147

after gc: idd nodes used:4620307, unused:59379693; list nodes free:270582845
.....
before gc: list nodes free: 3822116

after gc: idd nodes used:6580053, unused:57419947; list nodes free:261744441
.MC time: 3m51.071sec

checking: ~ [A [[[p217<=1 & 1<=p217] | AF [[AF [[[p16<=0 & 0<=p16] | [p119<=1 & 1<=p119]]] & [[p60<=0 & 0<=p60] | [p90<=1 & 1<=p90]]]]] U ~ [EX [[[[p146<=0 & 0<=p146] | [[p217<=1 & 1<=p217] | [p114<=0 & 0<=p114]]] & ~ [[[p214<=1 & 1<=p214] & [p61<=1 & 1<=p61]]]]]]]]
normalized: ~ [[~ [EG [EX [[~ [[[p61<=1 & 1<=p61] & [p214<=1 & 1<=p214]]] & [[[p114<=0 & 0<=p114] | [p217<=1 & 1<=p217]] | [p146<=0 & 0<=p146]]]]]] & ~ [E [EX [[~ [[[p61<=1 & 1<=p61] & [p214<=1 & 1<=p214]]] & [[[p114<=0 & 0<=p114] | [p217<=1 & 1<=p217]] | [p146<=0 & 0<=p146]]]] U [~ [[~ [EG [~ [[[[p90<=1 & 1<=p90] | [p60<=0 & 0<=p60]] & ~ [EG [~ [[[p119<=1 & 1<=p119] | [p16<=0 & 0<=p16]]]]]]]]] | [p217<=1 & 1<=p217]]] & EX [[~ [[[p61<=1 & 1<=p61] & [p214<=1 & 1<=p214]]] & [[[p114<=0 & 0<=p114] | [p217<=1 & 1<=p217]] | [p146<=0 & 0<=p146]]]]]]]]]

abstracting: (0<=p146)
states: 16,369,951,883,674 (13)
abstracting: (p146<=0)
states: 8,159,698,039,516 (12)
abstracting: (1<=p217)
states: 3,938,064,437,032 (12)
abstracting: (p217<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p114)
states: 16,369,951,883,674 (13)
abstracting: (p114<=0)
states: 15,771,242,140,578 (13)
abstracting: (1<=p214)
states: 2,649,905,210,371 (12)
abstracting: (p214<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p61)
states: 564,617,457,142 (11)
abstracting: (p61<=1)
states: 16,369,951,883,674 (13)

before gc: list nodes free: 2713406

after gc: idd nodes used:4915361, unused:59084639; list nodes free:269193626
.abstracting: (1<=p217)
states: 3,938,064,437,032 (12)
abstracting: (p217<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p16)
states: 16,369,951,883,674 (13)
abstracting: (p16<=0)
states: 15,771,242,140,578 (13)
abstracting: (1<=p119)
states: 248,618,263,763 (11)
abstracting: (p119<=1)
states: 16,369,951,883,674 (13)
...............
before gc: list nodes free: 605410

after gc: idd nodes used:10769657, unused:53230343; list nodes free:242628437
.MC time: 3m22.747sec

checking: [EX [AF [[AF [[p201<=0 & 0<=p201]] & AF [[p168<=0 & 0<=p168]]]]] & [EF [EG [[p97<=0 & 0<=p97]]] | AG [[E [EX [[[p129<=0 & 0<=p129] | [p0<=1 & 1<=p0]]] U [p162<=1 & 1<=p162]] & [EF [[[p174<=1 & 1<=p174] & [[p16<=0 & 0<=p16] | [p205<=1 & 1<=p205]]]] & [[EG [[[p220<=0 & 0<=p220] & [p111<=1 & 1<=p111]]] | [p4<=0 & 0<=p4]] | [[p22<=1 & 1<=p22] | [p3<=1 & 1<=p3]]]]]]]]
normalized: [[E [true U EG [[p97<=0 & 0<=p97]]] | ~ [E [true U ~ [[[[[[p3<=1 & 1<=p3] | [p22<=1 & 1<=p22]] | [[p4<=0 & 0<=p4] | EG [[[p111<=1 & 1<=p111] & [p220<=0 & 0<=p220]]]]] & E [true U [[[p205<=1 & 1<=p205] | [p16<=0 & 0<=p16]] & [p174<=1 & 1<=p174]]]] & E [EX [[[p0<=1 & 1<=p0] | [p129<=0 & 0<=p129]]] U [p162<=1 & 1<=p162]]]]]]] & EX [~ [EG [~ [[~ [EG [~ [[p168<=0 & 0<=p168]]]] & ~ [EG [~ [[p201<=0 & 0<=p201]]]]]]]]]]

abstracting: (0<=p201)
states: 16,369,951,883,674 (13)
abstracting: (p201<=0)
states: 6,637,678,476,638 (12)
.....
before gc: list nodes free: 2870038

after gc: idd nodes used:5358710, unused:58641290; list nodes free:267258147
....
before gc: list nodes free: 3719849

after gc: idd nodes used:8657599, unused:55342401; list nodes free:252312761
MC time: 2m58.330sec

checking: A [A [[[~ [[[[0<=p18 & p18<=0] | [p40<=1 & 1<=p40]] | [EX [[p8<=0 & 0<=p8]] | [p59<=1 & 1<=p59]]]] | E [[p145<=0 & 0<=p145] U A [[p2<=1 & 1<=p2] U [[p129<=0 & 0<=p129] | [p137<=1 & 1<=p137]]]]] & [p117<=1 & 1<=p117]] U ~ [AG [EX [0<=0]]]] U [E [~ [[p142<=0 & 0<=p142]] U [[p82<=1 & 1<=p82] | [p119<=1 & 1<=p119]]] | [AX [[[[[p192<=1 & 1<=p192] | [p144<=0 & 0<=p144]] | [[p6<=1 & 1<=p6] | [p102<=1 & 1<=p102]]] & [[p57<=0 & 0<=p57] | [p140<=1 & 1<=p140]]]] & [[[p195<=0 & 0<=p195] | [p1<=1 & 1<=p1]] | [AF [[p228<=1 & 1<=p228]] | [AG [[[[p117<=0 & 0<=p117] | [p179<=1 & 1<=p179]] & [p91<=0 & 0<=p91]]] & [[p107<=1 & 1<=p107] & [[p66<=0 & 0<=p66] | [p72<=1 & 1<=p72]]]]]]]]]
normalized: [~ [EG [~ [[[[[[[[[p72<=1 & 1<=p72] | [p66<=0 & 0<=p66]] & [p107<=1 & 1<=p107]] & ~ [E [true U ~ [[[p91<=0 & 0<=p91] & [[p179<=1 & 1<=p179] | [p117<=0 & 0<=p117]]]]]]] | ~ [EG [~ [[p228<=1 & 1<=p228]]]]] | [[p1<=1 & 1<=p1] | [p195<=0 & 0<=p195]]] & ~ [EX [~ [[[[p140<=1 & 1<=p140] | [p57<=0 & 0<=p57]] & [[[p102<=1 & 1<=p102] | [p6<=1 & 1<=p6]] | [[p144<=0 & 0<=p144] | [p192<=1 & 1<=p192]]]]]]]] | E [~ [[p142<=0 & 0<=p142]] U [[p119<=1 & 1<=p119] | [p82<=1 & 1<=p82]]]]]]] & ~ [E [~ [[[[[[[[[p72<=1 & 1<=p72] | [p66<=0 & 0<=p66]] & [p107<=1 & 1<=p107]] & ~ [E [true U ~ [[[p91<=0 & 0<=p91] & [[p179<=1 & 1<=p179] | [p117<=0 & 0<=p117]]]]]]] | ~ [EG [~ [[p228<=1 & 1<=p228]]]]] | [[p1<=1 & 1<=p1] | [p195<=0 & 0<=p195]]] & ~ [EX [~ [[[[p140<=1 & 1<=p140] | [p57<=0 & 0<=p57]] & [[[p102<=1 & 1<=p102] | [p6<=1 & 1<=p6]] | [[p144<=0 & 0<=p144] | [p192<=1 & 1<=p192]]]]]]]] | E [~ [[p142<=0 & 0<=p142]] U [[p119<=1 & 1<=p119] | [p82<=1 & 1<=p82]]]]] U [~ [[~ [EG [~ [E [true U ~ [EX [0<=0]]]]]] & ~ [E [~ [E [true U ~ [EX [0<=0]]]] U [~ [[[p117<=1 & 1<=p117] & [E [[p145<=0 & 0<=p145] U [~ [EG [~ [[[p137<=1 & 1<=p137] | [p129<=0 & 0<=p129]]]]] & ~ [E [~ [[[p137<=1 & 1<=p137] | [p129<=0 & 0<=p129]]] U [~ [[p2<=1 & 1<=p2]] & ~ [[[p137<=1 & 1<=p137] | [p129<=0 & 0<=p129]]]]]]]] | ~ [[[[p59<=1 & 1<=p59] | EX [[p8<=0 & 0<=p8]]] | [[p40<=1 & 1<=p40] | [0<=p18 & p18<=0]]]]]]] & ~ [E [true U ~ [EX [0<=0]]]]]]]]] & ~ [[[[[[[[[p72<=1 & 1<=p72] | [p66<=0 & 0<=p66]] & [p107<=1 & 1<=p107]] & ~ [E [true U ~ [[[p91<=0 & 0<=p91] & [[p179<=1 & 1<=p179] | [p117<=0 & 0<=p117]]]]]]] | ~ [EG [~ [[p228<=1 & 1<=p228]]]]] | [[p1<=1 & 1<=p1] | [p195<=0 & 0<=p195]]] & ~ [EX [~ [[[[p140<=1 & 1<=p140] | [p57<=0 & 0<=p57]] & [[[p102<=1 & 1<=p102] | [p6<=1 & 1<=p6]] | [[p144<=0 & 0<=p144] | [p192<=1 & 1<=p192]]]]]]]] | E [~ [[p142<=0 & 0<=p142]] U [[p119<=1 & 1<=p119] | [p82<=1 & 1<=p82]]]]]]]]]

abstracting: (1<=p82)
states: 564,617,457,142 (11)
abstracting: (p82<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p119)
states: 248,618,263,763 (11)
abstracting: (p119<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p142)
states: 16,369,951,883,674 (13)
abstracting: (p142<=0)
states: 12,373,447,849,002 (13)
abstracting: (1<=p192)
states: 5,474,436,783,462 (12)
abstracting: (p192<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p144)
states: 16,369,951,883,674 (13)
abstracting: (p144<=0)
states: 8,743,727,782,023 (12)
abstracting: (1<=p6)
states: 598,709,743,096 (11)
abstracting: (p6<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p102)
states: 598,709,743,096 (11)
abstracting: (p102<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p57)
states: 16,369,951,883,674 (13)
abstracting: (p57<=0)
states: 16,089,350,093,175 (13)
abstracting: (1<=p140)
states: 4,095,034,499,784 (12)
abstracting: (p140<=1)
states: 16,369,951,883,674 (13)
.abstracting: (0<=p195)
states: 16,369,951,883,674 (13)
abstracting: (p195<=0)
states: 6,637,678,476,638 (12)
abstracting: (1<=p1)
states: 83,477,024,082 (10)
abstracting: (p1<=1)
states: 16,369,951,883,674 (13)
abstracting: (1<=p228)
states: 2,856,075,936,611 (12)
abstracting: (p228<=1)
states: 16,369,951,883,674 (13)
MC time: 2m35.060sec

checking: EF [~ [A [E [[p2<=0 & 0<=p2] U [p157<=1 & 1<=p157]] U E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]]]]
normalized: E [true U ~ [[~ [EG [~ [E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]]]] & ~ [E [~ [E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]] U [~ [E [[p2<=0 & 0<=p2] U [p157<=1 & 1<=p157]]] & ~ [E [[p137<=0 & 0<=p137] U [p27<=1 & 1<=p27]]]]]]]]]

abstracting: (1<=p27)
states: 558,679,645,865 (11)
abstracting: (p27<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p137)
states: 16,369,951,883,674 (13)
abstracting: (p137<=0)
states: 13,873,705,733,234 (13)

before gc: list nodes free: 6347563

after gc: idd nodes used:6250295, unused:57749705; list nodes free:263138992
abstracting: (1<=p157)
states: 10,523,975,738,352 (13)
abstracting: (p157<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p2)
states: 16,369,951,883,674 (13)
abstracting: (p2<=0)
states: 15,848,340,021,406 (13)
abstracting: (1<=p27)
states: 558,679,645,865 (11)
abstracting: (p27<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p137)
states: 16,369,951,883,674 (13)
abstracting: (p137<=0)
states: 13,873,705,733,234 (13)

before gc: list nodes free: 4690295

after gc: idd nodes used:7568569, unused:56431431; list nodes free:257192685
abstracting: (1<=p27)
states: 558,679,645,865 (11)
abstracting: (p27<=1)
states: 16,369,951,883,674 (13)
abstracting: (0<=p137)
states: 16,369,951,883,674 (13)
abstracting: (p137<=0)
states: 13,873,705,733,234 (13)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6029500 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100404 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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

833625 813336 794595 800499
iterations count:443725 (2521), effective:35971 (204)

initing FirstDep: 0m 0.000sec


iterations count:92904 (527), effective:8223 (46)

iterations count:47531 (270), effective:3371 (19)

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

iterations count:20972 (119), effective:1368 (7)

iterations count:10093 (57), effective:574 (3)

iterations count:20972 (119), effective:1368 (7)
2016244
iterations count:139363 (791), effective:10217 (58)

iterations count:20972 (119), effective:1368 (7)

net_ddint.h:600: Timeout: after 393 sec


iterations count:7557 (42), effective:567 (3)

net_ddint.h:600: Timeout: after 344 sec


net_ddint.h:600: Timeout: after 301 sec


iterations count:16594 (94), effective:764 (4)

net_ddint.h:600: Timeout: after 263 sec


net_ddint.h:600: Timeout: after 230 sec


net_ddint.h:600: Timeout: after 201 sec


net_ddint.h:600: Timeout: after 176 sec


iterations count:55922 (317), effective:4659 (26)

net_ddint.h:600: Timeout: after 154 sec


iterations count:20972 (119), effective:1368 (7)

iterations count:10093 (57), effective:574 (3)

iterations count:20972 (119), effective:1368 (7)
2016244
iterations count:139363 (791), effective:10217 (58)

iterations count:20972 (119), effective:1368 (7)

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="DES-PT-30a"
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 DES-PT-30a, 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 r106-tall-167814482700441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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