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.r521-tall-167987246200089.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 ltsminxred
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 r521-tall-167987246200089
=====================================================================

--------------------
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 1680874991789

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D03N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 13:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 13:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 13:43:13] [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 13:43:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 13:43:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 429 ms
[2023-04-07 13:43:14] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 12 PT places and 20.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
[2023-04-07 13:43:14] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 3 ms.
[2023-04-07 13:43:14] [INFO ] Skeletonized 16 HLPN properties in 2 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 10017 steps, including 211 resets, run finished after 71 ms. (steps per millisecond=141 ) properties (out of 63) seen :44
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 66 ms. (steps per millisecond=15 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 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 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) 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 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 3 ms. (steps per millisecond=333 ) 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
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-04-07 13:43:14] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 13:43:14] [INFO ] Computed 0 invariants in 4 ms
[2023-04-07 13:43:14] [INFO ] After 224ms 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 13:43:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 13:43:14] [INFO ] Flatten gal took : 16 ms
[2023-04-07 13:43:14] [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 13:43:14] [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 13:43:14] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 34 arcs in 5 ms.
[2023-04-07 13:43:14] [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 4 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 13:43:14] [INFO ] Computed 1 invariants in 2 ms
[2023-04-07 13:43:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 13:43:14] [INFO ] Invariant cache hit.
[2023-04-07 13:43:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:43:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 13:43:14] [INFO ] Invariant cache hit.
[2023-04-07 13:43:14] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 13:43:15] [INFO ] Flatten gal took : 3 ms
[2023-04-07 13:43:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 13:43:15] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) 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 38) 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 38) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-04-07 13:43:15] [INFO ] Invariant cache hit.
[2023-04-07 13:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 13:43:15] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:18
[2023-04-07 13:43:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 13:43:15] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :7
[2023-04-07 13:43:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:43:15] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :14 sat :7
[2023-04-07 13:43:15] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :7
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 13:43:15] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :7
Fused 21 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 12/12 places, 12/12 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2504 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 13:43:15] [INFO ] Invariant cache hit.
[2023-04-07 13:43:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 13:43:15] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 13:43:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 13:43:15] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 13:43:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:43:15] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 13:43:15] [INFO ] After 6ms 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 13:43:15] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 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 1 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 1 ms. Remains : 12/12 places, 11/12 transitions.
Incomplete random walk after 10014 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=3338 ) 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 4655113 steps, run timeout after 3001 ms. (steps per millisecond=1551 ) properties seen :{}
Probabilistic random walk after 4655113 steps, saw 963664 distinct states, run finished after 3002 ms. (steps per millisecond=1550 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 12 cols
[2023-04-07 13:43:18] [INFO ] Computed 2 invariants in 1 ms
[2023-04-07 13:43:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 13:43:18] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 13:43:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 13:43:18] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 13:43:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:43:18] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 13:43:18] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 13:43:18] [INFO ] After 35ms 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 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-04-07 13:43:18] [INFO ] Invariant cache hit.
[2023-04-07 13:43:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-04-07 13:43:18] [INFO ] Invariant cache hit.
[2023-04-07 13:43:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 13:43:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-04-07 13:43:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 13:43:19] [INFO ] Invariant cache hit.
[2023-04-07 13:43:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 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.0 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 1 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 13:43:19] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 13:43:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 13:43:19] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 13:43:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-07 13:43:19] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 13:43:19] [INFO ] After 8ms 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 13:43:19] [INFO ] After 71ms 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 13:43:19] [INFO ] Flatten gal took : 3 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 6 ms
[2023-04-07 13:43:19] [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 0 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 15 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 0 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 0 ms
[2023-04-07 13:43:19] [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 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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [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 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 1 ms
[2023-04-07 13:43:19] [INFO ] Flatten gal took : 2 ms
[2023-04-07 13:43:19] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 13:43:19] [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 5816 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/501/ctl_0_ --ctl=/tmp/501/ctl_1_ --ctl=/tmp/501/ctl_2_ --ctl=/tmp/501/ctl_3_ --ctl=/tmp/501/ctl_4_ --ctl=/tmp/501/ctl_5_ --ctl=/tmp/501/ctl_6_ --ctl=/tmp/501/ctl_7_ --ctl=/tmp/501/ctl_8_ --ctl=/tmp/501/ctl_9_ --ctl=/tmp/501/ctl_10_ --ctl=/tmp/501/ctl_11_ --ctl=/tmp/501/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 303356 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103568 kB
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-00
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-01
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-02
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-03
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-05
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-06
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-07
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-08
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-09
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-10
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-11
Could not compute solution for formula : CryptoMiner-COL-D03N100-CTLCardinality-13
FORMULA CryptoMiner-COL-D03N100-CTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680878571674

--------------------
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
mcc2023
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-00
ctl formula formula --ctl=/tmp/501/ctl_0_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-01
ctl formula formula --ctl=/tmp/501/ctl_1_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-02
ctl formula formula --ctl=/tmp/501/ctl_2_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-03
ctl formula formula --ctl=/tmp/501/ctl_3_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-05
ctl formula formula --ctl=/tmp/501/ctl_4_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-06
ctl formula formula --ctl=/tmp/501/ctl_5_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-07
ctl formula formula --ctl=/tmp/501/ctl_6_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-08
ctl formula formula --ctl=/tmp/501/ctl_7_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-09
ctl formula formula --ctl=/tmp/501/ctl_8_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-10
ctl formula formula --ctl=/tmp/501/ctl_9_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-11
ctl formula formula --ctl=/tmp/501/ctl_10_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-13
ctl formula formula --ctl=/tmp/501/ctl_11_
ctl formula name CryptoMiner-COL-D03N100-CTLCardinality-14
ctl formula formula --ctl=/tmp/501/ctl_12_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 12 places, 12 transitions and 34 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 12->11 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 12; there are 11 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 9763 group checks and 0 next state calls
pnml2lts-sym: reachability took 4.340 real 17.020 user 0.340 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 3004907847 states, 47302 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/501/ctl_12_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 507
Killing (9) : 507

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="ltsminxred"
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 ltsminxred"
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 r521-tall-167987246200089"
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 ;