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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K Mar 5 18:22 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 Eratosthenes-PT-050-CTLFireability-00
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-01
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-02
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-03
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-04
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-05
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-06
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-07
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-08
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-09
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-10
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-11
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-12
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-13
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-14
FORMULA_NAME Eratosthenes-PT-050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678493465965

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=Eratosthenes-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:11:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:11:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:11:07] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-11 00:11:07] [INFO ] Transformed 49 places.
[2023-03-11 00:11:07] [INFO ] Transformed 108 transitions.
[2023-03-11 00:11:07] [INFO ] Parsed PT model containing 49 places and 108 transitions and 324 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 31 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 34 transition count 34
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 32 transition count 32
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 32 transition count 32
Applied a total of 50 rules in 12 ms. Remains 32 /34 variables (removed 2) and now considering 32/80 (removed 48) transitions.
// Phase 1: matrix 32 rows 32 cols
[2023-03-11 00:11:07] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-11 00:11:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-11 00:11:07] [INFO ] Invariant cache hit.
[2023-03-11 00:11:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-11 00:11:07] [INFO ] Invariant cache hit.
[2023-03-11 00:11:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/34 places, 32/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 32/34 places, 32/80 transitions.
Support contains 31 out of 32 places after structural reductions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 16 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 5 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 51 steps, including 1 resets, run visited all 52 properties in 21 ms. (steps per millisecond=2 )
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 3 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 32 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 32
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA Eratosthenes-PT-050-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 7 transition count 7
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 7 transition count 7
Applied a total of 50 rules in 1 ms. Remains 7 /32 variables (removed 25) and now considering 7/32 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/32 places, 7/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 11 transition count 11
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 11 transition count 11
Applied a total of 42 rules in 0 ms. Remains 11 /32 variables (removed 21) and now considering 11/32 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/32 places, 11/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 14 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Applied a total of 1 rules in 3 ms. Remains 14 /32 variables (removed 18) and now considering 14/32 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 14/32 places, 14/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /32 variables (removed 30) and now considering 2/32 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/32 places, 2/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 5 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /32 variables (removed 27) and now considering 5/32 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 5/32 places, 5/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 1 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /32 variables (removed 31) and now considering 1/32 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 1/32 places, 1/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 1 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /32 variables (removed 31) and now considering 1/32 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 1/32 places, 1/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 1 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 7 transition count 7
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 7 transition count 7
Applied a total of 50 rules in 1 ms. Remains 7 /32 variables (removed 25) and now considering 7/32 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/32 places, 7/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 8 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /32 variables (removed 24) and now considering 8/32 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 8/32 places, 8/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 11 transition count 11
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 11 transition count 11
Applied a total of 42 rules in 1 ms. Remains 11 /32 variables (removed 21) and now considering 11/32 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/32 places, 11/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 16 transition count 16
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 16 transition count 16
Applied a total of 32 rules in 0 ms. Remains 16 /32 variables (removed 16) and now considering 16/32 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/32 places, 16/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 6 transition count 6
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 6 transition count 6
Applied a total of 52 rules in 1 ms. Remains 6 /32 variables (removed 26) and now considering 6/32 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 6/32 places, 6/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Graph (complete) has 0 edges and 32 vertex of which 2 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions removed 30 transitions
Applied a total of 1 rules in 0 ms. Remains 2 /32 variables (removed 30) and now considering 2/32 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/32 places, 2/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 8 transition count 8
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 8 transition count 8
Applied a total of 48 rules in 1 ms. Remains 8 /32 variables (removed 24) and now considering 8/32 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/32 places, 8/32 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:08] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:11:08] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:11:08] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-11 00:11:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 32 transitions and 32 arcs took 1 ms.
Total runtime 961 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: 32 NrTr: 32 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.784sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 32 (3.2e+01) #states 8,589,934,592 (9)



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

checking: AF [p23<=0]
normalized: ~ [EG [~ [p23<=0]]]

abstracting: (p23<=0)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AF [p2<=0]
normalized: ~ [EG [~ [p2<=0]]]

abstracting: (p2<=0)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EG [AF [[1<=p21 & 1<=p23]]]
normalized: EG [~ [EG [~ [[1<=p21 & 1<=p23]]]]]

abstracting: (1<=p23)
states: 4,294,967,296 (9)
abstracting: (1<=p21)
states: 4,294,967,296 (9)
.
EG iterations: 1
..................................
EG iterations: 34
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AF [[p2<=0 | p26<=0]]
normalized: ~ [EG [~ [[p2<=0 | p26<=0]]]]

abstracting: (p26<=0)
states: 4,294,967,296 (9)
abstracting: (p2<=0)
states: 4,294,967,296 (9)
..................................
EG iterations: 34
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[~ [E [[1<=p25 | 1<=p10] U [[1<=p13 & 1<=p26] | 1<=p31]]] & EX [EX [p20<=0]]]]
normalized: E [true U [EX [EX [p20<=0]] & ~ [E [[1<=p25 | 1<=p10] U [[1<=p13 & 1<=p26] | 1<=p31]]]]]

abstracting: (1<=p31)
states: 4,294,967,296 (9)
abstracting: (1<=p26)
states: 4,294,967,296 (9)
abstracting: (1<=p13)
states: 4,294,967,296 (9)
abstracting: (1<=p10)
states: 4,294,967,296 (9)
abstracting: (1<=p25)
states: 4,294,967,296 (9)
abstracting: (p20<=0)
states: 4,294,967,296 (9)
..-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[1<=p12 & [1<=p27 & AF [[[1<=p1 & [1<=p17 & 1<=p23]] | 1<=p1]]]]]
normalized: EG [[[~ [EG [~ [[[[1<=p17 & 1<=p23] & 1<=p1] | 1<=p1]]]] & 1<=p27] & 1<=p12]]

abstracting: (1<=p12)
states: 4,294,967,296 (9)
abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p23)
states: 4,294,967,296 (9)
abstracting: (1<=p17)
states: 4,294,967,296 (9)
.
EG iterations: 1
.................................
EG iterations: 33
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [AF [[p21<=0 | p23<=0]] | ~ [E [AF [~ [[[1<=p10 & 1<=p27] | AX [1<=p12]]]] U 1<=p3]]]
normalized: [~ [E [~ [EG [[~ [EX [~ [1<=p12]]] | [1<=p10 & 1<=p27]]]] U 1<=p3]] | ~ [EG [~ [[p21<=0 | p23<=0]]]]]

abstracting: (p23<=0)
states: 4,294,967,296 (9)
abstracting: (p21<=0)
states: 4,294,967,296 (9)
..................................
EG iterations: 34
abstracting: (1<=p3)
states: 4,294,967,296 (9)
abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p10)
states: 4,294,967,296 (9)
abstracting: (1<=p12)
states: 4,294,967,296 (9)
...................................
EG iterations: 34
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [EF [[AG [[p25<=0 & [p15<=0 | p27<=0]]] | A [~ [AX [1<=p25]] U [1<=p22 & 1<=p30]]]]]
normalized: ~ [E [true U ~ [E [true U [[~ [EG [~ [[1<=p22 & 1<=p30]]]] & ~ [E [~ [[1<=p22 & 1<=p30]] U [~ [EX [~ [1<=p25]]] & ~ [[1<=p22 & 1<=p30]]]]]] | ~ [E [true U ~ [[[p15<=0 | p27<=0] & p25<=0]]]]]]]]]

abstracting: (p25<=0)
states: 4,294,967,296 (9)
abstracting: (p27<=0)
states: 4,294,967,296 (9)
abstracting: (p15<=0)
states: 4,294,967,296 (9)
abstracting: (1<=p30)
states: 4,294,967,296 (9)
abstracting: (1<=p22)
states: 4,294,967,296 (9)
abstracting: (1<=p25)
states: 4,294,967,296 (9)
.abstracting: (1<=p30)
states: 4,294,967,296 (9)
abstracting: (1<=p22)
states: 4,294,967,296 (9)
abstracting: (1<=p30)
states: 4,294,967,296 (9)
abstracting: (1<=p22)
states: 4,294,967,296 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[EG [EF [[[1<=p12 | [1<=p1 & 1<=p26]] & AX [1<=p28]]]] | A [AF [1<=p22] U [1<=p8 | 1<=p7]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[1<=p8 | 1<=p7]]]] & ~ [E [~ [[1<=p8 | 1<=p7]] U [EG [~ [1<=p22]] & ~ [[1<=p8 | 1<=p7]]]]]] | EG [E [true U [~ [EX [~ [1<=p28]]] & [[1<=p1 & 1<=p26] | 1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 4,294,967,296 (9)
abstracting: (1<=p26)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
..
EG iterations: 1
abstracting: (1<=p7)
states: 4,294,967,296 (9)
abstracting: (1<=p8)
states: 4,294,967,296 (9)
abstracting: (1<=p22)
states: 4,294,967,296 (9)
.
EG iterations: 1
abstracting: (1<=p7)
states: 4,294,967,296 (9)
abstracting: (1<=p8)
states: 4,294,967,296 (9)
abstracting: (1<=p7)
states: 4,294,967,296 (9)
abstracting: (1<=p8)
states: 4,294,967,296 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [A [EG [[E [EG [1<=p23] U [1<=p12 & 1<=p27]] | E [[1<=p1 | 1<=p21] U [1<=p14 & 1<=p6]]]] U A [~ [[1<=p1 & 1<=p2]] U EG [1<=p6]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [~ [EG [1<=p6]]]] & ~ [E [~ [EG [1<=p6]] U [[1<=p1 & 1<=p2] & ~ [EG [1<=p6]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [1<=p6]]]] & ~ [E [~ [EG [1<=p6]] U [[1<=p1 & 1<=p2] & ~ [EG [1<=p6]]]]]]] U [~ [EG [[E [EG [1<=p23] U [1<=p12 & 1<=p27]] | E [[1<=p1 | 1<=p21] U [1<=p14 & 1<=p6]]]]] & ~ [[~ [EG [~ [EG [1<=p6]]]] & ~ [E [~ [EG [1<=p6]] U [[1<=p1 & 1<=p2] & ~ [EG [1<=p6]]]]]]]]]]]]

abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35

EG iterations: 0
abstracting: (1<=p6)
states: 4,294,967,296 (9)
abstracting: (1<=p14)
states: 4,294,967,296 (9)
abstracting: (1<=p21)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p12)
states: 4,294,967,296 (9)
abstracting: (1<=p23)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
..................................
EG iterations: 34
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35

EG iterations: 0
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35
abstracting: (1<=p6)
states: 4,294,967,296 (9)
...................................
EG iterations: 35

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: E [[AG [[E [[1<=p15 & [1<=p28 & 1<=p30]] U EF [[1<=p2 & 1<=p26]]] | 1<=p24]] | [1<=p21 | A [1<=p6 U AF [[1<=p21 | 1<=p2]]]]] U [p16<=0 & ~ [EF [EX [1<=p29]]]]]
normalized: E [[[[~ [EG [EG [~ [[1<=p21 | 1<=p2]]]]] & ~ [E [EG [~ [[1<=p21 | 1<=p2]]] U [~ [1<=p6] & EG [~ [[1<=p21 | 1<=p2]]]]]]] | 1<=p21] | ~ [E [true U ~ [[E [[[1<=p28 & 1<=p30] & 1<=p15] U E [true U [1<=p2 & 1<=p26]]] | 1<=p24]]]]] U [~ [E [true U EX [1<=p29]]] & p16<=0]]

abstracting: (p16<=0)
states: 4,294,967,296 (9)
abstracting: (1<=p29)
states: 4,294,967,296 (9)
.abstracting: (1<=p24)
states: 4,294,967,296 (9)
abstracting: (1<=p26)
states: 4,294,967,296 (9)
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p15)
states: 4,294,967,296 (9)
abstracting: (1<=p30)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p21)
states: 4,294,967,296 (9)
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p21)
states: 4,294,967,296 (9)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,294,967,296 (9)
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p21)
states: 4,294,967,296 (9)
.
EG iterations: 1
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p21)
states: 4,294,967,296 (9)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: A [E [E [~ [[1<=p13 & 1<=p18]] U [1<=p2 | [1<=p1 & 1<=p20]]] U [1<=p20 & 1<=p27]] U E [1<=p29 U AG [[[1<=p1 & 1<=p28] | [AX [[1<=p15 & 1<=p28]] & EG [[1<=p11 & 1<=p27]]]]]]]
normalized: [~ [EG [~ [E [1<=p29 U ~ [E [true U ~ [[[EG [[1<=p11 & 1<=p27]] & ~ [EX [~ [[1<=p15 & 1<=p28]]]]] | [1<=p1 & 1<=p28]]]]]]]]] & ~ [E [~ [E [1<=p29 U ~ [E [true U ~ [[[EG [[1<=p11 & 1<=p27]] & ~ [EX [~ [[1<=p15 & 1<=p28]]]]] | [1<=p1 & 1<=p28]]]]]]] U [~ [E [E [~ [[1<=p13 & 1<=p18]] U [[1<=p1 & 1<=p20] | 1<=p2]] U [1<=p20 & 1<=p27]]] & ~ [E [1<=p29 U ~ [E [true U ~ [[[EG [[1<=p11 & 1<=p27]] & ~ [EX [~ [[1<=p15 & 1<=p28]]]]] | [1<=p1 & 1<=p28]]]]]]]]]]]

abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p15)
states: 4,294,967,296 (9)
.abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p11)
states: 4,294,967,296 (9)
..................................
EG iterations: 34
abstracting: (1<=p29)
states: 4,294,967,296 (9)
abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p20)
states: 4,294,967,296 (9)
abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p20)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p18)
states: 4,294,967,296 (9)
abstracting: (1<=p13)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p15)
states: 4,294,967,296 (9)
.abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p11)
states: 4,294,967,296 (9)
..................................
EG iterations: 34
abstracting: (1<=p29)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p1)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p15)
states: 4,294,967,296 (9)
.abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p11)
states: 4,294,967,296 (9)
..................................
EG iterations: 34
abstracting: (1<=p29)
states: 4,294,967,296 (9)

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: [AF [[E [1<=p17 U [AF [1<=p28] & EF [1<=p13]]] & [[[p7<=0 | p12<=0] | [p16<=0 | ~ [E [[1<=p23 & 1<=p26] U 1<=p8]]]] & [EG [[1<=p5 & 1<=p13]] | [[p9<=0 & AG [p22<=0]] | AG [p10<=0]]]]]] & EF [1<=p4]]
normalized: [E [true U 1<=p4] & ~ [EG [~ [[[[[~ [E [true U ~ [p10<=0]]] | [~ [E [true U ~ [p22<=0]]] & p9<=0]] | EG [[1<=p5 & 1<=p13]]] & [[~ [E [[1<=p23 & 1<=p26] U 1<=p8]] | p16<=0] | [p7<=0 | p12<=0]]] & E [1<=p17 U [E [true U 1<=p13] & ~ [EG [~ [1<=p28]]]]]]]]]]

abstracting: (1<=p28)
states: 4,294,967,296 (9)
.
EG iterations: 1
abstracting: (1<=p13)
states: 4,294,967,296 (9)
abstracting: (1<=p17)
states: 4,294,967,296 (9)
abstracting: (p12<=0)
states: 4,294,967,296 (9)
abstracting: (p7<=0)
states: 4,294,967,296 (9)
abstracting: (p16<=0)
states: 4,294,967,296 (9)
abstracting: (1<=p8)
states: 4,294,967,296 (9)
abstracting: (1<=p26)
states: 4,294,967,296 (9)
abstracting: (1<=p23)
states: 4,294,967,296 (9)
abstracting: (1<=p13)
states: 4,294,967,296 (9)
abstracting: (1<=p5)
states: 4,294,967,296 (9)
..................................
EG iterations: 34
abstracting: (p9<=0)
states: 4,294,967,296 (9)
abstracting: (p22<=0)
states: 4,294,967,296 (9)
abstracting: (p10<=0)
states: 4,294,967,296 (9)
.
EG iterations: 1
abstracting: (1<=p4)
states: 4,294,967,296 (9)
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: E [[AG [[1<=p22 & 1<=p26]] & [[AX [E [EG [[1<=p6 & 1<=p12]] U [[1<=p15 & 1<=p28] | 1<=p15]]] | E [1<=p19 U 1<=p2]] | [AF [1<=p2] | [~ [[~ [[1<=p10 & 1<=p27]] & 1<=p13]] | [1<=p17 & 1<=p23]]]]] U EF [[AF [E [[1<=p21 & 1<=p23] U 1<=p16]] & AG [p22<=0]]]]
normalized: E [[[[[[1<=p17 & 1<=p23] | ~ [[~ [[1<=p10 & 1<=p27]] & 1<=p13]]] | ~ [EG [~ [1<=p2]]]] | [E [1<=p19 U 1<=p2] | ~ [EX [~ [E [EG [[1<=p6 & 1<=p12]] U [[1<=p15 & 1<=p28] | 1<=p15]]]]]]] & ~ [E [true U ~ [[1<=p22 & 1<=p26]]]]] U E [true U [~ [E [true U ~ [p22<=0]]] & ~ [EG [~ [E [[1<=p21 & 1<=p23] U 1<=p16]]]]]]]

abstracting: (1<=p16)
states: 4,294,967,296 (9)
abstracting: (1<=p23)
states: 4,294,967,296 (9)
abstracting: (1<=p21)
states: 4,294,967,296 (9)
.
EG iterations: 1
abstracting: (p22<=0)
states: 4,294,967,296 (9)
abstracting: (1<=p26)
states: 4,294,967,296 (9)
abstracting: (1<=p22)
states: 4,294,967,296 (9)
abstracting: (1<=p15)
states: 4,294,967,296 (9)
abstracting: (1<=p28)
states: 4,294,967,296 (9)
abstracting: (1<=p15)
states: 4,294,967,296 (9)
abstracting: (1<=p12)
states: 4,294,967,296 (9)
abstracting: (1<=p6)
states: 4,294,967,296 (9)
..................................
EG iterations: 34
.abstracting: (1<=p2)
states: 4,294,967,296 (9)
abstracting: (1<=p19)
states: 4,294,967,296 (9)
abstracting: (1<=p2)
states: 4,294,967,296 (9)
.
EG iterations: 1
abstracting: (1<=p13)
states: 4,294,967,296 (9)
abstracting: (1<=p27)
states: 4,294,967,296 (9)
abstracting: (1<=p10)
states: 4,294,967,296 (9)
abstracting: (1<=p23)
states: 4,294,967,296 (9)
abstracting: (1<=p17)
states: 4,294,967,296 (9)
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

totally nodes used: 158421 (1.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 133218 149220 282438
used/not used/entry size/cache size: 291772 66817092 16 1024MB
basic ops cache: hits/miss/sum: 27769 43840 71609
used/not used/entry size/cache size: 86934 16690282 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: 145 718 863
used/not used/entry size/cache size: 718 8387890 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 66952137
1 155146
2 1477
3 97
4 5
5 2
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.500sec


BK_STOP 1678493474254

--------------------
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.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:66 (2), effective:34 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

iterations count:66 (2), effective:34 (1)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:60 (1), effective:28 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:32 (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="Eratosthenes-PT-050"
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 Eratosthenes-PT-050, 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 r170-tall-167838856800154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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