Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187500345.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CryptoMiner-COL-D10N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187500345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.3K Apr 12 12:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 12:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 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-D10N100-CTLCardinality-2024-00
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-01
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-02
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-03
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-04
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-05
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-06
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-07
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-08
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-09
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-10
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-11
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-12
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-13
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-14
FORMULA_NAME CryptoMiner-COL-D10N100-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716280686150

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-COL-D10N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:38:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:38:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:38:07] [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.
[2024-05-21 08:38:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:38:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2024-05-21 08:38:08] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 33 PT places and 55.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2024-05-21 08:38:08] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-21 08:38:08] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 3 stabilizing places and 3 stable transitions
RANDOM walk for 40147 steps (780 resets) in 350 ms. (114 steps per ms) remains 14/58 properties
BEST_FIRST walk for 40004 steps (96 resets) in 1152 ms. (34 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (96 resets) in 630 ms. (63 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 328 ms. (121 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 346 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
[2024-05-21 08:38:09] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-21 08:38:09] [INFO ] Computed 0 invariants in 5 ms
[2024-05-21 08:38:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
After SMT solving in domain Real declared 6/7 variables, and 3 constraints, problems are : Problem set: 12 solved, 0 unsolved in 237 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:38:09] [INFO ] Flatten gal took : 13 ms
[2024-05-21 08:38:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:38:09] [INFO ] Flatten gal took : 2 ms
Arc [0:1*[(MOD (ADD $x 1) 11)]] contains successor/predecessor on variables of sort CD
[2024-05-21 08:38:09] [INFO ] Unfolded HLPN to a Petri net with 33 places and 33 transitions 97 arcs in 11 ms.
[2024-05-21 08:38:09] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 33 cols
[2024-05-21 08:38:09] [INFO ] Computed 1 invariants in 4 ms
[2024-05-21 08:38:09] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 08:38:09] [INFO ] Invariant cache hit.
[2024-05-21 08:38:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 08:38:09] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-21 08:38:09] [INFO ] Invariant cache hit.
[2024-05-21 08:38:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/66 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/66 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 918ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 919ms
Finished structural reductions in LTL mode , in 1 iterations and 1035 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-21 08:38:10] [INFO ] Flatten gal took : 6 ms
[2024-05-21 08:38:10] [INFO ] Flatten gal took : 11 ms
[2024-05-21 08:38:10] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 40160 steps (10 resets) in 204 ms. (195 steps per ms) remains 12/47 properties
BEST_FIRST walk for 40004 steps (8 resets) in 863 ms. (46 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
[2024-05-21 08:38:11] [INFO ] Invariant cache hit.
[2024-05-21 08:38:11] [INFO ] State equation strengthened by 10 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 2 (OVERLAPS) 33/66 variables, 33/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 10/44 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/44 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/66 variables, 0/44 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 44 constraints, problems are : Problem set: 9 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 22/44 variables, 22/23 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/54 variables, 10/33 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/66 variables, 11/44 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/45 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/45 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/45 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 45 constraints, problems are : Problem set: 9 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 33/33 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 32
Applied a total of 1 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 32/33 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 33/33 places, 32/33 transitions.
RANDOM walk for 40149 steps (10 resets) in 7 ms. (5018 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2891028 steps, run timeout after 3001 ms. (steps per millisecond=963 ) properties seen :0 out of 1
Probabilistic random walk after 2891028 steps, saw 1132207 distinct states, run finished after 3004 ms. (steps per millisecond=962 ) properties seen :0
// Phase 1: matrix 32 rows 33 cols
[2024-05-21 08:38:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 08:38:14] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 22/44 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/54 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/65 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 45 constraints, problems are : Problem set: 0 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 22/44 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/54 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/65 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 1 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 22 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 33/33 places, 32/32 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-21 08:38:15] [INFO ] Invariant cache hit.
[2024-05-21 08:38:15] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-21 08:38:15] [INFO ] Invariant cache hit.
[2024-05-21 08:38:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-21 08:38:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-21 08:38:15] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-21 08:38:15] [INFO ] Invariant cache hit.
[2024-05-21 08:38:15] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 3/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 32/65 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 45 constraints, problems are : Problem set: 0 solved, 29 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 3/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 32/65 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 29/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 74 constraints, problems are : Problem set: 0 solved, 29 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 33/33 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 33/33 places, 32/32 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 42 edges and 33 vertex of which 22 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Applied a total of 1 rules in 5 ms. Remains 22 /33 variables (removed 11) and now considering 22/32 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 22 cols
[2024-05-21 08:38:15] [INFO ] Computed 1 invariants in 1 ms
[2024-05-21 08:38:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 08:38:15] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 08:38:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 08:38:15] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 08:38:15] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 08:38:15] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 96 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Graph (complete) has 85 edges and 33 vertex of which 12 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 7094 steps (2 resets) in 4 ms. (1418 steps per ms) remains 0/1 properties
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 32/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 10345 steps (2 resets) in 8 ms. (1149 steps per ms) remains 0/1 properties
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (complete) has 85 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 32/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 33
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 32/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:15] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:15] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Graph (trivial) has 21 edges and 33 vertex of which 11 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Applied a total of 1 rules in 8 ms. Remains 23 /33 variables (removed 10) and now considering 23/33 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 23/33 places, 23/33 transitions.
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 1 ms
[2024-05-21 08:38:16] [INFO ] Input system was already deterministic with 33 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Flatten gal took : 2 ms
[2024-05-21 08:38:16] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-21 08:38:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 33 transitions and 97 arcs took 2 ms.
Total runtime 8797 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CryptoMiner-COL-D10N100

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/404/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 33
TRANSITIONS: 33
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


SAVING FILE /home/mcc/execution/404/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 570
MODEL NAME: /home/mcc/execution/404/model
33 places, 33 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716281920364

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-D10N100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is CryptoMiner-COL-D10N100, 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 r091-tall-171624187500345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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