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.r353-smll-167891800400001.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 marcie
Input is RobotManipulation-PT-00001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r353-smll-167891800400001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 9.0K Feb 26 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 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 6.4K 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 RobotManipulation-PT-00001-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00001-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678948315405

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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00001
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: RobotManipulation_PT_00001
(NrP: 15 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 4.726sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 107 (1.1e+02) #states 110



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

checking: ~ [AX [AX [2<=r_active]]]
normalized: EX [EX [~ [2<=r_active]]]

abstracting: (2<=r_active)
states: 64
..-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [AX [~ [[2<=moved & ~ [[~ [EF [p_m<=0]] | 1<=p_rdy]]]]]]
normalized: EX [[~ [[~ [E [true U p_m<=0]] | 1<=p_rdy]] & 2<=moved]]

abstracting: (2<=moved)
states: 2
abstracting: (1<=p_rdy)
states: 20
abstracting: (p_m<=0)
states: 56
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [~ [[AG [r_active<=2] & [EG [[[1<=r_moving & initialized<=2] & 1<=p_rdy]] | EX [EX [2<=p_rel]]]]]]
normalized: EX [~ [[~ [E [true U ~ [r_active<=2]]] & [EX [EX [2<=p_rel]] | EG [[[1<=r_moving & initialized<=2] & 1<=p_rdy]]]]]]

abstracting: (1<=p_rdy)
states: 20
abstracting: (initialized<=2)
states: 110
abstracting: (1<=r_moving)
states: 20
...
EG iterations: 3
abstracting: (2<=p_rel)
states: 2
..abstracting: (r_active<=2)
states: 110
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[AX [[r_active<=initialized | EF [[moved<=3 | access<=0]]]] & EX [AF [EX [r_moving<=initialize]]]]]
normalized: ~ [EG [~ [[EX [~ [EG [~ [EX [r_moving<=initialize]]]]] & ~ [EX [~ [[E [true U [moved<=3 | access<=0]] | r_active<=initialized]]]]]]]]

abstracting: (r_active<=initialized)
states: 16
abstracting: (access<=0)
states: 30
abstracting: (moved<=3)
states: 110
.abstracting: (r_moving<=initialize)
states: 100
...
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [[EF [[~ [[~ [move<=p_rel] & [AG [2<=p_sc] | [r_stopped<=3 & 2<=r_moving]]]] & EX [move<=p_sc]]] & EF [AG [3<=r_moving]]]]
normalized: ~ [[E [true U ~ [E [true U ~ [3<=r_moving]]]] & E [true U [~ [[[~ [E [true U ~ [2<=p_sc]]] | [r_stopped<=3 & 2<=r_moving]] & ~ [move<=p_rel]]] & EX [move<=p_sc]]]]]

abstracting: (move<=p_sc)
states: 92
.abstracting: (move<=p_rel)
states: 92
abstracting: (2<=r_moving)
states: 2
abstracting: (r_stopped<=3)
states: 110
abstracting: (2<=p_sc)
states: 2
abstracting: (3<=r_moving)
states: 0
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [~ [3<=move] U [AF [EF [AG [p_rdy<=p_i2]]] & ~ [AF [[[~ [r_active<=1] & [3<=p_rdy & 2<=r_moving]] | [[1<=initialize & 2<=off] | ~ [3<=p_rel]]]]]]]
normalized: E [~ [3<=move] U [EG [~ [[[[3<=p_rdy & 2<=r_moving] & ~ [r_active<=1]] | [~ [3<=p_rel] | [1<=initialize & 2<=off]]]]] & ~ [EG [~ [E [true U ~ [E [true U ~ [p_rdy<=p_i2]]]]]]]]]

abstracting: (p_rdy<=p_i2)
states: 101

EG iterations: 0
abstracting: (2<=off)
states: 4
abstracting: (1<=initialize)
states: 65
abstracting: (3<=p_rel)
states: 0
abstracting: (r_active<=1)
states: 46
abstracting: (2<=r_moving)
states: 2
abstracting: (3<=p_rdy)
states: 0
.
EG iterations: 1
abstracting: (3<=move)
states: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AX [p_i2<=3] | [[AF [A [~ [2<=p_rel] U 3<=initialize]] | AF [AF [EF [2<=r_stopped]]]] | AX [A [A [[p_m<=r_stopped & r_stopped<=moved] U ~ [p_rel<=p_i1]] U p_rel<=0]]]]
normalized: [[~ [EX [~ [[~ [EG [~ [p_rel<=0]]] & ~ [E [~ [p_rel<=0] U [~ [[~ [EG [p_rel<=p_i1]] & ~ [E [p_rel<=p_i1 U [~ [[p_m<=r_stopped & r_stopped<=moved]] & p_rel<=p_i1]]]]] & ~ [p_rel<=0]]]]]]]] | [~ [EG [EG [~ [E [true U 2<=r_stopped]]]]] | ~ [EG [~ [[~ [EG [~ [3<=initialize]]] & ~ [E [~ [3<=initialize] U [~ [3<=initialize] & 2<=p_rel]]]]]]]]] | ~ [EX [~ [p_i2<=3]]]]

abstracting: (p_i2<=3)
states: 110
.abstracting: (2<=p_rel)
states: 2
abstracting: (3<=initialize)
states: 3
abstracting: (3<=initialize)
states: 3
abstracting: (3<=initialize)
states: 3
.
EG iterations: 1
.
EG iterations: 1
abstracting: (2<=r_stopped)
states: 4
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p_rel<=0)
states: 90
abstracting: (p_rel<=p_i1)
states: 100
abstracting: (r_stopped<=moved)
states: 84
abstracting: (p_m<=r_stopped)
states: 65
abstracting: (p_rel<=p_i1)
states: 100
abstracting: (p_rel<=p_i1)
states: 100
........
EG iterations: 8
abstracting: (p_rel<=0)
states: 90
abstracting: (p_rel<=0)
states: 90
.
EG iterations: 1
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [EX [~ [[EX [p_rdy<=p_i2] & AG [EF [r_moving<=p_rdy]]]]] | AF [AX [[~ [[[r_moving<=access & p_i1<=2] | EX [r_stopped<=3]]] & ~ [[E [1<=p_rel U 2<=initialize] | AF [1<=p_sc]]]]]]]
normalized: [~ [EG [EX [~ [[~ [[~ [EG [~ [1<=p_sc]]] | E [1<=p_rel U 2<=initialize]]] & ~ [[EX [r_stopped<=3] | [r_moving<=access & p_i1<=2]]]]]]]] | EX [~ [[~ [E [true U ~ [E [true U r_moving<=p_rdy]]]] & EX [p_rdy<=p_i2]]]]]

abstracting: (p_rdy<=p_i2)
states: 101
.abstracting: (r_moving<=p_rdy)
states: 92
.abstracting: (p_i1<=2)
states: 107
abstracting: (r_moving<=access)
states: 100
abstracting: (r_stopped<=3)
states: 110
.abstracting: (2<=initialize)
states: 20
abstracting: (1<=p_rel)
states: 20
abstracting: (1<=p_sc)
states: 20
.
EG iterations: 1
.
EG iterations: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[AF [AG [access<=1]] | EG [~ [EX [initialize<=access]]]] | A [[[2<=p_i1 | [[1<=p_i1 & r_active<=2] & EF [1<=p_rdy]]] | move<=access] U [~ [p_sc<=1] | E [~ [3<=p_i1] U ~ [2<=p_rel]]]]]]
normalized: E [true U [[~ [EG [~ [[~ [p_sc<=1] | E [~ [3<=p_i1] U ~ [2<=p_rel]]]]]] & ~ [E [~ [[~ [p_sc<=1] | E [~ [3<=p_i1] U ~ [2<=p_rel]]]] U [~ [[~ [p_sc<=1] | E [~ [3<=p_i1] U ~ [2<=p_rel]]]] & ~ [[[[E [true U 1<=p_rdy] & [1<=p_i1 & r_active<=2]] | 2<=p_i1] | move<=access]]]]]] | [EG [~ [EX [initialize<=access]]] | ~ [EG [E [true U ~ [access<=1]]]]]]]

abstracting: (access<=1)
states: 80

EG iterations: 0
abstracting: (initialize<=access)
states: 82
.........
EG iterations: 8
abstracting: (move<=access)
states: 100
abstracting: (2<=p_i1)
states: 20
abstracting: (r_active<=2)
states: 110
abstracting: (1<=p_i1)
states: 65
abstracting: (1<=p_rdy)
states: 20
abstracting: (2<=p_rel)
states: 2
abstracting: (3<=p_i1)
states: 3
abstracting: (p_sc<=1)
states: 108
abstracting: (2<=p_rel)
states: 2
abstracting: (3<=p_i1)
states: 3
abstracting: (p_sc<=1)
states: 108
abstracting: (2<=p_rel)
states: 2
abstracting: (3<=p_i1)
states: 3
abstracting: (p_sc<=1)
states: 108
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EX [A [E [~ [AG [r_moving<=1]] U EG [AG [r_stopped<=r_moving]]] U [[[[p_rel<=p_i2 & p_i1<=0] | [[access<=0 | 2<=move] & EF [r_moving<=2]]] | moved<=initialized] & EF [~ [[initialized<=2 & 3<=r_active]]]]]]
normalized: EX [[~ [EG [~ [[E [true U ~ [[initialized<=2 & 3<=r_active]]] & [[[E [true U r_moving<=2] & [access<=0 | 2<=move]] | [p_rel<=p_i2 & p_i1<=0]] | moved<=initialized]]]]] & ~ [E [~ [[E [true U ~ [[initialized<=2 & 3<=r_active]]] & [[[E [true U r_moving<=2] & [access<=0 | 2<=move]] | [p_rel<=p_i2 & p_i1<=0]] | moved<=initialized]]] U [~ [E [E [true U ~ [r_moving<=1]] U EG [~ [E [true U ~ [r_stopped<=r_moving]]]]]] & ~ [[E [true U ~ [[initialized<=2 & 3<=r_active]]] & [[[E [true U r_moving<=2] & [access<=0 | 2<=move]] | [p_rel<=p_i2 & p_i1<=0]] | moved<=initialized]]]]]]]]

abstracting: (moved<=initialized)
states: 92
abstracting: (p_i1<=0)
states: 45
abstracting: (p_rel<=p_i2)
states: 101
abstracting: (2<=move)
states: 2
abstracting: (access<=0)
states: 30
abstracting: (r_moving<=2)
states: 110
abstracting: (3<=r_active)
states: 0
abstracting: (initialized<=2)
states: 110
abstracting: (r_stopped<=r_moving)
states: 84
.
EG iterations: 1
abstracting: (r_moving<=1)
states: 108
abstracting: (moved<=initialized)
states: 92
abstracting: (p_i1<=0)
states: 45
abstracting: (p_rel<=p_i2)
states: 101
abstracting: (2<=move)
states: 2
abstracting: (access<=0)
states: 30
abstracting: (r_moving<=2)
states: 110
abstracting: (3<=r_active)
states: 0
abstracting: (initialized<=2)
states: 110
abstracting: (moved<=initialized)
states: 92
abstracting: (p_i1<=0)
states: 45
abstracting: (p_rel<=p_i2)
states: 101
abstracting: (2<=move)
states: 2
abstracting: (access<=0)
states: 30
abstracting: (r_moving<=2)
states: 110
abstracting: (3<=r_active)
states: 0
abstracting: (initialized<=2)
states: 110
.....
EG iterations: 5
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [E [moved<=2 U AG [E [AF [p_m<=moved] U EX [off<=p_rel]]]] | AG [A [E [~ [A [off<=initialize U access<=move]] U AX [access<=p_sc]] U [[p_m<=p_rdy | [AX [2<=p_rdy] | EX [3<=r_stopped]]] & move<=2]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [[[[EX [3<=r_stopped] | ~ [EX [~ [2<=p_rdy]]]] | p_m<=p_rdy] & move<=2]]]] & ~ [E [~ [[[[EX [3<=r_stopped] | ~ [EX [~ [2<=p_rdy]]]] | p_m<=p_rdy] & move<=2]] U [~ [E [~ [[~ [EG [~ [access<=move]]] & ~ [E [~ [access<=move] U [~ [off<=initialize] & ~ [access<=move]]]]]] U ~ [EX [~ [access<=p_sc]]]]] & ~ [[[[EX [3<=r_stopped] | ~ [EX [~ [2<=p_rdy]]]] | p_m<=p_rdy] & move<=2]]]]]]]]] | E [moved<=2 U ~ [E [true U ~ [E [~ [EG [~ [p_m<=moved]]] U EX [off<=p_rel]]]]]]]

abstracting: (off<=p_rel)
states: 84
.abstracting: (p_m<=moved)
states: 72
.
EG iterations: 1
abstracting: (moved<=2)
states: 110
abstracting: (move<=2)
states: 110
abstracting: (p_m<=p_rdy)
states: 62
abstracting: (2<=p_rdy)
states: 2
.abstracting: (3<=r_stopped)
states: 0
.abstracting: (access<=p_sc)
states: 40
.abstracting: (access<=move)
states: 40
abstracting: (off<=initialize)
states: 100
abstracting: (access<=move)
states: 40
abstracting: (access<=move)
states: 40
.
EG iterations: 1
abstracting: (move<=2)
states: 110
abstracting: (p_m<=p_rdy)
states: 62
abstracting: (2<=p_rdy)
states: 2
.abstracting: (3<=r_stopped)
states: 0
.abstracting: (move<=2)
states: 110
abstracting: (p_m<=p_rdy)
states: 62
abstracting: (2<=p_rdy)
states: 2
.abstracting: (3<=r_stopped)
states: 0
..........
EG iterations: 9
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: ~ [EF [[[[~ [EF [p_sc<=p_sc]] | [EG [1<=p_m] & ~ [EX [initialize<=initialize]]]] | [[p_rel<=0 & A [off<=p_m U p_sc<=2]] | [E [initialize<=1 U off<=1] | [r_active<=3 | [r_active<=r_moving | 2<=r_active]]]]] & 3<=p_i2]]]
normalized: ~ [E [true U [[[[[[r_active<=r_moving | 2<=r_active] | r_active<=3] | E [initialize<=1 U off<=1]] | [[~ [EG [~ [p_sc<=2]]] & ~ [E [~ [p_sc<=2] U [~ [off<=p_m] & ~ [p_sc<=2]]]]] & p_rel<=0]] | [[~ [EX [initialize<=initialize]] & EG [1<=p_m]] | ~ [E [true U p_sc<=p_sc]]]] & 3<=p_i2]]]

abstracting: (3<=p_i2)
states: 6
abstracting: (p_sc<=p_sc)
states: 110
abstracting: (1<=p_m)
states: 54
.
EG iterations: 1
abstracting: (initialize<=initialize)
states: 110
.abstracting: (p_rel<=0)
states: 90
abstracting: (p_sc<=2)
states: 110
abstracting: (off<=p_m)
states: 90
abstracting: (p_sc<=2)
states: 110
abstracting: (p_sc<=2)
states: 110
.
EG iterations: 1
abstracting: (off<=1)
states: 106
abstracting: (initialize<=1)
states: 90
abstracting: (r_active<=3)
states: 110
abstracting: (2<=r_active)
states: 64
abstracting: (r_active<=r_moving)
states: 24
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AG [~ [3<=r_stopped]] | [E [initialize<=moved U [E [EF [p_i1<=1] U ~ [[3<=r_active & access<=p_rel]]] & ~ [EF [E [move<=1 U 2<=initialize]]]]] | [AG [A [[[3<=r_moving | p_i2<=access] & [3<=r_stopped | r_moving<=1]] U 1<=initialized]] | ~ [AF [move<=r_moving]]]]]
normalized: [[[EG [~ [move<=r_moving]] | ~ [E [true U ~ [[~ [EG [~ [1<=initialized]]] & ~ [E [~ [1<=initialized] U [~ [[[3<=r_stopped | r_moving<=1] & [3<=r_moving | p_i2<=access]]] & ~ [1<=initialized]]]]]]]]] | E [initialize<=moved U [~ [E [true U E [move<=1 U 2<=initialize]]] & E [E [true U p_i1<=1] U ~ [[3<=r_active & access<=p_rel]]]]]] | ~ [E [true U 3<=r_stopped]]]

abstracting: (3<=r_stopped)
states: 0
abstracting: (access<=p_rel)
states: 40
abstracting: (3<=r_active)
states: 0
abstracting: (p_i1<=1)
states: 90
abstracting: (2<=initialize)
states: 20
abstracting: (move<=1)
states: 108
abstracting: (initialize<=moved)
states: 54
abstracting: (1<=initialized)
states: 20
abstracting: (p_i2<=access)
states: 74
abstracting: (3<=r_moving)
states: 0
abstracting: (r_moving<=1)
states: 108
abstracting: (3<=r_stopped)
states: 0
abstracting: (1<=initialized)
states: 20
abstracting: (1<=initialized)
states: 20
.......
EG iterations: 7
abstracting: (move<=r_moving)
states: 92
....
EG iterations: 4
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [E [[[[AX [EX [1<=p_i2]] | ~ [[E [2<=initialized U off<=1] | r_active<=0]]] | [E [AF [initialized<=2] U [r_stopped<=p_rel | p_rel<=off]] & [AF [p_rdy<=2] & AX [r_moving<=2]]]] | [[~ [AX [moved<=2]] | 1<=off] & EG [E [initialize<=2 U moved<=0]]]] U ~ [EG [AX [[move<=r_moving | p_i2<=2]]]]]]
normalized: ~ [E [[[[EX [~ [moved<=2]] | 1<=off] & EG [E [initialize<=2 U moved<=0]]] | [[[~ [EX [~ [r_moving<=2]]] & ~ [EG [~ [p_rdy<=2]]]] & E [~ [EG [~ [initialized<=2]]] U [r_stopped<=p_rel | p_rel<=off]]] | [~ [[E [2<=initialized U off<=1] | r_active<=0]] | ~ [EX [~ [EX [1<=p_i2]]]]]]] U ~ [EG [~ [EX [~ [[move<=r_moving | p_i2<=2]]]]]]]]

abstracting: (p_i2<=2)
states: 104
abstracting: (move<=r_moving)
states: 92
.
EG iterations: 0
abstracting: (1<=p_i2)
states: 74
..abstracting: (r_active<=0)
states: 9
abstracting: (off<=1)
states: 106
abstracting: (2<=initialized)
states: 2
abstracting: (p_rel<=off)
states: 93
abstracting: (r_stopped<=p_rel)
states: 84
abstracting: (initialized<=2)
states: 110
.
EG iterations: 1
abstracting: (p_rdy<=2)
states: 110
.
EG iterations: 1
abstracting: (r_moving<=2)
states: 110
.abstracting: (moved<=0)
states: 90
abstracting: (initialize<=2)
states: 107

EG iterations: 0
abstracting: (1<=off)
states: 29
abstracting: (moved<=2)
states: 110
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[A [[E [E [p_sc<=access U off<=3] U AX [r_active<=0]] | 2<=moved] U A [[[r_stopped<=1 | initialize<=3] & AG [p_rel<=initialized]] U [[p_rdy<=0 & p_i1<=r_active] | EG [2<=p_rdy]]]] | [[E [EX [3<=access] U ~ [[p_i2<=3 & r_stopped<=p_sc]]] & ~ [E [A [move<=2 U initialize<=1] U [3<=p_i1 | 3<=p_i1]]]] & [AX [p_m<=0] & ~ [[EX [1<=move] & p_m<=access]]]]]]
normalized: ~ [EG [~ [[[[~ [E [[~ [EG [~ [initialize<=1]]] & ~ [E [~ [initialize<=1] U [~ [move<=2] & ~ [initialize<=1]]]]] U [3<=p_i1 | 3<=p_i1]]] & E [EX [3<=access] U ~ [[p_i2<=3 & r_stopped<=p_sc]]]] & [~ [[EX [1<=move] & p_m<=access]] & ~ [EX [~ [p_m<=0]]]]] | [~ [EG [~ [[~ [EG [~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]]]] & ~ [E [~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]] U [~ [[~ [E [true U ~ [p_rel<=initialized]]] & [r_stopped<=1 | initialize<=3]]] & ~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]]]] & ~ [E [~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]] U [~ [[~ [E [true U ~ [p_rel<=initialized]]] & [r_stopped<=1 | initialize<=3]]] & ~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]]]]]]] U [~ [[E [E [p_sc<=access U off<=3] U ~ [EX [~ [r_active<=0]]]] | 2<=moved]] & ~ [[~ [EG [~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]]]] & ~ [E [~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]] U [~ [[~ [E [true U ~ [p_rel<=initialized]]] & [r_stopped<=1 | initialize<=3]]] & ~ [[EG [2<=p_rdy] | [p_rdy<=0 & p_i1<=r_active]]]]]]]]]]]]]]]]

abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
abstracting: (initialize<=3)
states: 110
abstracting: (r_stopped<=1)
states: 106
abstracting: (p_rel<=initialized)
states: 92
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
..
EG iterations: 2
abstracting: (2<=moved)
states: 2
abstracting: (r_active<=0)
states: 9
.abstracting: (off<=3)
states: 110
abstracting: (p_sc<=access)
states: 100
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
abstracting: (initialize<=3)
states: 110
abstracting: (r_stopped<=1)
states: 106
abstracting: (p_rel<=initialized)
states: 92
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
..
EG iterations: 2
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
abstracting: (initialize<=3)
states: 110
abstracting: (r_stopped<=1)
states: 106
abstracting: (p_rel<=initialized)
states: 92
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
abstracting: (p_i1<=r_active)
states: 94
abstracting: (p_rdy<=0)
states: 90
abstracting: (2<=p_rdy)
states: 2
...
EG iterations: 3
..
EG iterations: 2
..
EG iterations: 2
abstracting: (p_m<=0)
states: 56
.abstracting: (p_m<=access)
states: 86
abstracting: (1<=move)
states: 20
.abstracting: (r_stopped<=p_sc)
states: 84
abstracting: (p_i2<=3)
states: 110
abstracting: (3<=access)
states: 0
.abstracting: (3<=p_i1)
states: 3
abstracting: (3<=p_i1)
states: 3
abstracting: (initialize<=1)
states: 90
abstracting: (move<=2)
states: 110
abstracting: (initialize<=1)
states: 90
abstracting: (initialize<=1)
states: 90
.
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE

FORMULA RobotManipulation-PT-00001-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [EG [p_rdy<=0] | A [[E [[E [p_rel<=3 U 3<=r_stopped] | [~ [p_sc<=off] & [1<=p_i2 | initialize<=2]]] U EG [AG [initialized<=0]]] | access<=1] U [A [3<=p_sc U [[[p_rel<=initialize | 1<=initialized] | E [2<=access U p_rel<=1]] | [EX [off<=access] | EX [p_sc<=r_active]]]] | [~ [[[AG [r_active<=0] | [p_sc<=move | 3<=p_m]] | [~ [3<=moved] & A [p_m<=1 U r_stopped<=initialize]]]] | [~ [EF [p_i2<=p_i1]] & ~ [A [r_active<=0 U initialized<=2]]]]]]]
normalized: [[~ [EG [~ [[[[~ [[~ [EG [~ [initialized<=2]]] & ~ [E [~ [initialized<=2] U [~ [r_active<=0] & ~ [initialized<=2]]]]]] & ~ [E [true U p_i2<=p_i1]]] | ~ [[[[~ [EG [~ [r_stopped<=initialize]]] & ~ [E [~ [r_stopped<=initialize] U [~ [p_m<=1] & ~ [r_stopped<=initialize]]]]] & ~ [3<=moved]] | [[p_sc<=move | 3<=p_m] | ~ [E [true U ~ [r_active<=0]]]]]]] | [~ [EG [~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]]]] & ~ [E [~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]] U [~ [3<=p_sc] & ~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]]]]]]]]]] & ~ [E [~ [[[[~ [[~ [EG [~ [initialized<=2]]] & ~ [E [~ [initialized<=2] U [~ [r_active<=0] & ~ [initialized<=2]]]]]] & ~ [E [true U p_i2<=p_i1]]] | ~ [[[[~ [EG [~ [r_stopped<=initialize]]] & ~ [E [~ [r_stopped<=initialize] U [~ [p_m<=1] & ~ [r_stopped<=initialize]]]]] & ~ [3<=moved]] | [[p_sc<=move | 3<=p_m] | ~ [E [true U ~ [r_active<=0]]]]]]] | [~ [EG [~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]]]] & ~ [E [~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]] U [~ [3<=p_sc] & ~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]]]]]]]] U [~ [[E [[[[1<=p_i2 | initialize<=2] & ~ [p_sc<=off]] | E [p_rel<=3 U 3<=r_stopped]] U EG [~ [E [true U ~ [initialized<=0]]]]] | access<=1]] & ~ [[[[~ [[~ [EG [~ [initialized<=2]]] & ~ [E [~ [initialized<=2] U [~ [r_active<=0] & ~ [initialized<=2]]]]]] & ~ [E [true U p_i2<=p_i1]]] | ~ [[[[~ [EG [~ [r_stopped<=initialize]]] & ~ [E [~ [r_stopped<=initialize] U [~ [p_m<=1] & ~ [r_stopped<=initialize]]]]] & ~ [3<=moved]] | [[p_sc<=move | 3<=p_m] | ~ [E [true U ~ [r_active<=0]]]]]]] | [~ [EG [~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]]]] & ~ [E [~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]] U [~ [3<=p_sc] & ~ [[[EX [p_sc<=r_active] | EX [off<=access]] | [E [2<=access U p_rel<=1] | [p_rel<=initialize | 1<=initialized]]]]]]]]]]]]]] | EG [p_rdy<=0]]

abstracting: (p_rdy<=0)
states: 90
...........
EG iterations: 11
abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
.abstracting: (3<=p_sc)
states: 0
abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
.abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
..
EG iterations: 1
abstracting: (r_active<=0)
states: 9
abstracting: (3<=p_m)
states: 0
abstracting: (p_sc<=move)
states: 92
abstracting: (3<=moved)
states: 0
abstracting: (r_stopped<=initialize)
states: 100
abstracting: (p_m<=1)
states: 98
abstracting: (r_stopped<=initialize)
states: 100
abstracting: (r_stopped<=initialize)
states: 100
.
EG iterations: 1
abstracting: (p_i2<=p_i1)
states: 59
abstracting: (initialized<=2)
states: 110
abstracting: (r_active<=0)
states: 9
abstracting: (initialized<=2)
states: 110
abstracting: (initialized<=2)
states: 110
.
EG iterations: 1
abstracting: (access<=1)
states: 80
abstracting: (initialized<=0)
states: 90
.
EG iterations: 1
abstracting: (3<=r_stopped)
states: 0
abstracting: (p_rel<=3)
states: 110
abstracting: (p_sc<=off)
states: 93
abstracting: (initialize<=2)
states: 107
abstracting: (1<=p_i2)
states: 74
abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
.abstracting: (3<=p_sc)
states: 0
abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
.abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
..
EG iterations: 1
abstracting: (r_active<=0)
states: 9
abstracting: (3<=p_m)
states: 0
abstracting: (p_sc<=move)
states: 92
abstracting: (3<=moved)
states: 0
abstracting: (r_stopped<=initialize)
states: 100
abstracting: (p_m<=1)
states: 98
abstracting: (r_stopped<=initialize)
states: 100
abstracting: (r_stopped<=initialize)
states: 100
.
EG iterations: 1
abstracting: (p_i2<=p_i1)
states: 59
abstracting: (initialized<=2)
states: 110
abstracting: (r_active<=0)
states: 9
abstracting: (initialized<=2)
states: 110
abstracting: (initialized<=2)
states: 110
.
EG iterations: 1
abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
.abstracting: (3<=p_sc)
states: 0
abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
.abstracting: (1<=initialized)
states: 20
abstracting: (p_rel<=initialize)
states: 100
abstracting: (p_rel<=1)
states: 108
abstracting: (2<=access)
states: 30
abstracting: (off<=access)
states: 110
.abstracting: (p_sc<=r_active)
states: 110
..
EG iterations: 1
abstracting: (r_active<=0)
states: 9
abstracting: (3<=p_m)
states: 0
abstracting: (p_sc<=move)
states: 92
abstracting: (3<=moved)
states: 0
abstracting: (r_stopped<=initialize)
states: 100
abstracting: (p_m<=1)
states: 98
abstracting: (r_stopped<=initialize)
states: 100
abstracting: (r_stopped<=initialize)
states: 100
.
EG iterations: 1
abstracting: (p_i2<=p_i1)
states: 59
abstracting: (initialized<=2)
states: 110
abstracting: (r_active<=0)
states: 9
abstracting: (initialized<=2)
states: 110
abstracting: (initialized<=2)
states: 110
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RobotManipulation-PT-00001-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

totally nodes used: 5865 (5.9e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11475 19659 31134
used/not used/entry size/cache size: 24131 67084733 16 1024MB
basic ops cache: hits/miss/sum: 5578 12063 17641
used/not used/entry size/cache size: 19077 16758139 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: 1022 1261 2283
used/not used/entry size/cache size: 1261 8387347 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 67103534
1 5120
2 92
3 50
4 36
5 6
6 11
7 3
8 3
9 1
>= 10 8

Total processing time: 0m 6.822sec


BK_STOP 1678948322585

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

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:97 (8), effective:21 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

iterations count:66 (6), effective:13 (1)

iterations count:89 (8), effective:18 (1)

iterations count:87 (7), effective:16 (1)

iterations count:42 (3), effective:7 (0)

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

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

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

iterations count:65 (5), effective:10 (0)

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

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

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

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

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

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

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

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

iterations count:93 (8), effective:18 (1)

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

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

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

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

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

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

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

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

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

iterations count:34 (3), effective:4 (0)

iterations count:61 (5), effective:13 (1)

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

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

iterations count:79 (7), effective:15 (1)

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

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

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

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

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

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

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

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

iterations count:31 (2), effective:2 (0)

iterations count:54 (4), effective:10 (0)

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

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

iterations count:116 (10), effective:24 (2)

iterations count:54 (4), effective:10 (0)

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

iterations count:54 (4), effective:10 (0)

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

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

iterations count:96 (8), effective:18 (1)

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

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

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

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

iterations count:64 (5), effective:12 (1)

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

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

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

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

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

iterations count:64 (5), effective:12 (1)

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

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

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

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

iterations count:64 (5), effective:12 (1)

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="RobotManipulation-PT-00001"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is RobotManipulation-PT-00001, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r353-smll-167891800400001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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