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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 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.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 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 43K 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-10a-CTLCardinality-00
FORMULA_NAME DES-PT-10a-CTLCardinality-01
FORMULA_NAME DES-PT-10a-CTLCardinality-02
FORMULA_NAME DES-PT-10a-CTLCardinality-03
FORMULA_NAME DES-PT-10a-CTLCardinality-04
FORMULA_NAME DES-PT-10a-CTLCardinality-05
FORMULA_NAME DES-PT-10a-CTLCardinality-06
FORMULA_NAME DES-PT-10a-CTLCardinality-07
FORMULA_NAME DES-PT-10a-CTLCardinality-08
FORMULA_NAME DES-PT-10a-CTLCardinality-09
FORMULA_NAME DES-PT-10a-CTLCardinality-10
FORMULA_NAME DES-PT-10a-CTLCardinality-11
FORMULA_NAME DES-PT-10a-CTLCardinality-12
FORMULA_NAME DES-PT-10a-CTLCardinality-13
FORMULA_NAME DES-PT-10a-CTLCardinality-14
FORMULA_NAME DES-PT-10a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678385969290

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-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 18:19:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 18:19:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 18:19:30] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-09 18:19:31] [INFO ] Transformed 155 places.
[2023-03-09 18:19:31] [INFO ] Transformed 112 transitions.
[2023-03-09 18:19:31] [INFO ] Found NUPN structural information;
[2023-03-09 18:19:31] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Applied a total of 0 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 155 cols
[2023-03-09 18:19:31] [INFO ] Computed 59 place invariants in 11 ms
[2023-03-09 18:19:31] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-09 18:19:31] [INFO ] Invariant cache hit.
[2023-03-09 18:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 18:19:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-09 18:19:31] [INFO ] Invariant cache hit.
[2023-03-09 18:19:31] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 155/155 places, 98/98 transitions.
Support contains 94 out of 155 places after structural reductions.
[2023-03-09 18:19:31] [INFO ] Flatten gal took : 38 ms
[2023-03-09 18:19:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-10a-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 18:19:31] [INFO ] Flatten gal took : 14 ms
[2023-03-09 18:19:31] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 90 out of 155 places (down from 94) after GAL structural reductions.
FORMULA DES-PT-10a-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 213 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 73) seen :63
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-09 18:19:32] [INFO ] Invariant cache hit.
[2023-03-09 18:19:33] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 18:19:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 18:19:33] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-09 18:19:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 18:19:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-09 18:19:33] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2023-03-09 18:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 18:19:33] [INFO ] After 62ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2023-03-09 18:19:33] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 4 ms to minimize.
[2023-03-09 18:19:33] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-09 18:19:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-09 18:19:33] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-09 18:19:33] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 98/98 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 155 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 154 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 154 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 154 transition count 95
Applied a total of 9 rules in 33 ms. Remains 154 /155 variables (removed 1) and now considering 95/98 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 154/155 places, 95/98 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 95 rows 154 cols
[2023-03-09 18:19:34] [INFO ] Computed 61 place invariants in 13 ms
[2023-03-09 18:19:34] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 18:19:34] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-09 18:19:34] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 18:19:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-09 18:19:34] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-09 18:19:34] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 18:19:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 18:19:34] [INFO ] After 69ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 18:19:34] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-09 18:19:34] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 136 ms.
Support contains 10 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 95/95 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 18:19:35] [INFO ] Invariant cache hit.
[2023-03-09 18:19:35] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 18:19:35] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 18:19:35] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 18:19:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 18:19:35] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-09 18:19:35] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 18:19:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 18:19:35] [INFO ] After 47ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 18:19:35] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-09 18:19:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2023-03-09 18:19:35] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2023-03-09 18:19:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2023-03-09 18:19:35] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-09 18:19:36] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 91 ms.
Support contains 8 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 95/95 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 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 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1016648 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1016648 steps, saw 143756 distinct states, run finished after 3002 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-09 18:19:39] [INFO ] Invariant cache hit.
[2023-03-09 18:19:39] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 18:19:39] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-09 18:19:39] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 18:19:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-09 18:19:39] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-09 18:19:39] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 18:19:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 18:19:39] [INFO ] After 46ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 18:19:39] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2023-03-09 18:19:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2023-03-09 18:19:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2023-03-09 18:19:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2023-03-09 18:19:40] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-09 18:19:40] [INFO ] After 643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 81 ms.
Support contains 8 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 154/154 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-09 18:19:40] [INFO ] Invariant cache hit.
[2023-03-09 18:19:40] [INFO ] Implicit Places using invariants in 85 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 153/154 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 96 ms. Remains : 153/154 places, 95/95 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-09 18:19:40] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-09 18:19:40] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 18:19:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 18:19:40] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:19:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 18:19:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-09 18:19:40] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 18:19:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 18:19:40] [INFO ] After 37ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 18:19:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-09 18:19:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-09 18:19:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2023-03-09 18:19:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2023-03-09 18:19:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 196 ms
[2023-03-09 18:19:41] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-09 18:19:41] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 153/153 places, 95/95 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1105661 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :{}
Probabilistic random walk after 1105661 steps, saw 154678 distinct states, run finished after 3001 ms. (steps per millisecond=368 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-09 18:19:44] [INFO ] Invariant cache hit.
[2023-03-09 18:19:44] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 18:19:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 18:19:44] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 18:19:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 18:19:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 119 ms returned sat
[2023-03-09 18:19:44] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 18:19:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 18:19:45] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 18:19:45] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-09 18:19:45] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 27 ms.
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-09 18:19:45] [INFO ] Invariant cache hit.
[2023-03-09 18:19:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 18:19:45] [INFO ] Invariant cache hit.
[2023-03-09 18:19:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 18:19:45] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-09 18:19:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 18:19:45] [INFO ] Invariant cache hit.
[2023-03-09 18:19:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-09 18:19:45] [INFO ] Invariant cache hit.
[2023-03-09 18:19:45] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 18:19:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-09 18:19:45] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 18:19:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 18:19:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-09 18:19:45] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 18:19:45] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 18:19:45] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 10 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 10 ms
[2023-03-09 18:19:45] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 81 out of 155 places (down from 83) after GAL structural reductions.
Computed a total of 58 stabilizing places and 52 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 3 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 9 ms
[2023-03-09 18:19:45] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 5 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 155/155 places, 98/98 transitions.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 5 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 5 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 7 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 8 ms
[2023-03-09 18:19:45] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 4 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 7 ms
[2023-03-09 18:19:45] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 10 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 7 ms
[2023-03-09 18:19:45] [INFO ] Flatten gal took : 7 ms
[2023-03-09 18:19:46] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 4 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 7 ms
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 7 ms
[2023-03-09 18:19:46] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 152 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 96
Applied a total of 3 rules in 11 ms. Remains 152 /155 variables (removed 3) and now considering 96/98 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 152/155 places, 96/98 transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 7 ms
[2023-03-09 18:19:46] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 155/155 places, 98/98 transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:46] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 4 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:46] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 4 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:46] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 9 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 154/155 places, 97/98 transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 5 ms
[2023-03-09 18:19:46] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:46] [INFO ] Flatten gal took : 6 ms
[2023-03-09 18:19:46] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-09 18:19:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 155 places, 98 transitions and 488 arcs took 1 ms.
Total runtime 15523 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: 155 NrTr: 98 NrArc: 488)

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

net check time: 0m 0.000sec

init dd package: 0m 2.714sec


RS generation: 0m29.362sec


-> reachability set: #nodes 791287 (7.9e+05) #states 1,600,305,869,653 (12)



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

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

abstracting: (1<=p101)
states: 587,447,996,428 (11)
abstracting: (p101<=1)
states: 1,600,305,869,653 (12)
.-> the formula is TRUE

FORMULA DES-PT-10a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m23.500sec

checking: EG [[p142<=0 & 0<=p142]]
normalized: EG [[p142<=0 & 0<=p142]]

abstracting: (0<=p142)
states: 1,600,305,869,653 (12)
abstracting: (p142<=0)
states: 1,105,444,505,540 (12)
.....
before gc: list nodes free: 269931

after gc: idd nodes used:2850265, unused:61149735; list nodes free:276477902
.....
before gc: list nodes free: 1920185

after gc: idd nodes used:7227994, unused:56772006; list nodes free:258833589
..
before gc: list nodes free: 1421866

after gc: idd nodes used:8272029, unused:55727971; list nodes free:254194387
MC time: 4m55.252sec

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

abstracting: (0<=p110)
states: 1,600,305,869,653 (12)
abstracting: (p110<=0)
states: 587,447,996,429 (11)
.
before gc: list nodes free: 1394891

after gc: idd nodes used:1305568, unused:62694432; list nodes free:285563653

before gc: list nodes free: 2744081

after gc: idd nodes used:2026991, unused:61973009; list nodes free:282289375
MC time: 4m26.069sec

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

abstracting: (0<=p119)
states: 1,600,305,869,653 (12)
abstracting: (p119<=0)
states: 643,290,950,502 (11)
abstracting: (1<=p102)
states: 1,012,857,873,224 (12)
abstracting: (p102<=1)
states: 1,600,305,869,653 (12)
.-> the formula is TRUE

FORMULA DES-PT-10a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.545sec

checking: EG [AF [[[p25<=1 & 1<=p25] & [p53<=0 & 0<=p53]]]]
normalized: EG [~ [EG [~ [[[p53<=0 & 0<=p53] & [p25<=1 & 1<=p25]]]]]]

abstracting: (1<=p25)
states: 177,524,273,840 (11)
abstracting: (p25<=1)
states: 1,600,305,869,653 (12)
abstracting: (0<=p53)
states: 1,600,305,869,653 (12)
abstracting: (p53<=0)
states: 750,761,591,821 (11)
.......................
before gc: list nodes free: 1084198

after gc: idd nodes used:4483666, unused:59516334; list nodes free:271131803
....................................
before gc: list nodes free: 214607

after gc: idd nodes used:4042596, unused:59957404; list nodes free:273163230
...............................................MC time: 4m24.001sec

checking: AF [E [AX [[p47<=0 & 0<=p47]] U [~ [AG [EX [0<=0]]] | ~ [A [~ [[p23<=1 & 1<=p23]] U [[p40<=0 & 0<=p40] | [p93<=1 & 1<=p93]]]]]]]
normalized: ~ [EG [~ [E [~ [EX [~ [[p47<=0 & 0<=p47]]]] U [~ [[~ [EG [~ [[[p93<=1 & 1<=p93] | [p40<=0 & 0<=p40]]]]] & ~ [E [~ [[[p93<=1 & 1<=p93] | [p40<=0 & 0<=p40]]] U [[p23<=1 & 1<=p23] & ~ [[[p93<=1 & 1<=p93] | [p40<=0 & 0<=p40]]]]]]]] | E [true U ~ [EX [0<=0]]]]]]]]

abstracting: (0<=0)
states: 1,600,305,869,653 (12)
.
before gc: list nodes free: 976740

after gc: idd nodes used:2361358, unused:61638642; list nodes free:280788085
MC time: 4m 0.033sec

checking: AG [AF [[~ [A [~ [[[p21<=0 & 0<=p21] | [p112<=1 & 1<=p112]]] U AG [[[p123<=0 & 0<=p123] | [p36<=1 & 1<=p36]]]]] | [[p20<=0 & 0<=p20] | [p148<=1 & 1<=p148]]]]]
normalized: ~ [E [true U EG [~ [[[[p148<=1 & 1<=p148] | [p20<=0 & 0<=p20]] | ~ [[~ [EG [E [true U ~ [[[p36<=1 & 1<=p36] | [p123<=0 & 0<=p123]]]]]] & ~ [E [E [true U ~ [[[p36<=1 & 1<=p36] | [p123<=0 & 0<=p123]]]] U [[[p112<=1 & 1<=p112] | [p21<=0 & 0<=p21]] & E [true U ~ [[[p36<=1 & 1<=p36] | [p123<=0 & 0<=p123]]]]]]]]]]]]]]

abstracting: (0<=p123)
states: 1,600,305,869,653 (12)
abstracting: (p123<=0)
states: 643,290,950,502 (11)
abstracting: (1<=p36)
states: 217,407,671,224 (11)
abstracting: (p36<=1)
states: 1,600,305,869,653 (12)
abstracting: (0<=p21)
states: 1,600,305,869,653 (12)
abstracting: (p21<=0)
states: 1,600,305,826,497 (12)
abstracting: (1<=p112)
states: 533,102,181,777 (11)
abstracting: (p112<=1)
states: 1,600,305,869,653 (12)
abstracting: (0<=p123)
states: 1,600,305,869,653 (12)
abstracting: (p123<=0)
states: 643,290,950,502 (11)
abstracting: (1<=p36)
states: 217,407,671,224 (11)
abstracting: (p36<=1)
states: 1,600,305,869,653 (12)
abstracting: (0<=p123)
states: 1,600,305,869,653 (12)
abstracting: (p123<=0)
states: 643,290,950,502 (11)
abstracting: (1<=p36)
states: 217,407,671,224 (11)
abstracting: (p36<=1)
states: 1,600,305,869,653 (12)

before gc: list nodes free: 2225991

after gc: idd nodes used:4270465, unused:59729535; list nodes free:272151559
.......
before gc: list nodes free: 2595154

after gc: idd nodes used:8784653, unused:55215347; list nodes free:251734803
MC time: 3m39.092sec

checking: AG [[EG [[[p79<=0 & 0<=p79] | [p3<=1 & 1<=p3]]] | [A [[[p124<=0 & 0<=p124] | [p30<=1 & 1<=p30]] U [[p132<=0 & 0<=p132] | [p124<=1 & 1<=p124]]] | EX [[p143<=0 & 0<=p143]]]]]
normalized: ~ [E [true U ~ [[[EX [[p143<=0 & 0<=p143]] | [~ [EG [~ [[[p124<=1 & 1<=p124] | [p132<=0 & 0<=p132]]]]] & ~ [E [~ [[[p124<=1 & 1<=p124] | [p132<=0 & 0<=p132]]] U [~ [[[p30<=1 & 1<=p30] | [p124<=0 & 0<=p124]]] & ~ [[[p124<=1 & 1<=p124] | [p132<=0 & 0<=p132]]]]]]]] | EG [[[p3<=1 & 1<=p3] | [p79<=0 & 0<=p79]]]]]]]

abstracting: (0<=p79)
states: 1,600,305,869,653 (12)
abstracting: (p79<=0)
states: 582,587,067,222 (11)
abstracting: (1<=p3)
states: 186,959,366,376 (11)
abstracting: (p3<=1)
states: 1,600,305,869,653 (12)
........
before gc: list nodes free: 1792904

after gc: idd nodes used:6959495, unused:57040505; list nodes free:259943574
..MC time: 3m19.537sec

checking: ~ [A [EX [[~ [AX [[[p93<=0 & 0<=p93] | [p61<=1 & 1<=p61]]]] | ~ [A [[p95<=0 & 0<=p95] U [p52<=0 & 0<=p52]]]]] U [[[p87<=0 & 0<=p87] | [p3<=1 & 1<=p3]] & EG [[[p107<=0 & 0<=p107] | [p13<=1 & 1<=p13]]]]]]
normalized: ~ [[~ [EG [~ [[EG [[[p13<=1 & 1<=p13] | [p107<=0 & 0<=p107]]] & [[p3<=1 & 1<=p3] | [p87<=0 & 0<=p87]]]]]] & ~ [E [~ [[EG [[[p13<=1 & 1<=p13] | [p107<=0 & 0<=p107]]] & [[p3<=1 & 1<=p3] | [p87<=0 & 0<=p87]]]] U [~ [[EG [[[p13<=1 & 1<=p13] | [p107<=0 & 0<=p107]]] & [[p3<=1 & 1<=p3] | [p87<=0 & 0<=p87]]]] & ~ [EX [[~ [[~ [EG [~ [[p52<=0 & 0<=p52]]]] & ~ [E [~ [[p52<=0 & 0<=p52]] U [~ [[p95<=0 & 0<=p95]] & ~ [[p52<=0 & 0<=p52]]]]]]] | EX [~ [[[p61<=1 & 1<=p61] | [p93<=0 & 0<=p93]]]]]]]]]]]]

abstracting: (0<=p93)
states: 1,600,305,869,653 (12)
abstracting: (p93<=0)
states: 1,012,857,873,225 (12)
abstracting: (1<=p61)
states: 333,708,066,216 (11)
abstracting: (p61<=1)
states: 1,600,305,869,653 (12)

before gc: list nodes free: 1625037

after gc: idd nodes used:4270783, unused:59729217; list nodes free:272116482
.abstracting: (0<=p52)
states: 1,600,305,869,653 (12)
abstracting: (p52<=0)
states: 1
abstracting: (0<=p95)
states: 1,600,305,869,653 (12)
abstracting: (p95<=0)
states: 1,012,857,873,225 (12)
abstracting: (0<=p52)
states: 1,600,305,869,653 (12)
abstracting: (p52<=0)
states: 1
abstracting: (0<=p52)
states: 1,600,305,869,653 (12)
abstracting: (p52<=0)
states: 1
.
EG iterations: 1
.abstracting: (0<=p87)
states: 1,600,305,869,653 (12)
abstracting: (p87<=0)
states: 1,012,857,873,225 (12)
abstracting: (1<=p3)
states: 186,959,366,376 (11)
abstracting: (p3<=1)
states: 1,600,305,869,653 (12)
abstracting: (0<=p107)
states: 1,600,305,869,653 (12)
abstracting: (p107<=0)
states: 1,012,857,873,225 (12)
abstracting: (1<=p13)
states: 217,410,166,516 (11)
abstracting: (p13<=1)
states: 1,600,305,869,653 (12)
......
before gc: list nodes free: 2483823

after gc: idd nodes used:6409666, unused:57590334; list nodes free:262408182
MC time: 3m 1.724sec

checking: A [[p141<=0 & 0<=p141] U [E [AF [[[[p151<=0 & 0<=p151] | [p42<=1 & 1<=p42]] & [p122<=1 & 1<=p122]]] U ~ [[EG [[p144<=1 & 1<=p144]] & [[p44<=0 & 0<=p44] | [p34<=1 & 1<=p34]]]]] & [EF [[p7<=1 & 1<=p7]] & [[p98<=0 & 0<=p98] | [p111<=1 & 1<=p111]]]]]
normalized: [~ [EG [~ [[[[[p111<=1 & 1<=p111] | [p98<=0 & 0<=p98]] & E [true U [p7<=1 & 1<=p7]]] & E [~ [EG [~ [[[p122<=1 & 1<=p122] & [[p42<=1 & 1<=p42] | [p151<=0 & 0<=p151]]]]]] U ~ [[[[p34<=1 & 1<=p34] | [p44<=0 & 0<=p44]] & EG [[p144<=1 & 1<=p144]]]]]]]]] & ~ [E [~ [[[[[p111<=1 & 1<=p111] | [p98<=0 & 0<=p98]] & E [true U [p7<=1 & 1<=p7]]] & E [~ [EG [~ [[[p122<=1 & 1<=p122] & [[p42<=1 & 1<=p42] | [p151<=0 & 0<=p151]]]]]] U ~ [[[[p34<=1 & 1<=p34] | [p44<=0 & 0<=p44]] & EG [[p144<=1 & 1<=p144]]]]]]] U [~ [[p141<=0 & 0<=p141]] & ~ [[[[[p111<=1 & 1<=p111] | [p98<=0 & 0<=p98]] & E [true U [p7<=1 & 1<=p7]]] & E [~ [EG [~ [[[p122<=1 & 1<=p122] & [[p42<=1 & 1<=p42] | [p151<=0 & 0<=p151]]]]]] U ~ [[[[p34<=1 & 1<=p34] | [p44<=0 & 0<=p44]] & EG [[p144<=1 & 1<=p144]]]]]]]]]]]

abstracting: (1<=p144)
states: 160,097,934,051 (11)
abstracting: (p144<=1)
states: 1,600,305,869,653 (12)
..........
before gc: list nodes free: 1725496

after gc: idd nodes used:6903464, unused:57096536; list nodes free:260240947
MC time: 2m45.634sec

checking: AG [[[0<=p115 & p115<=0] | [[E [EG [[[p137<=0 & 0<=p137] | [p37<=1 & 1<=p37]]] U EG [[[p39<=0 & 0<=p39] | [p125<=1 & 1<=p125]]]] & [[p106<=0 & 0<=p106] & [EX [[[p125<=0 & 0<=p125] | [1<=p128 & p128<=1]]] | [EG [[[p107<=0 & 0<=p107] | [p141<=1 & 1<=p141]]] | E [[[p56<=0 & 0<=p56] | [p149<=1 & 1<=p149]] U [p55<=1 & 1<=p55]]]]]] | [EX [0<=0] & [EG [[[p24<=0 & 0<=p24] | [p98<=1 & 1<=p98]]] & [[p112<=0 & 0<=p112] | [[p130<=1 & 1<=p130] | [EX [[[p55<=0 & 0<=p55] | [p113<=1 & 1<=p113]]] & [p89<=0 & 0<=p89]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[p89<=0 & 0<=p89] & EX [[[p113<=1 & 1<=p113] | [p55<=0 & 0<=p55]]]] | [p130<=1 & 1<=p130]] | [p112<=0 & 0<=p112]] & EG [[[p98<=1 & 1<=p98] | [p24<=0 & 0<=p24]]]] & EX [0<=0]] | [[[[E [[[p149<=1 & 1<=p149] | [p56<=0 & 0<=p56]] U [p55<=1 & 1<=p55]] | EG [[[p141<=1 & 1<=p141] | [p107<=0 & 0<=p107]]]] | EX [[[1<=p128 & p128<=1] | [p125<=0 & 0<=p125]]]] & [p106<=0 & 0<=p106]] & E [EG [[[p37<=1 & 1<=p37] | [p137<=0 & 0<=p137]]] U EG [[[p125<=1 & 1<=p125] | [p39<=0 & 0<=p39]]]]]] | [0<=p115 & p115<=0]]]]]

abstracting: (p115<=0)
states: 643,290,950,502 (11)
abstracting: (0<=p115)
states: 1,600,305,869,653 (12)
abstracting: (0<=p39)
states: 1,600,305,869,653 (12)
abstracting: (p39<=0)
states: 1,430,149,836,402 (12)
abstracting: (1<=p125)
states: 957,014,919,151 (11)
abstracting: (p125<=1)
states: 1,600,305,869,653 (12)
...
before gc: list nodes free: 1071661

after gc: idd nodes used:5651462, unused:58348538; list nodes free:265849344
......
before gc: list nodes free: 1435999

after gc: idd nodes used:6808434, unused:57191566; list nodes free:260624294
MC time: 2m35.720sec

checking: A [[A [[[p65<=0 & 0<=p65] | [p27<=1 & 1<=p27]] U [A [[[p147<=0 & 0<=p147] | [p19<=0 & 0<=p19]] U [[p5<=0 & 0<=p5] | [p78<=1 & 1<=p78]]] & EF [~ [[p22<=1 & 1<=p22]]]]] | [EX [EX [0<=0]] | A [EF [[[p68<=1 & 1<=p68] | [p140<=1 & 1<=p140]]] U AG [EX [[p28<=1 & 1<=p28]]]]]] U [~ [E [EG [EX [0<=0]] U ~ [[[p72<=0 & 0<=p72] | [p50<=1 & 1<=p50]]]]] & [[p150<=1 & 1<=p150] | [[EG [[[p66<=1 & 1<=p66] & [p109<=1 & 1<=p109]]] | [[p151<=0 & 0<=p151] | [p26<=1 & 1<=p26]]] & [~ [AF [[p68<=0 & 0<=p68]]] | [~ [[[p147<=0 & 0<=p147] | [p89<=0 & 0<=p89]]] | ~ [[[p41<=0 & 0<=p41] | [p139<=1 & 1<=p139]]]]]]]]]
normalized: [~ [EG [~ [[[[[[~ [[[p139<=1 & 1<=p139] | [p41<=0 & 0<=p41]]] | ~ [[[p89<=0 & 0<=p89] | [p147<=0 & 0<=p147]]]] | EG [~ [[p68<=0 & 0<=p68]]]] & [[[p26<=1 & 1<=p26] | [p151<=0 & 0<=p151]] | EG [[[p109<=1 & 1<=p109] & [p66<=1 & 1<=p66]]]]] | [p150<=1 & 1<=p150]] & ~ [E [EG [EX [0<=0]] U ~ [[[p50<=1 & 1<=p50] | [p72<=0 & 0<=p72]]]]]]]]] & ~ [E [~ [[[[[[~ [[[p139<=1 & 1<=p139] | [p41<=0 & 0<=p41]]] | ~ [[[p89<=0 & 0<=p89] | [p147<=0 & 0<=p147]]]] | EG [~ [[p68<=0 & 0<=p68]]]] & [[[p26<=1 & 1<=p26] | [p151<=0 & 0<=p151]] | EG [[[p109<=1 & 1<=p109] & [p66<=1 & 1<=p66]]]]] | [p150<=1 & 1<=p150]] & ~ [E [EG [EX [0<=0]] U ~ [[[p50<=1 & 1<=p50] | [p72<=0 & 0<=p72]]]]]]] U [~ [[[~ [EG [~ [[E [true U ~ [[p22<=1 & 1<=p22]]] & [~ [EG [~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]]]] & ~ [E [~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]] U [~ [[[p19<=0 & 0<=p19] | [p147<=0 & 0<=p147]]] & ~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]]]]]]]]]] & ~ [E [~ [[E [true U ~ [[p22<=1 & 1<=p22]]] & [~ [EG [~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]]]] & ~ [E [~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]] U [~ [[[p19<=0 & 0<=p19] | [p147<=0 & 0<=p147]]] & ~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]]]]]]]] U [~ [[[p27<=1 & 1<=p27] | [p65<=0 & 0<=p65]]] & ~ [[E [true U ~ [[p22<=1 & 1<=p22]]] & [~ [EG [~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]]]] & ~ [E [~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]] U [~ [[[p19<=0 & 0<=p19] | [p147<=0 & 0<=p147]]] & ~ [[[p78<=1 & 1<=p78] | [p5<=0 & 0<=p5]]]]]]]]]]]]] | [[~ [EG [E [true U ~ [EX [[p28<=1 & 1<=p28]]]]]] & ~ [E [E [true U ~ [EX [[p28<=1 & 1<=p28]]]] U [~ [E [true U [[p140<=1 & 1<=p140] | [p68<=1 & 1<=p68]]]] & E [true U ~ [EX [[p28<=1 & 1<=p28]]]]]]]] | EX [EX [0<=0]]]]] & ~ [[[[[[~ [[[p139<=1 & 1<=p139] | [p41<=0 & 0<=p41]]] | ~ [[[p89<=0 & 0<=p89] | [p147<=0 & 0<=p147]]]] | EG [~ [[p68<=0 & 0<=p68]]]] & [[[p26<=1 & 1<=p26] | [p151<=0 & 0<=p151]] | EG [[[p109<=1 & 1<=p109] & [p66<=1 & 1<=p66]]]]] | [p150<=1 & 1<=p150]] & ~ [E [EG [EX [0<=0]] U ~ [[[p50<=1 & 1<=p50] | [p72<=0 & 0<=p72]]]]]]]]]]]

abstracting: (0<=p72)
states: 1,600,305,869,653 (12)
abstracting: (p72<=0)
states: 535,819,177,074 (11)
abstracting: (1<=p50)
states: 1,004,681,690,023 (12)
abstracting: (p50<=1)
states: 1,600,305,869,653 (12)
abstracting: (0<=0)
states: 1,600,305,869,653 (12)
........
before gc: list nodes free: 2475239

after gc: idd nodes used:8637552, unused:55362448; list nodes free:252433118
MC time: 2m16.669sec

checking: E [[A [[~ [[[E [[[p45<=0 & 0<=p45] | [p66<=1 & 1<=p66]] U [[p36<=0 & 0<=p36] | [p65<=1 & 1<=p65]]] | [p39<=0 & 0<=p39]] | [[p87<=1 & 1<=p87] | [p106<=1 & 1<=p106]]]] | A [AX [[[p138<=0 & 0<=p138] | [p109<=1 & 1<=p109]]] U AX [[[p61<=0 & 0<=p61] | [p2<=1 & 1<=p2]]]]] U ~ [[p75<=1 & 1<=p75]]] | [[[p91<=1 & 1<=p91] & AG [[p141<=0 & 0<=p141]]] & [AG [[[p127<=0 & 0<=p127] | [p65<=1 & 1<=p65]]] & [AF [[p25<=0 & 0<=p25]] | [[p107<=1 & 1<=p107] | ~ [[[p33<=0 & 0<=p33] | [p49<=1 & 1<=p49]]]]]]]] U ~ [[A [[[p56<=0 & 0<=p56] & EF [[p27<=1 & 1<=p27]]] U [~ [[p93<=0 & 0<=p93]] | EG [[p59<=0 & 0<=p59]]]] | [[p127<=0 & 0<=p127] | [p131<=1 & 1<=p131]]]]]
normalized: E [[[[[[~ [[[p49<=1 & 1<=p49] | [p33<=0 & 0<=p33]]] | [p107<=1 & 1<=p107]] | ~ [EG [~ [[p25<=0 & 0<=p25]]]]] & ~ [E [true U ~ [[[p65<=1 & 1<=p65] | [p127<=0 & 0<=p127]]]]]] & [~ [E [true U ~ [[p141<=0 & 0<=p141]]]] & [p91<=1 & 1<=p91]]] | [~ [EG [[p75<=1 & 1<=p75]]] & ~ [E [[p75<=1 & 1<=p75] U [~ [[[~ [EG [EX [~ [[[p2<=1 & 1<=p2] | [p61<=0 & 0<=p61]]]]]] & ~ [E [EX [~ [[[p2<=1 & 1<=p2] | [p61<=0 & 0<=p61]]]] U [EX [~ [[[p109<=1 & 1<=p109] | [p138<=0 & 0<=p138]]]] & EX [~ [[[p2<=1 & 1<=p2] | [p61<=0 & 0<=p61]]]]]]]] | ~ [[[[p106<=1 & 1<=p106] | [p87<=1 & 1<=p87]] | [[p39<=0 & 0<=p39] | E [[[p66<=1 & 1<=p66] | [p45<=0 & 0<=p45]] U [[p65<=1 & 1<=p65] | [p36<=0 & 0<=p36]]]]]]]] & [p75<=1 & 1<=p75]]]]]] U ~ [[[[p131<=1 & 1<=p131] | [p127<=0 & 0<=p127]] | [~ [EG [~ [[EG [[p59<=0 & 0<=p59]] | ~ [[p93<=0 & 0<=p93]]]]]] & ~ [E [~ [[EG [[p59<=0 & 0<=p59]] | ~ [[p93<=0 & 0<=p93]]]] U [~ [[E [true U [p27<=1 & 1<=p27]] & [p56<=0 & 0<=p56]]] & ~ [[EG [[p59<=0 & 0<=p59]] | ~ [[p93<=0 & 0<=p93]]]]]]]]]]]

abstracting: (0<=p93)
states: 1,600,305,869,653 (12)
abstracting: (p93<=0)
states: 1,012,857,873,225 (12)
abstracting: (0<=p59)
states: 1,600,305,869,653 (12)
abstracting: (p59<=0)
states: 1,353,955,927,857 (12)
.
EG iterations: 1
abstracting: (0<=p56)
states: 1,600,305,869,653 (12)
abstracting: (p56<=0)
states: 1,194,810,907,207 (12)
abstracting: (1<=p27)
states: 177,524,273,840 (11)
abstracting: (p27<=1)
states: 1,600,305,869,653 (12)

before gc: list nodes free: 2386078

after gc: idd nodes used:7089436, unused:56910564; list nodes free:259346766
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6004900 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099972 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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


iterations count:83917 (856), effective:9566 (97)

initing FirstDep: 0m 0.000sec


iterations count:6788 (69), effective:666 (6)

net_ddint.h:600: Timeout: after 290 sec


iterations count:25762 (262), effective:2742 (27)

net_ddint.h:600: Timeout: after 265 sec


net_ddint.h:600: Timeout: after 263 sec


sat_reach.icc:155: Timeout: after 239 sec


iterations count:9297 (94), effective:965 (9)

iterations count:9297 (94), effective:965 (9)

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

iterations count:9297 (94), effective:965 (9)

net_ddint.h:600: Timeout: after 218 sec


net_ddint.h:600: Timeout: after 198 sec


iterations count:4631 (47), effective:377 (3)

net_ddint.h:600: Timeout: after 180 sec


net_ddint.h:600: Timeout: after 163 sec


net_ddint.h:600: Timeout: after 148 sec


net_ddint.h:600: Timeout: after 134 sec


sat_reach.icc:155: Timeout: after 121 sec

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-10a"
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-10a, 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-167814482700409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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