Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978800354.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d0m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978800354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 10:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 10:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 10:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 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 SieveSingleMsgMbox-PT-d0m04-CTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679351018489

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:23:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 22:23:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:23:40] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-20 22:23:40] [INFO ] Transformed 262 places.
[2023-03-20 22:23:40] [INFO ] Transformed 73 transitions.
[2023-03-20 22:23:40] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Support contains 55 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Applied a total of 2 rules in 12 ms. Remains 70 /72 variables (removed 2) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2023-03-20 22:23:40] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-20 22:23:40] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-20 22:23:40] [INFO ] Invariant cache hit.
[2023-03-20 22:23:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:23:40] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-20 22:23:40] [INFO ] Invariant cache hit.
[2023-03-20 22:23:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/72 places, 73/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 70/72 places, 73/73 transitions.
Support contains 55 out of 70 places after structural reductions.
[2023-03-20 22:23:40] [INFO ] Flatten gal took : 24 ms
[2023-03-20 22:23:40] [INFO ] Flatten gal took : 11 ms
[2023-03-20 22:23:40] [INFO ] Input system was already deterministic with 73 transitions.
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 56) seen :18
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 94 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 114 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 115 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 112 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 59 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 119 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 110 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 38) seen :4
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-20 22:23:42] [INFO ] Invariant cache hit.
[2023-03-20 22:23:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:23:42] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 22:23:42] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:27
[2023-03-20 22:23:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:23:42] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:23:42] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :13 sat :21
[2023-03-20 22:23:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-20 22:23:42] [INFO ] After 138ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :13 sat :21
[2023-03-20 22:23:43] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 4 ms to minimize.
[2023-03-20 22:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-20 22:23:43] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2023-03-20 22:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-20 22:23:43] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :21
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-20 22:23:43] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :21
Fused 34 Parikh solutions to 21 different solutions.
Parikh walk visited 3 properties in 122 ms.
Support contains 21 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Graph (complete) has 187 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 64 transition count 66
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 64 transition count 66
Applied a total of 13 rules in 11 ms. Remains 64 /70 variables (removed 6) and now considering 66/73 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 64/70 places, 66/73 transitions.
Incomplete random walk after 10000 steps, including 2214 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 99 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 64 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 120 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 112 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Probably explored full state space saw : 702 states, properties seen :13
Probabilistic random walk after 1686 steps, saw 702 distinct states, run finished after 46 ms. (steps per millisecond=36 ) properties seen :13
Explored full state space saw : 702 states, properties seen :0
Exhaustive walk after 1686 steps, saw 702 distinct states, run finished after 20 ms. (steps per millisecond=84 ) properties seen :0
Successfully simplified 18 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:23:44] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 10 ms
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 8 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 73 transitions.
Support contains 28 out of 70 places (down from 38) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 13 stable transitions
Graph (complete) has 213 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 4 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 62/70 places, 65/73 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 14 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 7 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 9 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 67
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 62 transition count 64
Applied a total of 17 rules in 7 ms. Remains 62 /70 variables (removed 8) and now considering 64/73 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 62/70 places, 64/73 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Applied a total of 21 rules in 12 ms. Remains 60 /70 variables (removed 10) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 60/70 places, 62/73 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 65
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 65
Applied a total of 16 rules in 3 ms. Remains 62 /70 variables (removed 8) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/70 places, 65/73 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Applied a total of 23 rules in 4 ms. Remains 59 /70 variables (removed 11) and now considering 61/73 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 59/70 places, 61/73 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:23:44] [INFO ] Input system was already deterministic with 61 transitions.
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:23:44] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:23:44] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 22:23:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 73 transitions and 289 arcs took 1 ms.
Total runtime 4325 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 70 NrTr: 73 NrArc: 289)

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

net check time: 0m 0.000sec

init dd package: 0m 3.173sec


RS generation: 0m 0.023sec


-> reachability set: #nodes 1410 (1.4e+03) #states 702



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

checking: EF [EG [AX [[p1<=0 | p39<=0]]]]
normalized: E [true U EG [~ [EX [~ [[p1<=0 | p39<=0]]]]]]

abstracting: (p39<=0)
states: 632
abstracting: (p1<=0)
states: 484
..
EG iterations: 1
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: A [EF [AX [EG [[[1<=p7 & 1<=p23] | [1<=p47 & 1<=p1]]]]] U [1<=p1 & 1<=p46]]
normalized: [~ [EG [~ [[1<=p1 & 1<=p46]]]] & ~ [E [~ [[1<=p1 & 1<=p46]] U [~ [E [true U ~ [EX [~ [EG [[[1<=p47 & 1<=p1] | [1<=p7 & 1<=p23]]]]]]]] & ~ [[1<=p1 & 1<=p46]]]]]]

abstracting: (1<=p46)
states: 76
abstracting: (1<=p1)
states: 218
abstracting: (1<=p23)
states: 522
abstracting: (1<=p7)
states: 6
abstracting: (1<=p1)
states: 218
abstracting: (1<=p47)
states: 19
.....
EG iterations: 5
.abstracting: (1<=p46)
states: 76
abstracting: (1<=p1)
states: 218
abstracting: (1<=p46)
states: 76
abstracting: (1<=p1)
states: 218
..
EG iterations: 2
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AF [AG [AG [[1<=p1 & [1<=p37 & [[p1<=0 | p27<=0] | [p10<=0 | p23<=0]]]]]]]
normalized: ~ [EG [E [true U E [true U ~ [[1<=p1 & [1<=p37 & [[p10<=0 | p23<=0] | [p1<=0 | p27<=0]]]]]]]]]

abstracting: (p27<=0)
states: 694
abstracting: (p1<=0)
states: 484
abstracting: (p23<=0)
states: 180
abstracting: (p10<=0)
states: 678
abstracting: (1<=p37)
states: 71
abstracting: (1<=p1)
states: 218

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [[AG [[p8<=0 | p23<=0]] & [p1<=0 | [p52<=0 | [1<=p1 & 1<=p38]]]]]
normalized: ~ [EX [~ [[[p1<=0 | [p52<=0 | [1<=p1 & 1<=p38]]] & ~ [E [true U ~ [[p8<=0 | p23<=0]]]]]]]]

abstracting: (p23<=0)
states: 180
abstracting: (p8<=0)
states: 690
abstracting: (1<=p38)
states: 71
abstracting: (1<=p1)
states: 218
abstracting: (p52<=0)
states: 690
abstracting: (p1<=0)
states: 484
.-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EG [AG [[[[[[p1<=0 | [p63<=0 | p54<=0]] & 1<=p55] & 1<=p1] | [1<=p8 & 1<=p23]] | AF [AG [[1<=p1 & 1<=p32]]]]]]
normalized: EG [~ [E [true U ~ [[~ [EG [E [true U ~ [[1<=p1 & 1<=p32]]]]] | [[1<=p8 & 1<=p23] | [1<=p1 & [1<=p55 & [p1<=0 | [p63<=0 | p54<=0]]]]]]]]]]

abstracting: (p54<=0)
states: 690
abstracting: (p63<=0)
states: 702
abstracting: (p1<=0)
states: 484
abstracting: (1<=p55)
states: 172
abstracting: (1<=p1)
states: 218
abstracting: (1<=p23)
states: 522
abstracting: (1<=p8)
states: 12
abstracting: (1<=p32)
states: 129
abstracting: (1<=p1)
states: 218

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [[AG [EX [[~ [[1<=p14 & 1<=p40]] & EG [[1<=p1 & 1<=p55]]]]] | [1<=p8 & 1<=p23]] U [~ [[~ [[1<=p1 & 1<=p68]] | EF [AX [[1<=p9 & 1<=p48]]]]] & A [A [[1<=p1 & 1<=p27] U [1<=p1 & 1<=p43]] U [1<=p1 & 1<=p23]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [[1<=p1 & 1<=p23]]]] & ~ [E [~ [[1<=p1 & 1<=p23]] U [~ [[~ [EG [~ [[1<=p1 & 1<=p43]]]] & ~ [E [~ [[1<=p1 & 1<=p43]] U [~ [[1<=p1 & 1<=p27]] & ~ [[1<=p1 & 1<=p43]]]]]]] & ~ [[1<=p1 & 1<=p23]]]]]] & ~ [[E [true U ~ [EX [~ [[1<=p9 & 1<=p48]]]]] | ~ [[1<=p1 & 1<=p68]]]]]]]] & ~ [E [~ [[[~ [EG [~ [[1<=p1 & 1<=p23]]]] & ~ [E [~ [[1<=p1 & 1<=p23]] U [~ [[~ [EG [~ [[1<=p1 & 1<=p43]]]] & ~ [E [~ [[1<=p1 & 1<=p43]] U [~ [[1<=p1 & 1<=p27]] & ~ [[1<=p1 & 1<=p43]]]]]]] & ~ [[1<=p1 & 1<=p23]]]]]] & ~ [[E [true U ~ [EX [~ [[1<=p9 & 1<=p48]]]]] | ~ [[1<=p1 & 1<=p68]]]]]] U [~ [[[1<=p8 & 1<=p23] | ~ [E [true U ~ [EX [[EG [[1<=p1 & 1<=p55]] & ~ [[1<=p14 & 1<=p40]]]]]]]]] & ~ [[[~ [EG [~ [[1<=p1 & 1<=p23]]]] & ~ [E [~ [[1<=p1 & 1<=p23]] U [~ [[~ [EG [~ [[1<=p1 & 1<=p43]]]] & ~ [E [~ [[1<=p1 & 1<=p43]] U [~ [[1<=p1 & 1<=p27]] & ~ [[1<=p1 & 1<=p43]]]]]]] & ~ [[1<=p1 & 1<=p23]]]]]] & ~ [[E [true U ~ [EX [~ [[1<=p9 & 1<=p48]]]]] | ~ [[1<=p1 & 1<=p68]]]]]]]]]]

abstracting: (1<=p68)
states: 64
abstracting: (1<=p1)
states: 218
abstracting: (1<=p48)
states: 36
abstracting: (1<=p9)
states: 30
.abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
..
EG iterations: 2
abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
..
EG iterations: 2
abstracting: (1<=p40)
states: 56
abstracting: (1<=p14)
states: 68
abstracting: (1<=p55)
states: 172
abstracting: (1<=p1)
states: 218
.......
EG iterations: 7
.abstracting: (1<=p23)
states: 522
abstracting: (1<=p8)
states: 12
abstracting: (1<=p68)
states: 64
abstracting: (1<=p1)
states: 218
abstracting: (1<=p48)
states: 36
abstracting: (1<=p9)
states: 30
.abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
..
EG iterations: 2
abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
..
EG iterations: 2
abstracting: (1<=p68)
states: 64
abstracting: (1<=p1)
states: 218
abstracting: (1<=p48)
states: 36
abstracting: (1<=p9)
states: 30
.abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
abstracting: (1<=p27)
states: 8
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
abstracting: (1<=p43)
states: 32
abstracting: (1<=p1)
states: 218
..
EG iterations: 2
abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
abstracting: (1<=p23)
states: 522
abstracting: (1<=p1)
states: 218
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AF [[[[AX [[1<=p1 & 1<=p54]] & [[1<=p3 & 1<=p23] | [1<=p1 & 1<=p45]]] | [[1<=p1 & 1<=p58] | [1<=p1 & 1<=p55]]] & [EX [[1<=p1 & 1<=p28]] | [E [[1<=p1 & 1<=p51] U [1<=p1 & 1<=p68]] | [1<=p11 & 1<=p23]]]]]
normalized: ~ [EG [~ [[[[[1<=p11 & 1<=p23] | E [[1<=p1 & 1<=p51] U [1<=p1 & 1<=p68]]] | EX [[1<=p1 & 1<=p28]]] & [[[1<=p1 & 1<=p55] | [1<=p1 & 1<=p58]] | [[[1<=p1 & 1<=p45] | [1<=p3 & 1<=p23]] & ~ [EX [~ [[1<=p1 & 1<=p54]]]]]]]]]]

abstracting: (1<=p54)
states: 12
abstracting: (1<=p1)
states: 218
.abstracting: (1<=p23)
states: 522
abstracting: (1<=p3)
states: 1
abstracting: (1<=p45)
states: 51
abstracting: (1<=p1)
states: 218
abstracting: (1<=p58)
states: 0
abstracting: (1<=p1)
states: 218
abstracting: (1<=p55)
states: 172
abstracting: (1<=p1)
states: 218
abstracting: (1<=p28)
states: 46
abstracting: (1<=p1)
states: 218
.abstracting: (1<=p68)
states: 64
abstracting: (1<=p1)
states: 218
abstracting: (1<=p51)
states: 12
abstracting: (1<=p1)
states: 218
abstracting: (1<=p23)
states: 522
abstracting: (1<=p11)
states: 24
.
EG iterations: 1
-> the formula is FALSE

FORMULA SieveSingleMsgMbox-PT-d0m04-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 60090 (6.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 79751 382026 461777
used/not used/entry size/cache size: 428545 66680319 16 1024MB
basic ops cache: hits/miss/sum: 13237 60934 74171
used/not used/entry size/cache size: 106989 16670227 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 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1091 5859 6950
used/not used/entry size/cache size: 5859 8382749 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 67050775
1 56178
2 1829
3 74
4 8
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.406sec


BK_STOP 1679351030061

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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:2805 (38), effective:143 (1)

initing FirstDep: 0m 0.000sec


iterations count:170 (2), effective:6 (0)

iterations count:673 (9), effective:30 (0)

iterations count:97 (1), effective:2 (0)

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

iterations count:971 (13), effective:34 (0)

iterations count:190 (2), effective:7 (0)

iterations count:134 (1), effective:5 (0)

iterations count:673 (9), effective:30 (0)

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

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

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

iterations count:673 (9), effective:30 (0)

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

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

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

iterations count:673 (9), effective:30 (0)

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

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

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

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="SieveSingleMsgMbox-PT-d0m04"
export BK_EXAMINATION="CTLFireability"
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 SieveSingleMsgMbox-PT-d0m04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978800354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m04.tgz
mv SieveSingleMsgMbox-PT-d0m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;