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-167987246400210.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-PT-D20N100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 24K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 28K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 27K 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-PT-D20N100-CTLFireability-00
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-01
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-02
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-03
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-04
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-05
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-06
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-07
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-08
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-09
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-10
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-11
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-12
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-13
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-14
FORMULA_NAME CryptoMiner-PT-D20N100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680891620122

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D20N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 18:20:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 18:20:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:20:25] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-04-07 18:20:25] [INFO ] Transformed 63 places.
[2023-04-07 18:20:25] [INFO ] Transformed 63 transitions.
[2023-04-07 18:20:25] [INFO ] Parsed PT model containing 63 places and 63 transitions and 187 arcs in 534 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 62 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 63/63 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 63
Applied a total of 1 rules in 46 ms. Remains 62 /63 variables (removed 1) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 62 cols
[2023-04-07 18:20:25] [INFO ] Computed 0 invariants in 21 ms
[2023-04-07 18:20:25] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-04-07 18:20:25] [INFO ] Invariant cache hit.
[2023-04-07 18:20:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:20:26] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2023-04-07 18:20:26] [INFO ] Invariant cache hit.
[2023-04-07 18:20:26] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 63/63 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1024 ms. Remains : 62/63 places, 63/63 transitions.
Support contains 62 out of 62 places after structural reductions.
[2023-04-07 18:20:26] [INFO ] Flatten gal took : 56 ms
[2023-04-07 18:20:26] [INFO ] Flatten gal took : 24 ms
[2023-04-07 18:20:27] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=92 ) properties (out of 52) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 64 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 67 ms. (steps per millisecond=14 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-04-07 18:20:27] [INFO ] Invariant cache hit.
[2023-04-07 18:20:28] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:14
[2023-04-07 18:20:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:20:28] [INFO ] After 5ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :1 sat :1 real:14
[2023-04-07 18:20:28] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:14
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 18:20:28] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:14
[2023-04-07 18:20:28] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :15
[2023-04-07 18:20:29] [INFO ] After 129ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :1 sat :15
[2023-04-07 18:20:29] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :15
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-04-07 18:20:29] [INFO ] After 1379ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :15
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 5 properties in 256 ms.
Support contains 37 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 29 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 62/62 places, 63/63 transitions.
Incomplete random walk after 10096 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2524 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-07 18:20:30] [INFO ] Invariant cache hit.
[2023-04-07 18:20:30] [INFO ] After 239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2023-04-07 18:20:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:20:30] [INFO ] After 307ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :2 real:6
[2023-04-07 18:20:31] [INFO ] After 383ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:20:31] [INFO ] After 951ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 18:20:31] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 18:20:31] [INFO ] After 33ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 18:20:31] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 18:20:31] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 729 ms.
Support contains 24 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 63/63 transitions.
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 55
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 54 transition count 55
Applied a total of 16 rules in 7 ms. Remains 54 /62 variables (removed 8) and now considering 55/63 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 54/62 places, 55/63 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=774 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 55 rows 54 cols
[2023-04-07 18:20:32] [INFO ] Computed 0 invariants in 1 ms
[2023-04-07 18:20:32] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-04-07 18:20:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:20:32] [INFO ] After 32ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :3 real:3
[2023-04-07 18:20:32] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 18:20:32] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-04-07 18:20:32] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:20:32] [INFO ] After 17ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:20:32] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-04-07 18:20:32] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 40 ms.
Support contains 18 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 55/55 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 52
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 51 transition count 52
Applied a total of 6 rules in 30 ms. Remains 51 /54 variables (removed 3) and now considering 52/55 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 51/54 places, 52/55 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1006 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 364826 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 364826 steps, saw 185676 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 51 cols
[2023-04-07 18:20:36] [INFO ] Computed 0 invariants in 9 ms
[2023-04-07 18:20:36] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-04-07 18:20:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:20:36] [INFO ] After 24ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :3 real:3
[2023-04-07 18:20:36] [INFO ] After 71ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 18:20:36] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-04-07 18:20:36] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:20:36] [INFO ] After 49ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:20:36] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 18:20:36] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 4 ms.
Support contains 18 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 52/52 transitions.
Applied a total of 0 rules in 11 ms. Remains 51 /51 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 51/51 places, 52/52 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 52/52 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-04-07 18:20:36] [INFO ] Invariant cache hit.
[2023-04-07 18:20:36] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-04-07 18:20:36] [INFO ] Invariant cache hit.
[2023-04-07 18:20:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-07 18:20:36] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-04-07 18:20:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 18:20:36] [INFO ] Invariant cache hit.
[2023-04-07 18:20:39] [INFO ] Dead Transitions using invariants and state equation in 2166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2462 ms. Remains : 51/51 places, 52/52 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 51 transition count 45
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 10 rules applied. Total rules applied 17 place count 44 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 41 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 41 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 40 transition count 41
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 40 transition count 34
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 36 place count 33 transition count 34
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 40 place count 33 transition count 30
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 44 place count 29 transition count 30
Applied a total of 44 rules in 24 ms. Remains 29 /51 variables (removed 22) and now considering 30/52 (removed 22) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 30 rows 29 cols
[2023-04-07 18:20:39] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 18:20:39] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 18:20:39] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 18:20:39] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 18:20:39] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 16 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 19 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Graph (complete) has 162 edges and 62 vertex of which 22 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 21 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 8 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 11 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 42/62 places, 43/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 7 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 17 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 18 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 19 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 16 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 7 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Graph (trivial) has 37 edges and 62 vertex of which 21 / 62 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Applied a total of 1 rules in 2 ms. Remains 42 /62 variables (removed 20) and now considering 43/63 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 42/62 places, 43/63 transitions.
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:20:39] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:39] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 11 ms
[2023-04-07 18:20:40] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 62/62 places, 63/63 transitions.
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:20:40] [INFO ] Input system was already deterministic with 63 transitions.
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:20:40] [INFO ] Flatten gal took : 47 ms
[2023-04-07 18:20:40] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 23 ms.
[2023-04-07 18:20:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 63 transitions and 186 arcs took 0 ms.
Total runtime 15980 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/518/ctl_0_ --ctl=/tmp/518/ctl_1_ --ctl=/tmp/518/ctl_2_ --ctl=/tmp/518/ctl_3_ --ctl=/tmp/518/ctl_4_ --ctl=/tmp/518/ctl_5_ --ctl=/tmp/518/ctl_6_ --ctl=/tmp/518/ctl_7_ --ctl=/tmp/518/ctl_8_ --ctl=/tmp/518/ctl_9_ --ctl=/tmp/518/ctl_10_ --ctl=/tmp/518/ctl_11_ --ctl=/tmp/518/ctl_12_ --ctl=/tmp/518/ctl_13_ --ctl=/tmp/518/ctl_14_ --ctl=/tmp/518/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 215944 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101828 kB
FORMULA CryptoMiner-PT-D20N100-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CryptoMiner-PT-D20N100-CTLFireability-04
FORMULA CryptoMiner-PT-D20N100-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA CryptoMiner-PT-D20N100-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : CryptoMiner-PT-D20N100-CTLFireability-12
Could not compute solution for formula : CryptoMiner-PT-D20N100-CTLFireability-13
Could not compute solution for formula : CryptoMiner-PT-D20N100-CTLFireability-14
FORMULA CryptoMiner-PT-D20N100-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680895213142

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-00
ctl formula formula --ctl=/tmp/518/ctl_0_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-01
ctl formula formula --ctl=/tmp/518/ctl_1_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-02
ctl formula formula --ctl=/tmp/518/ctl_2_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-03
ctl formula formula --ctl=/tmp/518/ctl_3_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-04
ctl formula formula --ctl=/tmp/518/ctl_4_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-05
ctl formula formula --ctl=/tmp/518/ctl_5_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-06
ctl formula formula --ctl=/tmp/518/ctl_6_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-07
ctl formula formula --ctl=/tmp/518/ctl_7_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-08
ctl formula formula --ctl=/tmp/518/ctl_8_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-09
ctl formula formula --ctl=/tmp/518/ctl_9_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-10
ctl formula formula --ctl=/tmp/518/ctl_10_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-11
ctl formula formula --ctl=/tmp/518/ctl_11_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-12
ctl formula formula --ctl=/tmp/518/ctl_12_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-13
ctl formula formula --ctl=/tmp/518/ctl_13_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-14
ctl formula formula --ctl=/tmp/518/ctl_14_
ctl formula name CryptoMiner-PT-D20N100-CTLFireability-15
ctl formula formula --ctl=/tmp/518/ctl_15_
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 62 places, 63 transitions and 186 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: 63->62 groups
pnml2lts-sym: Regrouping took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 62; there are 62 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: 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: 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: Exploration took 2928086 group checks and 0 next state calls
pnml2lts-sym: reachability took 473.780 real 1673.620 user 217.230 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.110 real 0.410 user 0.000 sys
pnml2lts-sym: state space has 1.46259114410413e+26 states, 373448 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/518/ctl_15_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/518/ctl_1_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/518/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/518/ctl_3_ holds for the initial state
pnml2lts-sym: Formula /tmp/518/ctl_2_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/518/ctl_6_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/518/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/518/ctl_8_ holds for the initial state
pnml2lts-sym: Formula /tmp/518/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/518/ctl_10_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/518/ctl_5_ 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: Formula /tmp/518/ctl_11_ holds for the initial state
Killing (15) : 524
Killing (9) : 524

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-PT-D20N100"
export BK_EXAMINATION="CTLFireability"
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-PT-D20N100, examination is CTLFireability"
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-167987246400210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CryptoMiner-PT-D20N100.tgz
mv CryptoMiner-PT-D20N100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;