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-167987247000161.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-D03N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247000161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K 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 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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-D03N100-CTLCardinality-00
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-01
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-02
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-03
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-04
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-05
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-06
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-07
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-08
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-09
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-10
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-11
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-12
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-13
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-14
FORMULA_NAME CryptoMiner-PT-D03N100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680876490800

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-D03N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 14:08:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 14:08:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 14:08:12] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-07 14:08:12] [INFO ] Transformed 12 places.
[2023-04-07 14:08:12] [INFO ] Transformed 12 transitions.
[2023-04-07 14:08:12] [INFO ] Parsed PT model containing 12 places and 12 transitions and 34 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CryptoMiner-PT-D03N100-CTLCardinality-04 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 5 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:08:12] [INFO ] Computed 1 invariants in 4 ms
[2023-04-07 14:08:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-04-07 14:08:12] [INFO ] Invariant cache hit.
[2023-04-07 14:08:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:08:12] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-04-07 14:08:12] [INFO ] Invariant cache hit.
[2023-04-07 14:08:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-04-07 14:08:12] [INFO ] Flatten gal took : 14 ms
[2023-04-07 14:08:12] [INFO ] Flatten gal took : 4 ms
[2023-04-07 14:08:12] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10013 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 89) seen :57
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 31) 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 31) 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 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Running SMT prover for 30 properties.
[2023-04-07 14:08:13] [INFO ] Invariant cache hit.
[2023-04-07 14:08:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 14:08:13] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :12 sat :0 real:18
[2023-04-07 14:08:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:08:13] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :26 sat :4
[2023-04-07 14:08:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:08:13] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :26 sat :4
[2023-04-07 14:08:13] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :26 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-07 14:08:13] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :26 sat :4
Fused 30 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 8 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
Applied a total of 1 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 11/12 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 12/12 places, 11/12 transitions.
Incomplete random walk after 10022 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 541722 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 541722 steps, saw 213868 distinct states, run finished after 3002 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 12 cols
[2023-04-07 14:08:16] [INFO ] Computed 2 invariants in 0 ms
[2023-04-07 14:08:16] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 14:08:16] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-04-07 14:08:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:08:16] [INFO ] After 1ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2023-04-07 14:08:16] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 14:08:16] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-04-07 14:08:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 14:08:16] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 14:08:16] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 14:08:16] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 14:08:16] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 11/11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-04-07 14:08:16] [INFO ] Invariant cache hit.
[2023-04-07 14:08:17] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-07 14:08:17] [INFO ] Invariant cache hit.
[2023-04-07 14:08:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 14:08:17] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-07 14:08:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 14:08:17] [INFO ] Invariant cache hit.
[2023-04-07 14:08:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 12/12 places, 11/11 transitions.
Graph (complete) has 14 edges and 12 vertex of which 8 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Applied a total of 1 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 8/11 (removed 3) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-04-07 14:08:17] [INFO ] Computed 1 invariants in 0 ms
[2023-04-07 14:08:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 14:08:17] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 14:08:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 14:08:17] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 14:08:17] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 14:08:17] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 26 atomic propositions for a total of 15 simplifications.
FORMULA CryptoMiner-PT-D03N100-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 14:08:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 2 ms
FORMULA CryptoMiner-PT-D03N100-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CryptoMiner-PT-D03N100-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 2 ms
[2023-04-07 14:08:17] [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:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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 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:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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 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:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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 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 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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 1 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 1 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [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 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 1 ms. Remains : 12/12 places, 12/12 transitions.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:08:17] [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 0 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:08:17] [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 0 ms. Remains : 11/12 places, 12/12 transitions.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 0 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Input system was already deterministic with 12 transitions.
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Flatten gal took : 1 ms
[2023-04-07 14:08:17] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-04-07 14:08:17] [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 5002 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.806sec


RS generation: 0m 0.123sec


-> reachability set: #nodes 1119 (1.1e+03) #states 3,004,907,847 (9)



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

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

abstracting: (0<=0)
states: 3,004,907,847 (9)
.-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: EG [AX [EF [47<=p3]]]
normalized: EG [~ [EX [~ [E [true U 47<=p3]]]]]

abstracting: (47<=p3)
states: 57,065,820 (7)
..
EG iterations: 1
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.404sec

checking: AG [AX [EG [AX [~ [p0<=p8]]]]]
normalized: ~ [E [true U EX [~ [EG [~ [EX [p0<=p8]]]]]]]

abstracting: (p0<=p8)
states: 188,246,629 (8)
......
EG iterations: 5
.-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.666sec

checking: E [EF [AG [p8<=p10]] U AF [~ [EX [0<=0]]]]
normalized: E [E [true U ~ [E [true U ~ [p8<=p10]]]] U ~ [EG [EX [0<=0]]]]

abstracting: (0<=0)
states: 3,004,907,847 (9)
......
EG iterations: 5
abstracting: (p8<=p10)
states: 3,000,309,721 (9)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.432sec

checking: AX [EG [EX [AG [~ [sum(p3, p2, p1, p0)<=89]]]]]
normalized: ~ [EX [~ [EG [EX [~ [E [true U sum(p3, p2, p1, p0)<=89]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=89)
states: 2,961,983,756 (9)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.184sec

checking: EX [EF [[sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4) | 59<=sum(p11, p10, p9, p8)]]]
normalized: EX [E [true U [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4) | 59<=sum(p11, p10, p9, p8)]]]

abstracting: (59<=sum(p11, p10, p9, p8))
states: 0
abstracting: (sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4))
MC time: 8m32.018sec

checking: E [sum(p7, p6, p5, p4)<=66 U ~ [[7<=sum(p7, p6, p5, p4) | EF [sum(p3, p2, p1, p0)<=55]]]]
normalized: E [sum(p7, p6, p5, p4)<=66 U ~ [[7<=sum(p7, p6, p5, p4) | E [true U sum(p3, p2, p1, p0)<=55]]]]

abstracting: (sum(p3, p2, p1, p0)<=55)
states: 1,687,986,047 (9)
abstracting: (7<=sum(p7, p6, p5, p4))
states: 2,936,876,359 (9)
abstracting: (sum(p7, p6, p5, p4)<=66)
states: 2,994,466,982 (9)
-> the formula is TRUE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.088sec

checking: [EF [[A [~ [AG [p1<=p5]] U AF [[p3<=59 | 38<=p7]]] & E [p2<=p9 U p5<=44]]] & AG [AF [E [p1<=37 U [[3<=p3 & 85<=p1] | [p11<=p3 | 90<=p10]]]]]]
normalized: [~ [E [true U EG [~ [E [p1<=37 U [[p11<=p3 | 90<=p10] | [3<=p3 & 85<=p1]]]]]]] & E [true U [E [p2<=p9 U p5<=44] & [~ [EG [EG [~ [[p3<=59 | 38<=p7]]]]] & ~ [E [EG [~ [[p3<=59 | 38<=p7]]] U [~ [E [true U ~ [p1<=p5]]] & EG [~ [[p3<=59 | 38<=p7]]]]]]]]]]

abstracting: (38<=p7)
states: 0
abstracting: (p3<=59)
states: 2,994,072,117 (9)
......
EG iterations: 6
abstracting: (p1<=p5)
states: 1,550,774,392 (9)
abstracting: (38<=p7)
states: 0
abstracting: (p3<=59)
states: 2,994,072,117 (9)
......
EG iterations: 6
abstracting: (38<=p7)
states: 0
abstracting: (p3<=59)
states: 2,994,072,117 (9)
......
EG iterations: 6
.
EG iterations: 1
abstracting: (p5<=44)
states: 2,933,541,434 (9)
abstracting: (p2<=p9)
states: 190,329,129 (8)
abstracting: (85<=p1)
states: 63,038 (4)
abstracting: (3<=p3)
states: 2,470,753,617 (9)
abstracting: (90<=p10)
states: 0
abstracting: (p11<=p3)
states: 2,920,773,588 (9)
abstracting: (p1<=37)
states: 2,856,750,556 (9)
..............................................................................................................................
EG iterations: 126
-> the formula is TRUE

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

MC time: 0m 0.821sec

checking: AX [EF [EG [[EX [sum(p3, p2, p1, p0)<=71] | [AG [67<=sum(p7, p6, p5, p4)] & sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)]]]]]
normalized: ~ [EX [~ [E [true U EG [[[sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0) & ~ [E [true U ~ [67<=sum(p7, p6, p5, p4)]]]] | EX [sum(p3, p2, p1, p0)<=71]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=71)
states: 2,525,051,450 (9)
.abstracting: (67<=sum(p7, p6, p5, p4))
states: 10,440,865 (7)
abstracting: (sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0))
states: 3,004,898,874 (9)
....
EG iterations: 4
.-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m26.579sec

checking: ~ [E [E [[E [p0<=38 U p2<=10] & 15<=p7] U [[p9<=p1 | E [88<=p0 U 11<=p1]] & ~ [[p1<=83 | 69<=p4]]]] U [EF [~ [p1<=24]] | ~ [A [[[p5<=p1 & p2<=p9] | [26<=p5 & p8<=18]] U ~ [AX [p1<=p4]]]]]]]
normalized: ~ [E [E [[15<=p7 & E [p0<=38 U p2<=10]] U [~ [[p1<=83 | 69<=p4]] & [p9<=p1 | E [88<=p0 U 11<=p1]]]] U [~ [[~ [EG [~ [EX [~ [p1<=p4]]]]] & ~ [E [~ [EX [~ [p1<=p4]]] U [~ [[[26<=p5 & p8<=18] | [p5<=p1 & p2<=p9]]] & ~ [EX [~ [p1<=p4]]]]]]]] | E [true U ~ [p1<=24]]]]]

abstracting: (p1<=24)
states: 2,521,992,037 (9)
abstracting: (p1<=p4)
states: 619,164,065 (8)
.abstracting: (p2<=p9)
states: 190,329,129 (8)
abstracting: (p5<=p1)
states: 1,550,774,392 (9)
abstracting: (p8<=18)
states: 3,004,907,847 (9)
abstracting: (26<=p5)
states: 443,960,535 (8)
abstracting: (p1<=p4)
states: 619,164,065 (8)
.abstracting: (p1<=p4)
states: 619,164,065 (8)
................................................................................................................................................................................................
EG iterations: 191
abstracting: (11<=p1)
states: 1,424,861,734 (9)
abstracting: (88<=p0)
states: 23,042 (4)
abstracting: (p9<=p1)
states: 3,002,563,921 (9)
abstracting: (69<=p4)
states: 0
abstracting: (p1<=83)
states: 3,004,822,479 (9)
abstracting: (p2<=10)
states: 1,580,046,113 (9)
abstracting: (p0<=38)
states: 2,870,818,528 (9)
abstracting: (15<=p7)
states: 68,062,791 (7)
-> the formula is FALSE

FORMULA CryptoMiner-PT-D03N100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.388sec

checking: E [E [~ [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)] U [~ [EX [sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)]] | sum(p3, p2, p1, p0)<=94]] U sum(p3, p2, p1, p0)<=30]
normalized: E [E [~ [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)] U [sum(p3, p2, p1, p0)<=94 | ~ [EX [sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0)]]]] U sum(p3, p2, p1, p0)<=30]

abstracting: (sum(p3, p2, p1, p0)<=30)
states: 372,477,901 (8)
abstracting: (sum(p11, p10, p9, p8)<=sum(p3, p2, p1, p0))
states: 3,004,898,874 (9)
.abstracting: (sum(p3, p2, p1, p0)<=94)
states: 2,993,707,544 (9)
abstracting: (sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4))
MC time: 15m27.001sec

checking: [EF [sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)] & EX [[[[[AG [~ [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)]] | [~ [sum(p7, p6, p5, p4)<=40] | ~ [sum(p7, p6, p5, p4)<=83]]] & AX [~ [sum(p3, p2, p1, p0)<=5]]] | E [[AF [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)] | 73<=sum(p3, p2, p1, p0)] U A [17<=sum(p7, p6, p5, p4) U sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)]]] & [~ [A [[sum(p3, p2, p1, p0)<=99 & sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)] U sum(p7, p6, p5, p4)<=20]] | [~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)] | EF [~ [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)]]]]]]]
normalized: [EX [[[[E [true U ~ [sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)]] | ~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]] | ~ [[~ [EG [~ [sum(p7, p6, p5, p4)<=20]]] & ~ [E [~ [sum(p7, p6, p5, p4)<=20] U [~ [[sum(p3, p2, p1, p0)<=99 & sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)]] & ~ [sum(p7, p6, p5, p4)<=20]]]]]]] & [E [[73<=sum(p3, p2, p1, p0) | ~ [EG [~ [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)]]]] U [~ [EG [~ [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)]]] & ~ [E [~ [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)] U [~ [17<=sum(p7, p6, p5, p4)] & ~ [sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4)]]]]]] | [~ [EX [sum(p3, p2, p1, p0)<=5]] & [[~ [sum(p7, p6, p5, p4)<=83] | ~ [sum(p7, p6, p5, p4)<=40]] | ~ [E [true U sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8)]]]]]]] & E [true U sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8)]]

abstracting: (sum(p3, p2, p1, p0)<=sum(p11, p10, p9, p8))
states: 51,894 (4)
abstracting: (sum(p7, p6, p5, p4)<=sum(p11, p10, p9, p8))
states: 2,551,254 (6)
abstracting: (sum(p7, p6, p5, p4)<=40)
states: 2,649,001,639 (9)
abstracting: (sum(p7, p6, p5, p4)<=83)
states: 3,004,709,050 (9)
abstracting: (sum(p3, p2, p1, p0)<=5)
states: 1,911,367 (6)
.abstracting: (sum(p3, p2, p1, p0)<=sum(p7, p6, p5, p4))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10146180 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16108284 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.002sec


iterations count:2088 (174), effective:512 (42)

initing FirstDep: 0m 0.000sec


iterations count:388 (32), effective:141 (11)

iterations count:306 (25), effective:98 (8)

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

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

iterations count:13236 (1103), effective:4658 (388)

iterations count:459 (38), effective:148 (12)

idd.h:1025: Timeout: after 511 sec


iterations count:3398 (283), effective:1164 (97)

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

iterations count:312 (26), effective:150 (12)

iterations count:322 (26), effective:113 (9)

iterations count:163 (13), effective:96 (8)

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

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

iterations count:1662 (138), effective:564 (47)

iterations count:162 (13), effective:75 (6)

iterations count:36 (3), effective:6 (0)

iterations count:75 (6), effective:31 (2)

iterations count:192 (16), effective:90 (7)

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

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

idd.h:1025: Timeout: after 926 sec


iterations count:13119 (1093), effective:4618 (384)

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

idd.h:1025: Timeout: after 617 sec

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

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