fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r522-tall-167987247000185
Last Updated
May 14, 2023

About the Execution of Marcie+red for CryptoMiner-PT-D05N250

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 2402548.00 0.00 0.00 ?F??????FFFT??TF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247000185.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-D05N250, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247000185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 20K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 24K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 141K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 7.8K 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-D05N250-CTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D05N250-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680881890872

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-D05N250
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 15:38:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 15:38:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 15:38:12] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 15:38:12] [INFO ] Transformed 18 places.
[2023-04-07 15:38:12] [INFO ] Transformed 18 transitions.
[2023-04-07 15:38:12] [INFO ] Parsed PT model containing 18 places and 18 transitions and 52 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2023-04-07 15:38:12] [INFO ] Computed 1 invariants in 9 ms
[2023-04-07 15:38:12] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-04-07 15:38:12] [INFO ] Invariant cache hit.
[2023-04-07 15:38:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:38:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-04-07 15:38:12] [INFO ] Invariant cache hit.
[2023-04-07 15:38:12] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 18/18 places, 18/18 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-07 15:38:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 15:38:12] [INFO ] Flatten gal took : 15 ms
FORMULA CryptoMiner-PT-D05N250-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 15:38:12] [INFO ] Flatten gal took : 5 ms
[2023-04-07 15:38:12] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=264 ) properties (out of 89) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 73) seen :13
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 60) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 59) 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 59) 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 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 59) 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 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 59) seen :0
Running SMT prover for 59 properties.
[2023-04-07 15:38:13] [INFO ] Invariant cache hit.
[2023-04-07 15:38:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 15:38:13] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:58
[2023-04-07 15:38:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 15:38:14] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :30 sat :29
[2023-04-07 15:38:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:38:14] [INFO ] After 62ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :31 sat :28
[2023-04-07 15:38:14] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :31 sat :28
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-07 15:38:14] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :31 sat :28
Fused 59 Parikh solutions to 28 different solutions.
Parikh walk visited 14 properties in 338 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 18/18 places, 18/18 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2515 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-07 15:38:14] [INFO ] Invariant cache hit.
[2023-04-07 15:38:14] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 15:38:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 15:38:15] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 15:38:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 15:38:15] [INFO ] After 23ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 15:38:15] [INFO ] After 38ms 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 15:38:15] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 483 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=483 )
Parikh walk visited 6 properties in 28 ms.
Successfully simplified 23 atomic propositions for a total of 15 simplifications.
FORMULA CryptoMiner-PT-D05N250-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 15:38:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 4 ms
FORMULA CryptoMiner-PT-D05N250-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D05N250-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 45 edges and 18 vertex of which 7 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 0 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 18
Applied a total of 1 rules in 1 ms. Remains 17 /18 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 17/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 18/18 places, 18/18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 0 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Input system was already deterministic with 18 transitions.
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 2 ms
[2023-04-07 15:38:15] [INFO ] Flatten gal took : 1 ms
[2023-04-07 15:38:15] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-04-07 15:38:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 18 transitions and 52 arcs took 0 ms.
Total runtime 2969 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: 18 NrTr: 18 NrArc: 52)

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

net check time: 0m 0.000sec

init dd package: 0m 2.695sec


RS generation: 0m 8.189sec


-> reachability set: #nodes 4356 (4.4e+03) #states 33,357,491,354,350,793 (16)



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

checking: EX [AG [EX [0<=0]]]
normalized: EX [~ [E [true U ~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 33,357,491,354,350,793 (16)
.MC time: 5m 0.048sec

checking: AX [[EX [0<=0] & AX [p5<=p9]]]
normalized: ~ [EX [~ [[~ [EX [~ [p5<=p9]]] & EX [0<=0]]]]]

abstracting: (0<=0)
states: 33,357,491,354,350,793 (16)
.abstracting: (p5<=p9)
states: 8,860,779,951,987,468 (15)
..-> the formula is TRUE

FORMULA CryptoMiner-PT-D05N250-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.287sec

checking: EG [AG [AX [[p11<=p1 | 46<=p3]]]]
normalized: EG [~ [E [true U EX [~ [[p11<=p1 | 46<=p3]]]]]]

abstracting: (46<=p3)
states: 4,139,947,253,283,668 (15)
abstracting: (p11<=p1)
states: 28,458,810,292,910,614 (16)
..
EG iterations: 1
-> the formula is FALSE

FORMULA CryptoMiner-PT-D05N250-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.083sec

checking: AF [[AG [[~ [p1<=127] | ~ [p0<=p13]]] & [AF [p3<=p1] | ~ [p6<=p2]]]]
normalized: ~ [EG [~ [[[~ [p6<=p2] | ~ [EG [~ [p3<=p1]]]] & ~ [E [true U ~ [[~ [p0<=p13] | ~ [p1<=127]]]]]]]]]

abstracting: (p1<=127)
states: 33,332,946,327,977,222 (16)
abstracting: (p0<=p13)
states: 1,352,704,143,224,946 (15)
abstracting: (p3<=p1)
states: 17,023,236,521,365,393 (16)
..................................................................................................................................................................................MC time: 5m22.444sec

checking: AX [EF [EG [~ [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)]]]]
normalized: ~ [EX [~ [E [true U EG [~ [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)]]]]]]

abstracting: (sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0))
MC time: 4m49.990sec

checking: [AG [[EG [[AG [p6<=p13] & [p11<=183 & p11<=9]]] | E [[AG [p3<=7] | [p11<=p13 | 141<=p13]] U A [p13<=p4 U p4<=159]]]] & EF [EX [AG [[p2<=83 & 56<=p8]]]]]
normalized: [E [true U EX [~ [E [true U ~ [[p2<=83 & 56<=p8]]]]]] & ~ [E [true U ~ [[E [[[p11<=p13 | 141<=p13] | ~ [E [true U ~ [p3<=7]]]] U [~ [EG [~ [p4<=159]]] & ~ [E [~ [p4<=159] U [~ [p13<=p4] & ~ [p4<=159]]]]]] | EG [[[p11<=183 & p11<=9] & ~ [E [true U ~ [p6<=p13]]]]]]]]]]

abstracting: (p6<=p13)
states: 10,544,793,541,515,229 (16)
abstracting: (p11<=9)
states: 30,072,062,456,013,626 (16)
abstracting: (p11<=183)
states: 33,357,491,354,350,793 (16)
.
EG iterations: 1
abstracting: (p4<=159)
states: 33,356,149,032,654,495 (16)
abstracting: (p13<=p4)
states: 33,357,304,907,239,817 (16)
abstracting: (p4<=159)
states: 33,356,149,032,654,495 (16)
abstracting: (p4<=159)
states: 33,356,149,032,654,495 (16)
........
EG iterations: 8
abstracting: (p3<=7)
states: 9,509,430,034,791,289 (15)
abstracting: (141<=p13)
states: 0
abstracting: (p11<=p13)
states: 6,836,938,601,068,503 (15)
abstracting: (56<=p8)
states: 82,040,308,140,832 (13)
abstracting: (p2<=83)
states: 32,842,466,966,574,661 (16)
.-> the formula is FALSE

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

MC time: 0m35.514sec

checking: E [AX [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)] U 62<=sum(p11, p10, p9, p8, p7, p6)]
normalized: E [~ [EX [~ [sum(p17, p16, p15, p14, p13, p12)<=sum(p5, p4, p3, p2, p1, p0)]]] U 62<=sum(p11, p10, p9, p8, p7, p6)]

abstracting: (62<=sum(p11, p10, p9, p8, p7, p6))
MC time: 4m32.791sec

checking: [AX [[[EX [[sum(p11, p10, p9, p8, p7, p6)<=61 & AF [28<=sum(p17, p16, p15, p14, p13, p12)]]] & EF [~ [sum(p5, p4, p3, p2, p1, p0)<=52]]] | 70<=sum(p5, p4, p3, p2, p1, p0)]] & AX [[AF [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=96]]] & EF [AG [sum(p11, p10, p9, p8, p7, p6)<=69]]]]]
normalized: [~ [EX [~ [[E [true U ~ [E [true U ~ [sum(p11, p10, p9, p8, p7, p6)<=69]]]] & ~ [EG [~ [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=96]]]]]]]]] & ~ [EX [~ [[70<=sum(p5, p4, p3, p2, p1, p0) | [E [true U ~ [sum(p5, p4, p3, p2, p1, p0)<=52]] & EX [[sum(p11, p10, p9, p8, p7, p6)<=61 & ~ [EG [~ [28<=sum(p17, p16, p15, p14, p13, p12)]]]]]]]]]]]

abstracting: (28<=sum(p17, p16, p15, p14, p13, p12))
states: 0

EG iterations: 0
abstracting: (sum(p11, p10, p9, p8, p7, p6)<=61)
MC time: 4m12.709sec

checking: AG [[~ [sum(p5, p4, p3, p2, p1, p0)<=4] | [E [AF [[sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6) | sum(p5, p4, p3, p2, p1, p0)<=100]] U AG [EF [4<=sum(p5, p4, p3, p2, p1, p0)]]] & E [42<=sum(p17, p16, p15, p14, p13, p12) U 97<=sum(p17, p16, p15, p14, p13, p12)]]]]
normalized: ~ [E [true U ~ [[[E [42<=sum(p17, p16, p15, p14, p13, p12) U 97<=sum(p17, p16, p15, p14, p13, p12)] & E [~ [EG [~ [[sum(p5, p4, p3, p2, p1, p0)<=sum(p11, p10, p9, p8, p7, p6) | sum(p5, p4, p3, p2, p1, p0)<=100]]]] U ~ [E [true U ~ [E [true U 4<=sum(p5, p4, p3, p2, p1, p0)]]]]]] | ~ [sum(p5, p4, p3, p2, p1, p0)<=4]]]]]

abstracting: (sum(p5, p4, p3, p2, p1, p0)<=4)
MC time: 3m46.013sec

checking: A [AX [[AG [AF [sum(p5, p4, p3, p2, p1, p0)<=63]] | [sum(p17, p16, p15, p14, p13, p12)<=98 & EG [~ [8<=sum(p5, p4, p3, p2, p1, p0)]]]]] U [EG [AG [[sum(p11, p10, p9, p8, p7, p6)<=42 & EG [sum(p11, p10, p9, p8, p7, p6)<=15]]]] & [72<=sum(p17, p16, p15, p14, p13, p12) | [AX [EF [94<=sum(p11, p10, p9, p8, p7, p6)]] | EG [AF [69<=sum(p17, p16, p15, p14, p13, p12)]]]]]]
normalized: [~ [EG [~ [[[72<=sum(p17, p16, p15, p14, p13, p12) | [EG [~ [EG [~ [69<=sum(p17, p16, p15, p14, p13, p12)]]]] | ~ [EX [~ [E [true U 94<=sum(p11, p10, p9, p8, p7, p6)]]]]]] & EG [~ [E [true U ~ [[sum(p11, p10, p9, p8, p7, p6)<=42 & EG [sum(p11, p10, p9, p8, p7, p6)<=15]]]]]]]]]] & ~ [E [~ [[[72<=sum(p17, p16, p15, p14, p13, p12) | [EG [~ [EG [~ [69<=sum(p17, p16, p15, p14, p13, p12)]]]] | ~ [EX [~ [E [true U 94<=sum(p11, p10, p9, p8, p7, p6)]]]]]] & EG [~ [E [true U ~ [[sum(p11, p10, p9, p8, p7, p6)<=42 & EG [sum(p11, p10, p9, p8, p7, p6)<=15]]]]]]]] U [EX [~ [[[sum(p17, p16, p15, p14, p13, p12)<=98 & EG [~ [8<=sum(p5, p4, p3, p2, p1, p0)]]] | ~ [E [true U EG [~ [sum(p5, p4, p3, p2, p1, p0)<=63]]]]]]] & ~ [[[72<=sum(p17, p16, p15, p14, p13, p12) | [EG [~ [EG [~ [69<=sum(p17, p16, p15, p14, p13, p12)]]]] | ~ [EX [~ [E [true U 94<=sum(p11, p10, p9, p8, p7, p6)]]]]]] & EG [~ [E [true U ~ [[sum(p11, p10, p9, p8, p7, p6)<=42 & EG [sum(p11, p10, p9, p8, p7, p6)<=15]]]]]]]]]]]]

abstracting: (sum(p11, p10, p9, p8, p7, p6)<=15)
MC time: 3m20.049sec

checking: [AX [[AF [54<=sum(p11, p10, p9, p8, p7, p6)] | sum(p11, p10, p9, p8, p7, p6)<=28]] | [E [[[AG [90<=sum(p11, p10, p9, p8, p7, p6)] & sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12)] | AX [1<=0]] U [A [[32<=sum(p17, p16, p15, p14, p13, p12) | 74<=sum(p11, p10, p9, p8, p7, p6)] U [sum(p11, p10, p9, p8, p7, p6)<=100 | 81<=sum(p17, p16, p15, p14, p13, p12)]] & [~ [EF [76<=sum(p5, p4, p3, p2, p1, p0)]] & EX [sum(p11, p10, p9, p8, p7, p6)<=90]]]] | A [sum(p11, p10, p9, p8, p7, p6)<=68 U [sum(p11, p10, p9, p8, p7, p6)<=42 & AG [33<=sum(p5, p4, p3, p2, p1, p0)]]]]]
normalized: [[[~ [EG [~ [[sum(p11, p10, p9, p8, p7, p6)<=42 & ~ [E [true U ~ [33<=sum(p5, p4, p3, p2, p1, p0)]]]]]]] & ~ [E [~ [[sum(p11, p10, p9, p8, p7, p6)<=42 & ~ [E [true U ~ [33<=sum(p5, p4, p3, p2, p1, p0)]]]]] U [~ [sum(p11, p10, p9, p8, p7, p6)<=68] & ~ [[sum(p11, p10, p9, p8, p7, p6)<=42 & ~ [E [true U ~ [33<=sum(p5, p4, p3, p2, p1, p0)]]]]]]]]] | E [[~ [EX [~ [1<=0]]] | [sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12) & ~ [E [true U ~ [90<=sum(p11, p10, p9, p8, p7, p6)]]]]] U [[EX [sum(p11, p10, p9, p8, p7, p6)<=90] & ~ [E [true U 76<=sum(p5, p4, p3, p2, p1, p0)]]] & [~ [EG [~ [[sum(p11, p10, p9, p8, p7, p6)<=100 | 81<=sum(p17, p16, p15, p14, p13, p12)]]]] & ~ [E [~ [[sum(p11, p10, p9, p8, p7, p6)<=100 | 81<=sum(p17, p16, p15, p14, p13, p12)]] U [~ [[32<=sum(p17, p16, p15, p14, p13, p12) | 74<=sum(p11, p10, p9, p8, p7, p6)]] & ~ [[sum(p11, p10, p9, p8, p7, p6)<=100 | 81<=sum(p17, p16, p15, p14, p13, p12)]]]]]]]]] | ~ [EX [~ [[sum(p11, p10, p9, p8, p7, p6)<=28 | ~ [EG [~ [54<=sum(p11, p10, p9, p8, p7, p6)]]]]]]]]

abstracting: (54<=sum(p11, p10, p9, p8, p7, p6))
MC time: 2m58.004sec

checking: [[A [[[EX [19<=sum(p5, p4, p3, p2, p1, p0)] | sum(p5, p4, p3, p2, p1, p0)<=61] & E [[sum(p17, p16, p15, p14, p13, p12)<=71 & [sum(p17, p16, p15, p14, p13, p12)<=75 & sum(p11, p10, p9, p8, p7, p6)<=22]] U 50<=sum(p11, p10, p9, p8, p7, p6)]] U E [EF [[sum(p17, p16, p15, p14, p13, p12)<=79 | 31<=sum(p5, p4, p3, p2, p1, p0)]] U [[AX [38<=sum(p17, p16, p15, p14, p13, p12)] & EX [45<=sum(p5, p4, p3, p2, p1, p0)]] | A [61<=sum(p11, p10, p9, p8, p7, p6) U 78<=sum(p11, p10, p9, p8, p7, p6)]]]] & EX [[AF [sum(p5, p4, p3, p2, p1, p0)<=47] | ~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12)]]]] & [EF [EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12)]]] & AX [EF [AG [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]]]
normalized: [[~ [EX [~ [E [true U ~ [E [true U ~ [sum(p11, p10, p9, p8, p7, p6)<=sum(p5, p4, p3, p2, p1, p0)]]]]]]] & E [true U EX [~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12)]]]] & [EX [[~ [sum(p5, p4, p3, p2, p1, p0)<=sum(p17, p16, p15, p14, p13, p12)] | ~ [EG [~ [sum(p5, p4, p3, p2, p1, p0)<=47]]]]] & [~ [EG [~ [E [E [true U [sum(p17, p16, p15, p14, p13, p12)<=79 | 31<=sum(p5, p4, p3, p2, p1, p0)]] U [[~ [EG [~ [78<=sum(p11, p10, p9, p8, p7, p6)]]] & ~ [E [~ [78<=sum(p11, p10, p9, p8, p7, p6)] U [~ [61<=sum(p11, p10, p9, p8, p7, p6)] & ~ [78<=sum(p11, p10, p9, p8, p7, p6)]]]]] | [EX [45<=sum(p5, p4, p3, p2, p1, p0)] & ~ [EX [~ [38<=sum(p17, p16, p15, p14, p13, p12)]]]]]]]]] & ~ [E [~ [E [E [true U [sum(p17, p16, p15, p14, p13, p12)<=79 | 31<=sum(p5, p4, p3, p2, p1, p0)]] U [[~ [EG [~ [78<=sum(p11, p10, p9, p8, p7, p6)]]] & ~ [E [~ [78<=sum(p11, p10, p9, p8, p7, p6)] U [~ [61<=sum(p11, p10, p9, p8, p7, p6)] & ~ [78<=sum(p11, p10, p9, p8, p7, p6)]]]]] | [EX [45<=sum(p5, p4, p3, p2, p1, p0)] & ~ [EX [~ [38<=sum(p17, p16, p15, p14, p13, p12)]]]]]]] U [~ [[E [[sum(p17, p16, p15, p14, p13, p12)<=71 & [sum(p17, p16, p15, p14, p13, p12)<=75 & sum(p11, p10, p9, p8, p7, p6)<=22]] U 50<=sum(p11, p10, p9, p8, p7, p6)] & [sum(p5, p4, p3, p2, p1, p0)<=61 | EX [19<=sum(p5, p4, p3, p2, p1, p0)]]]] & ~ [E [E [true U [sum(p17, p16, p15, p14, p13, p12)<=79 | 31<=sum(p5, p4, p3, p2, p1, p0)]] U [[~ [EG [~ [78<=sum(p11, p10, p9, p8, p7, p6)]]] & ~ [E [~ [78<=sum(p11, p10, p9, p8, p7, p6)] U [~ [61<=sum(p11, p10, p9, p8, p7, p6)] & ~ [78<=sum(p11, p10, p9, p8, p7, p6)]]]]] | [EX [45<=sum(p5, p4, p3, p2, p1, p0)] & ~ [EX [~ [38<=sum(p17, p16, p15, p14, p13, p12)]]]]]]]]]]]]]

abstracting: (38<=sum(p17, p16, p15, p14, p13, p12))
states: 0
.abstracting: (45<=sum(p5, p4, p3, p2, p1, p0))
MC time: 2m38.144sec

checking: EX [AG [EX [0<=0]]]
normalized: EX [~ [E [true U ~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 33,357,491,354,350,793 (16)
.
BK_STOP 1680884293420

--------------------
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:8613 (478), effective:1867 (103)

initing FirstDep: 0m 0.000sec

36149
sat_reach.icc:155: Timeout: after 299 sec


iterations count:1261 (70), effective:479 (26)

iterations count:1637 (90), effective:373 (20)

net_ddint.h:600: Timeout: after 321 sec


idd.h:1025: Timeout: after 289 sec


iterations count:169 (9), effective:41 (2)

iterations count:122 (6), effective:40 (2)

iterations count:200 (11), effective:91 (5)

iterations count:2215 (123), effective:834 (46)

iterations count:2214 (123), effective:742 (41)

iterations count:57299 (3183), effective:18127 (1007)

idd.h:1025: Timeout: after 284 sec


idd.h:1025: Timeout: after 253 sec


idd.h:1025: Timeout: after 225 sec


idd.h:1025: Timeout: after 199 sec


idd.h:1025: Timeout: after 177 sec


idd.h:1025: Timeout: after 157 sec

36149/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 476 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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-D05N250"
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-D05N250, 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-167987247000185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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