fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624189100345
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CryptoMiner-COL-D10N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
569.596 10471.00 21434.00 53.70 TT?F??????????F? normal

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.r480-tall-171624189100345.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 ltsminxred
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 r480-tall-171624189100345
=====================================================================

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

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-D10N100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:42:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:42:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:42:57] [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-31 20:42:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 20:42:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2024-05-31 20:42:57] [INFO ] Imported 3 HL places and 5 HL transitions for a total of 33 PT places and 55.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-31 20:42:58] [INFO ] Built PT skeleton of HLPN with 3 places and 5 transitions 14 arcs in 4 ms.
[2024-05-31 20:42:58] [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 40228 steps (772 resets) in 340 ms. (117 steps per ms) remains 14/58 properties
BEST_FIRST walk for 40004 steps (96 resets) in 1068 ms. (37 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (96 resets) in 421 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (100 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 101 ms. (392 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 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (96 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
[2024-05-31 20:42:59] [INFO ] Flow matrix only has 4 transitions (discarded 1 similar events)
// Phase 1: matrix 4 rows 3 cols
[2024-05-31 20:42:59] [INFO ] Computed 0 invariants in 5 ms
[2024-05-31 20:42:59] [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 220 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms 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-31 20:42:59] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:42:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CryptoMiner-COL-D10N100-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:42:59] [INFO ] Flatten gal took : 1 ms
Arc [0:1*[(MOD (ADD $x 1) 11)]] contains successor/predecessor on variables of sort CD
[2024-05-31 20:42:59] [INFO ] Unfolded HLPN to a Petri net with 33 places and 33 transitions 97 arcs in 13 ms.
[2024-05-31 20:42:59] [INFO ] Unfolded 14 HLPN properties in 1 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-31 20:42:59] [INFO ] Computed 1 invariants in 7 ms
[2024-05-31 20:42:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 20:42:59] [INFO ] Invariant cache hit.
[2024-05-31 20:42:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 20:42:59] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-31 20:42:59] [INFO ] Invariant cache hit.
[2024-05-31 20:42:59] [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 441 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 483 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 937ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 938ms
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 33/33 places, 33/33 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-31 20:43:00] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:43:00] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:43:00] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 40136 steps (8 resets) in 151 ms. (264 steps per ms) remains 12/47 properties
BEST_FIRST walk for 40004 steps (8 resets) in 458 ms. (87 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
[2024-05-31 20:43:01] [INFO ] Invariant cache hit.
[2024-05-31 20:43:01] [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 81 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 53 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 148ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 187 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 10 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 10 ms. Remains : 33/33 places, 32/33 transitions.
RANDOM walk for 40184 steps (11 resets) in 9 ms. (4018 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2401207 steps, run timeout after 3001 ms. (steps per millisecond=800 ) properties seen :0 out of 1
Probabilistic random walk after 2401207 steps, saw 947135 distinct states, run finished after 3004 ms. (steps per millisecond=799 ) properties seen :0
// Phase 1: matrix 32 rows 33 cols
[2024-05-31 20:43:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:43:04] [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 54 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 56 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 115ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 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 2 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 2 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 1 ms. Remains 33 /33 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-31 20:43:04] [INFO ] Invariant cache hit.
[2024-05-31 20:43:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 20:43:04] [INFO ] Invariant cache hit.
[2024-05-31 20:43:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 20:43:04] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-31 20:43:04] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2024-05-31 20:43:04] [INFO ] Invariant cache hit.
[2024-05-31 20:43:04] [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 296 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 257 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 558ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 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.1 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 6 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-31 20:43:05] [INFO ] Computed 1 invariants in 4 ms
[2024-05-31 20:43:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:05] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:43:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:05] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:43:05] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:43:05] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 115 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:43:05] [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.1 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-31 20:43:05] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 20372 steps (5 resets) in 7 ms. (2546 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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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.1 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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Input system was already deterministic with 33 transitions.
RANDOM walk for 10337 steps (2 resets) in 6 ms. (1476 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 0 ms. Remains : 33/33 places, 33/33 transitions.
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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-31 20:43:05] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:43:05] [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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:43:05] [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 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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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 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-31 20:43:05] [INFO ] Flatten gal took : 1 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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 2 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 9 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 9 ms. Remains : 23/33 places, 23/33 transitions.
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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 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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [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-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Input system was already deterministic with 33 transitions.
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:43:05] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:43:05] [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 8695 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-02
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-04
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-05
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-06
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-07
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-08
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-09
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-10
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-11
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-12
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-13
Could not compute solution for formula : CryptoMiner-COL-D10N100-CTLCardinality-2024-15

BK_STOP 1717188186277

--------------------
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.202405141337.jar
+ 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
mcc2024
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/548/ctl_0_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/548/ctl_1_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/548/ctl_2_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/548/ctl_3_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/548/ctl_4_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/548/ctl_5_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/548/ctl_6_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/548/ctl_7_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/548/ctl_8_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/548/ctl_9_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/548/ctl_10_
ctl formula name CryptoMiner-COL-D10N100-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/548/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="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-5568"
echo " Executing tool ltsminxred"
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 r480-tall-171624189100345"
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 ;