Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247000153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CryptoMiner-PT-D03N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247000153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:06 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 5.3K 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-D03N010-CTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680876363784

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CryptoMiner-PT-D03N010
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 14:06:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 14:06:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 14:06:05] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2023-04-07 14:06:05] [INFO ] Transformed 12 places.
[2023-04-07 14:06:05] [INFO ] Transformed 12 transitions.
[2023-04-07 14:06:05] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 6 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-07 14:06:05] [INFO ] Computed 1 invariants in 4 ms
[2023-04-07 14:06:05] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-04-07 14:06:05] [INFO ] Invariant cache hit.
[2023-04-07 14:06:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:06:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-04-07 14:06:05] [INFO ] Invariant cache hit.
[2023-04-07 14:06:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 14:06:05] [INFO ] Flatten gal took : 14 ms
[2023-04-07 14:06:05] [INFO ] Flatten gal took : 4 ms
[2023-04-07 14:06:05] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 79) seen :28
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) 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 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) 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 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 51) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 47) seen :0
Running SMT prover for 47 properties.
[2023-04-07 14:06:06] [INFO ] Invariant cache hit.
[2023-04-07 14:06:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:06:06] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :33 sat :1 real:13
[2023-04-07 14:06:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:06:06] [INFO ] After 1ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :33 sat :1 real:13
[2023-04-07 14:06:06] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :33 sat :1 real:13
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 14:06:06] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :33 sat :1 real:13
[2023-04-07 14:06:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:06:06] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :43 sat :4
[2023-04-07 14:06:06] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :44 sat :3
[2023-04-07 14:06:06] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :44 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 14:06:06] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :44 sat :3
Fused 47 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 10
Applied a total of 3 rules in 8 ms. Remains 11 /12 variables (removed 1) and now considering 10/12 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 11/12 places, 10/12 transitions.
Incomplete random walk after 10007 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Finished probabilistic random walk after 7382 steps, run visited all 3 properties in 88 ms. (steps per millisecond=83 )
Probabilistic random walk after 7382 steps, saw 1955 distinct states, run finished after 88 ms. (steps per millisecond=83 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 44 atomic propositions for a total of 15 simplifications.
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 14:06:07] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 3 ms
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N010-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 29 edges and 12 vertex of which 5 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 2 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 0 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Graph (complete) has 29 edges and 12 vertex of which 11 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 3 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 12
Applied a total of 1 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Input system was already deterministic with 12 transitions.
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:06:07] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-04-07 14:06:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 34 arcs took 0 ms.
Total runtime 2023 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 12 NrTr: 12 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.747sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 121 (1.2e+02) #states 10,636 (4)



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

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

abstracting: (0<=0)
states: 10,636 (4)
.-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (0<=0)
states: 10,636 (4)
.-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EX [0<=0] & ~ [E [AF [~ [5<=p6]] U AG [EF [p5<=6]]]]]
normalized: [~ [E [~ [EG [5<=p6]] U ~ [E [true U ~ [E [true U p5<=6]]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 10,636 (4)
.abstracting: (p5<=6)
states: 10,438 (4)
abstracting: (5<=p6)
states: 4
.
EG iterations: 1
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[EF [AG [p5<=6]] & [EF [p5<=p9] & EF [p10<=p0]]]]
normalized: ~ [E [true U ~ [[[E [true U p10<=p0] & E [true U p5<=p9]] & E [true U ~ [E [true U ~ [p5<=6]]]]]]]]

abstracting: (p5<=6)
states: 10,438 (4)
abstracting: (p5<=p9)
states: 4,112 (3)
abstracting: (p10<=p0)
states: 9,805 (3)
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [[p0<=6 | [7<=p1 | p5<=p1]]] & AX [EF [~ [p5<=1]]]]
normalized: [~ [EX [~ [E [true U ~ [p5<=1]]]]] & ~ [EG [~ [[[7<=p1 | p5<=p1] | p0<=6]]]]]

abstracting: (p0<=6)
states: 10,438 (4)
abstracting: (p5<=p1)
states: 6,405 (3)
abstracting: (7<=p1)
states: 198
.........
EG iterations: 9
abstracting: (p5<=1)
states: 6,247 (3)
.-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EF [p6<=4] & EF [[~ [1<=p10] & [AX [AX [1<=0]] & EG [[~ [E [p5<=7 U p7<=p8]] | ~ [p8<=0]]]]]]]
normalized: [E [true U p6<=4] & E [true U [[EG [[~ [p8<=0] | ~ [E [p5<=7 U p7<=p8]]]] & ~ [EX [EX [~ [1<=0]]]]] & ~ [1<=p10]]]]

abstracting: (1<=p10)
states: 2,379 (3)
abstracting: (1<=0)
states: 0
..abstracting: (p7<=p8)
states: 8,793 (3)
abstracting: (p5<=7)
states: 10,557 (4)
abstracting: (p8<=0)
states: 9,635 (3)
..
EG iterations: 2
abstracting: (p6<=4)
states: 10,632 (4)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: E [AG [EX [EX [0<=0]]] U sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]
normalized: E [~ [E [true U ~ [EX [EX [0<=0]]]]] U sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4)]

abstracting: (sum(p11, p10, p9, p8)<=sum(p7, p6, p5, p4))
states: 9,492 (3)
abstracting: (0<=0)
states: 10,636 (4)
..-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EF [[EX [AG [EX [p6<=p9]]] | [[AX [AG [~ [p6<=p10]]] & p0<=p9] & [[5<=p6 | [p3<=2 & [p2<=6 | AG [1<=p5]]]] & [AF [~ [p5<=p2]] | [~ [p7<=p1] & ~ [p10<=p4]]]]]]]
normalized: E [true U [[[[[~ [p10<=p4] & ~ [p7<=p1]] | ~ [EG [p5<=p2]]] & [5<=p6 | [p3<=2 & [p2<=6 | ~ [E [true U ~ [1<=p5]]]]]]] & [p0<=p9 & ~ [EX [E [true U p6<=p10]]]]] | EX [~ [E [true U ~ [EX [p6<=p9]]]]]]]

abstracting: (p6<=p9)
states: 7,237 (3)
..abstracting: (p6<=p10)
states: 7,378 (3)
.abstracting: (p0<=p9)
states: 4,112 (3)
abstracting: (1<=p5)
states: 6,944 (3)
abstracting: (p2<=6)
states: 10,438 (4)
abstracting: (p3<=2)
states: 7,967 (3)
abstracting: (5<=p6)
states: 4
abstracting: (p5<=p2)
states: 6,405 (3)
......
EG iterations: 6
abstracting: (p7<=p1)
states: 9,761 (3)
abstracting: (p10<=p4)
states: 8,257 (3)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 11069 (1.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 38241 26885 65126
used/not used/entry size/cache size: 33400 67075464 16 1024MB
basic ops cache: hits/miss/sum: 15404 12756 28160
used/not used/entry size/cache size: 25029 16752187 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 7281 7281
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 2003 1023 3026
used/not used/entry size/cache size: 1023 8387585 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67098777
1 9507
2 464
3 39
4 29
5 14
6 7
7 5
8 0
9 6
>= 10 16

Total processing time: 0m 4.447sec


BK_STOP 1680876372700

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:223 (18), effective:54 (4)

initing FirstDep: 0m 0.000sec


iterations count:38 (3), effective:10 (0)

iterations count:114 (9), effective:37 (3)

iterations count:40 (3), effective:11 (0)

iterations count:89 (7), effective:28 (2)

iterations count:40 (3), effective:11 (0)

iterations count:66 (5), effective:21 (1)

iterations count:22 (1), effective:4 (0)

iterations count:81 (6), effective:25 (2)

iterations count:34 (2), effective:8 (0)

iterations count:52 (4), effective:9 (0)

iterations count:288 (24), effective:93 (7)

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

iterations count:335 (27), effective:109 (9)

iterations count:22 (1), effective:3 (0)

iterations count:213 (17), effective:70 (5)

iterations count:51 (4), effective:11 (0)

iterations count:77 (6), effective:25 (2)

iterations count:216 (18), effective:71 (5)

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-D03N010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is CryptoMiner-PT-D03N010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247000153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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