Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987246900089.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 CryptoMiner-COL-D03N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987246900089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 13K Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1680861543807

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=CryptoMiner-COL-D03N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 09:59:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 09:59:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 09:59:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-07 09:59:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 09:59:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 405 ms
[2023-04-07 09:59:05] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2023-04-07 09:59:05] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 6 ms.
[2023-04-07 09:59:05] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-COL-D03N100-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
Incomplete random walk after 10012 steps, including 207 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 63) seen :43
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-04-07 09:59:06] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 09:59:06] [INFO ] Computed 0 invariants in 5 ms
[2023-04-07 09:59:06] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :19 sat :0
Fused 19 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 19 atomic propositions for a total of 15 simplifications.
[2023-04-07 09:59:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 09:59:06] [INFO ] Flatten gal took : 14 ms
[2023-04-07 09:59:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CryptoMiner-COL-D03N100-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-COL-D03N100-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 09:59:06] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-04-07 09:59:06] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 5 ms.
[2023-04-07 09:59:06] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 09:59:06] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 09:59:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-04-07 09:59:06] [INFO ] Invariant cache hit.
[2023-04-07 09:59:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 09:59:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-04-07 09:59:06] [INFO ] Invariant cache hit.
[2023-04-07 09:59:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 09:59:06] [INFO ] Flatten gal took : 2 ms
[2023-04-07 09:59:06] [INFO ] Flatten gal took : 3 ms
[2023-04-07 09:59:06] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10033 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=771 ) properties (out of 51) seen :36
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-04-07 09:59:06] [INFO ] Invariant cache hit.
[2023-04-07 09:59:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 09:59:06] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:12
[2023-04-07 09:59:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 09:59:07] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :1
[2023-04-07 09:59:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 09:59:07] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :14 sat :1
[2023-04-07 09:59:07] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 09:59:07] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :1
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 11
Applied a total of 1 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 11/12 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 12/12 places, 11/12 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2502 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3840265 steps, run timeout after 3006 ms. (steps per millisecond=1277 ) properties seen :{}
Probabilistic random walk after 3840265 steps, saw 803217 distinct states, run finished after 3008 ms. (steps per millisecond=1276 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 12 cols
[2023-04-07 09:59:10] [INFO ] Computed 2 invariants in 5 ms
[2023-04-07 09:59:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 09:59:10] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:59:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 09:59:10] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:59:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 09:59:10] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 09:59:10] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 09:59:10] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 11/11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-04-07 09:59:10] [INFO ] Invariant cache hit.
[2023-04-07 09:59:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-07 09:59:10] [INFO ] Invariant cache hit.
[2023-04-07 09:59:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 09:59:10] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-07 09:59:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 09:59:10] [INFO ] Invariant cache hit.
[2023-04-07 09:59:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 12/12 places, 11/11 transitions.
Graph (complete) has 14 edges and 12 vertex of which 8 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 8/11 (removed 3) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-04-07 09:59:10] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 09:59:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 09:59:10] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:59:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 09:59:10] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:59:10] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-07 09:59:10] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 3 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 2 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 0 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 3 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 9/12 places, 9/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 0 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 0 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 0 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (trivial) has 7 edges and 12 vertex of which 4 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 9/12 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 9/12 places, 9/12 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 0 ms
[2023-04-07 09:59:10] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Flatten gal took : 1 ms
[2023-04-07 09:59:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-04-07 09:59:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 34 arcs took 0 ms.
Total runtime 5178 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: 12 NrTr: 12 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.724sec


RS generation: 0m 0.122sec


-> reachability set: #nodes 1119 (1.1e+03) #states 3,004,907,847 (9)



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

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

abstracting: (0<=0)
states: 3,004,907,847 (9)
.-> the formula is TRUE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.066sec

checking: AX [EG [EX [AG [~ [sum(p3, p2, p1, p0)<=89]]]]]
normalized: ~ [EX [~ [EG [EX [~ [E [true U sum(p3, p2, p1, p0)<=89]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=89)
states: 2,961,983,756 (9)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.970sec

checking: EX [2<=sum(p3, p2, p1, p0)]
normalized: EX [2<=sum(p3, p2, p1, p0)]

abstracting: (2<=sum(p3, p2, p1, p0))
states: 3,004,824,741 (9)
.-> the formula is TRUE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.652sec

checking: AG [EF [5<=sum(p11, p10, p9, p8)]]
normalized: ~ [E [true U ~ [E [true U 5<=sum(p11, p10, p9, p8)]]]]

abstracting: (5<=sum(p11, p10, p9, p8))
states: 2,977,087,032 (9)
-> the formula is FALSE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.615sec

checking: AF [AG [sum(p11, p10, p9, p8)<=16]]
normalized: ~ [EG [E [true U ~ [sum(p11, p10, p9, p8)<=16]]]]

abstracting: (sum(p11, p10, p9, p8)<=16)
states: 690,390,383 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.682sec

checking: EX [EF [[sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8) | 59<=sum(p7, p6, p5, p4)]]]
normalized: EX [E [true U [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8) | 59<=sum(p7, p6, p5, p4)]]]

abstracting: (59<=sum(p7, p6, p5, p4))
states: 0
abstracting: (sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8))
MC time: 7m27.016sec

checking: E [sum(p11, p10, p9, p8)<=66 U ~ [[7<=sum(p11, p10, p9, p8) | EF [sum(p3, p2, p1, p0)<=55]]]]
normalized: E [sum(p11, p10, p9, p8)<=66 U ~ [[E [true U sum(p3, p2, p1, p0)<=55] | 7<=sum(p11, p10, p9, p8)]]]

abstracting: (7<=sum(p11, p10, p9, p8))
states: 2,936,876,359 (9)
abstracting: (sum(p3, p2, p1, p0)<=55)
states: 1,687,986,047 (9)
abstracting: (sum(p11, p10, p9, p8)<=66)
states: 2,994,466,982 (9)
-> the formula is TRUE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.864sec

checking: AX [EF [EG [[EX [sum(p3, p2, p1, p0)<=71] | [AG [67<=sum(p11, p10, p9, p8)] & sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]]]
normalized: ~ [EX [~ [E [true U EG [[[sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & ~ [E [true U ~ [67<=sum(p11, p10, p9, p8)]]]] | EX [sum(p3, p2, p1, p0)<=71]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=71)
states: 2,525,051,450 (9)
.abstracting: (67<=sum(p11, p10, p9, p8))
states: 10,440,865 (7)
abstracting: (sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
states: 3,004,898,874 (9)
....
EG iterations: 4
.-> the formula is FALSE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m44.419sec

checking: AG [[AF [[EX [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)] & sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]] | 14<=sum(p3, p2, p1, p0)]]
normalized: ~ [E [true U ~ [[14<=sum(p3, p2, p1, p0) | ~ [EG [~ [[sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0) & EX [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)]]]]]]]]]

abstracting: (sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8))
states: 3,004,200,443 (9)
.abstracting: (sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
states: 3,004,898,874 (9)
.
EG iterations: 1
abstracting: (14<=sum(p3, p2, p1, p0))
states: 2,975,076,884 (9)
-> the formula is FALSE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m43.385sec

checking: [AX [EF [16<=sum(p11, p10, p9, p8)]] & EF [[EF [sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)] | ~ [E [sum(p11, p10, p9, p8)<=76 U sum(p11, p10, p9, p8)<=38]]]]]
normalized: [E [true U [E [true U sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)] | ~ [E [sum(p11, p10, p9, p8)<=76 U sum(p11, p10, p9, p8)<=38]]]] & ~ [EX [~ [E [true U 16<=sum(p11, p10, p9, p8)]]]]]

abstracting: (16<=sum(p11, p10, p9, p8))
states: 2,406,765,907 (9)
.abstracting: (sum(p11, p10, p9, p8)<=38)
states: 2,566,535,087 (9)
abstracting: (sum(p11, p10, p9, p8)<=76)
states: 3,003,558,377 (9)
abstracting: (sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0))
MC time: 9m 5.003sec

checking: E [E [~ [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)] U [~ [EX [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]] | sum(p3, p2, p1, p0)<=94]] U sum(p3, p2, p1, p0)<=30]
normalized: E [E [~ [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)] U [sum(p3, p2, p1, p0)<=94 | ~ [EX [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]] U sum(p3, p2, p1, p0)<=30]

abstracting: (sum(p3, p2, p1, p0)<=30)
states: 372,477,901 (8)
abstracting: (sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
states: 3,004,898,874 (9)
.abstracting: (sum(p3, p2, p1, p0)<=94)
states: 2,993,707,544 (9)
abstracting: (sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8))
MC time: 7m16.000sec

checking: AX [[AX [AF [sum(p3, p2, p1, p0)<=43]] | [EX [0<=0] & [EG [[~ [sum(p11, p10, p9, p8)<=73] | ~ [sum(p11, p10, p9, p8)<=8]]] | EF [[75<=sum(p7, p6, p5, p4) | [sum(p3, p2, p1, p0)<=36 | sum(p3, p2, p1, p0)<=31]]]]]]]
normalized: ~ [EX [~ [[[[EG [[~ [sum(p11, p10, p9, p8)<=8] | ~ [sum(p11, p10, p9, p8)<=73]]] | E [true U [75<=sum(p7, p6, p5, p4) | [sum(p3, p2, p1, p0)<=36 | sum(p3, p2, p1, p0)<=31]]]] & EX [0<=0]] | ~ [EX [EG [~ [sum(p3, p2, p1, p0)<=43]]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=43)
states: 977,259,914 (8)
.
EG iterations: 1
.abstracting: (0<=0)
states: 3,004,907,847 (9)
.abstracting: (sum(p3, p2, p1, p0)<=31)
states: 408,884,557 (8)
abstracting: (sum(p3, p2, p1, p0)<=36)
states: 618,286,285 (8)
abstracting: (75<=sum(p7, p6, p5, p4))
states: 0
abstracting: (sum(p11, p10, p9, p8)<=73)
states: 3,002,243,617 (9)
abstracting: (sum(p11, p10, p9, p8)<=8)
states: 134,308,311 (8)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA CryptoMiner-COL-D03N100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.276sec

checking: [EF [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)] & EX [[[[[AG [~ [sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]] | [~ [sum(p11, p10, p9, p8)<=40] | ~ [sum(p11, p10, p9, p8)<=83]]] & AX [~ [sum(p3, p2, p1, p0)<=5]]] | E [[AF [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)] | 73<=sum(p3, p2, p1, p0)] U A [17<=sum(p11, p10, p9, p8) U sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)]]] & [~ [A [[sum(p3, p2, p1, p0)<=99 & sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)] U sum(p11, p10, p9, p8)<=20]] | [~ [sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)] | EF [~ [sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]]]]]]]
normalized: [EX [[[[E [true U ~ [sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]] | ~ [sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)]] | ~ [[~ [EG [~ [sum(p11, p10, p9, p8)<=20]]] & ~ [E [~ [sum(p11, p10, p9, p8)<=20] U [~ [[sum(p3, p2, p1, p0)<=99 & sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)]] & ~ [sum(p11, p10, p9, p8)<=20]]]]]]] & [E [[73<=sum(p3, p2, p1, p0) | ~ [EG [~ [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)]]]] U [~ [EG [~ [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)]]] & ~ [E [~ [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)] U [~ [17<=sum(p11, p10, p9, p8)] & ~ [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)]]]]]] | [~ [EX [sum(p3, p2, p1, p0)<=5]] & [[~ [sum(p11, p10, p9, p8)<=83] | ~ [sum(p11, p10, p9, p8)<=40]] | ~ [E [true U sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]]]]]]] & E [true U sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)]]

abstracting: (sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4))
states: 51,894 (4)
abstracting: (sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4))
states: 2,551,254 (6)
abstracting: (sum(p11, p10, p9, p8)<=40)
states: 2,649,001,639 (9)
abstracting: (sum(p11, p10, p9, p8)<=83)
states: 3,004,709,050 (9)
abstracting: (sum(p3, p2, p1, p0)<=5)
states: 1,911,367 (6)
.abstracting: (sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10601672 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104184 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:2088 (174), effective:512 (42)

initing FirstDep: 0m 0.000sec


iterations count:459 (38), effective:148 (12)

iterations count:67 (5), effective:20 (1)

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

iterations count:199 (16), effective:68 (5)

idd.h:1025: Timeout: after 446 sec


iterations count:3398 (283), effective:1164 (97)

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

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

iterations count:1662 (138), effective:564 (47)

iterations count:13236 (1103), effective:4658 (388)

iterations count:188 (15), effective:64 (5)

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

idd.h:1025: Timeout: after 544 sec


idd.h:1025: Timeout: after 435 sec


iterations count:6099 (508), effective:2117 (176)

iterations count:13119 (1093), effective:4618 (384)

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

idd.h:1025: Timeout: after 425 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="CryptoMiner-COL-D03N100"
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 CryptoMiner-COL-D03N100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987246900089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-COL-D03N100.tgz
mv CryptoMiner-COL-D03N100 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 ;