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.r010-oct2-167813599200566.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-03a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 42K 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 AutonomousCar-PT-03a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-03a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678698934327

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:15:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:15:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:15:37] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-13 09:15:37] [INFO ] Transformed 41 places.
[2023-03-13 09:15:37] [INFO ] Transformed 121 transitions.
[2023-03-13 09:15:37] [INFO ] Found NUPN structural information;
[2023-03-13 09:15:37] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 592 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 7) seen :3
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 09:15:38] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 41 cols
[2023-03-13 09:15:38] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-13 09:15:38] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:15:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 33 ms returned sat
[2023-03-13 09:15:38] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1204 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutonomousCar_PT_03a
(NrP: 41 NrTr: 121 NrArc: 745)

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

net check time: 0m 0.000sec

init dd package: 0m 2.843sec


RS generation: 0m 0.038sec


-> reachability set: #nodes 1148 (1.1e+03) #states 22,521 (4)



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

checking: AG [p39<=1]
normalized: ~ [E [true U ~ [p39<=1]]]

abstracting: (p39<=1)
states: 22,521 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p6<=1]
normalized: ~ [E [true U ~ [p6<=1]]]

abstracting: (p6<=1)
states: 22,521 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=p35]
normalized: E [true U 1<=p35]

abstracting: (1<=p35)
states: 4,363 (3)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: AG [1<=p14]
normalized: ~ [E [true U ~ [1<=p14]]]

abstracting: (1<=p14)
states: 2,917 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [~ [1<=p29]]
normalized: E [true U ~ [1<=p29]]

abstracting: (1<=p29)
states: 686
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [~ [p38<=p18]]
normalized: E [true U ~ [p38<=p18]]

abstracting: (p38<=p18)
states: 18,717 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: AG [[~ [1<=p37] | [p36<=p28 | p32<=p23]]]
normalized: ~ [E [true U ~ [[[p36<=p28 | p32<=p23] | ~ [1<=p37]]]]]

abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p32<=p23)
states: 19,653 (4)
abstracting: (p36<=p28)
states: 5,050 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.105sec

checking: EF [[[[[p1<=p0 | p6<=p4] | ~ [[~ [p36<=1] & ~ [p40<=1]]]] & ~ [[p20<=1 | ~ [[[1<=p8 | p9<=p26] | 1<=p40]]]]] & ~ [[~ [1<=p13] & p17<=1]]]]
normalized: E [true U [~ [[~ [1<=p13] & p17<=1]] & [~ [[~ [[[1<=p8 | p9<=p26] | 1<=p40]] | p20<=1]] & [~ [[~ [p40<=1] & ~ [p36<=1]]] | [p1<=p0 | p6<=p4]]]]]

abstracting: (p6<=p4)
states: 17,734 (4)
abstracting: (p1<=p0)
states: 1
abstracting: (p36<=1)
states: 22,521 (4)
abstracting: (p40<=1)
states: 22,521 (4)
abstracting: (p20<=1)
states: 22,521 (4)
abstracting: (1<=p40)
states: 3,010 (3)
abstracting: (p9<=p26)
states: 20,043 (4)
abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (p17<=1)
states: 22,521 (4)
abstracting: (1<=p13)
states: 4,016 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[~ [[~ [p26<=0] | [p13<=p0 | ~ [[[[~ [p13<=1] & ~ [p27<=0]] & [p7<=0 & ~ [p28<=0]]] & p35<=1]]]]] & [[p27<=0 & [~ [1<=p8] & ~ [[~ [[1<=p29 & [1<=p14 & p25<=p1]]] | p28<=1]]]] | 1<=p21]]]
normalized: E [true U [[1<=p21 | [p27<=0 & [~ [[p28<=1 | ~ [[1<=p29 & [1<=p14 & p25<=p1]]]]] & ~ [1<=p8]]]] & ~ [[[p13<=p0 | ~ [[p35<=1 & [[p7<=0 & ~ [p28<=0]] & [~ [p27<=0] & ~ [p13<=1]]]]]] | ~ [p26<=0]]]]]

abstracting: (p26<=0)
states: 19,604 (4)
abstracting: (p13<=1)
states: 22,521 (4)
abstracting: (p27<=0)
states: 18,505 (4)
abstracting: (p28<=0)
states: 21,835 (4)
abstracting: (p7<=0)
states: 19,604 (4)
abstracting: (p35<=1)
states: 22,521 (4)
abstracting: (p13<=p0)
states: 18,505 (4)
abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (p25<=p1)
states: 22,521 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (1<=p29)
states: 686
abstracting: (p28<=1)
states: 22,521 (4)
abstracting: (p27<=0)
states: 18,505 (4)
abstracting: (1<=p21)
states: 2,917 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [~ [[1<=p36 & [1<=p35 & ~ [[[1<=p1 & [[p17<=0 | ~ [1<=p14]] | [[p30<=1 & p2<=0] | [p19<=1 & p40<=p32]]]] | ~ [[[[1<=p34 & p25<=p30] | 1<=p32] & [[p38<=p21 & 1<=p35] | [1<=p1 & 1<=p14]]]]]]]]]]
normalized: ~ [E [true U [1<=p36 & [1<=p35 & ~ [[~ [[[[1<=p1 & 1<=p14] | [p38<=p21 & 1<=p35]] & [1<=p32 | [1<=p34 & p25<=p30]]]] | [1<=p1 & [[[p19<=1 & p40<=p32] | [p30<=1 & p2<=0]] | [p17<=0 | ~ [1<=p14]]]]]]]]]]

abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p17<=0)
states: 18,506 (4)
abstracting: (p2<=0)
states: 18,531 (4)
abstracting: (p30<=1)
states: 22,521 (4)
abstracting: (p40<=p32)
states: 20,099 (4)
abstracting: (p19<=1)
states: 22,521 (4)
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (p25<=p30)
states: 19,702 (4)
abstracting: (1<=p34)
states: 5,949 (3)
abstracting: (1<=p32)
states: 3,204 (3)
abstracting: (1<=p35)
states: 4,363 (3)
abstracting: (p38<=p21)
states: 18,717 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (1<=p35)
states: 4,363 (3)
abstracting: (1<=p36)
states: 18,157 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [~ [[[[~ [[[~ [p7<=1] & ~ [p3<=p9]] & ~ [p25<=p27]]] & ~ [[p6<=0 | ~ [1<=p20]]]] & p7<=0] | [[[p11<=p32 | p12<=p37] | [p25<=p0 & ~ [p7<=p10]]] | [p7<=p7 & [~ [[[p34<=1 | p21<=0] | [p19<=p24 | 1<=p12]]] | [[~ [1<=p15] | [p11<=p0 & p26<=p40]] & p30<=p17]]]]]]]
normalized: E [true U ~ [[[[p7<=p7 & [[p30<=p17 & [[p11<=p0 & p26<=p40] | ~ [1<=p15]]] | ~ [[[p19<=p24 | 1<=p12] | [p34<=1 | p21<=0]]]]] | [[p25<=p0 & ~ [p7<=p10]] | [p11<=p32 | p12<=p37]]] | [p7<=0 & [~ [[p6<=0 | ~ [1<=p20]]] & ~ [[~ [p25<=p27] & [~ [p3<=p9] & ~ [p7<=1]]]]]]]]]

abstracting: (p7<=1)
states: 22,521 (4)
abstracting: (p3<=p9)
states: 19,287 (4)
abstracting: (p25<=p27)
states: 19,604 (4)
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (p6<=0)
states: 17,734 (4)
abstracting: (p7<=0)
states: 19,604 (4)
abstracting: (p12<=p37)
states: 20,163 (4)
abstracting: (p11<=p32)
states: 19,960 (4)
abstracting: (p7<=p10)
states: 19,604 (4)
abstracting: (p25<=p0)
states: 19,604 (4)
abstracting: (p21<=0)
states: 19,604 (4)
abstracting: (p34<=1)
states: 22,521 (4)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p19<=p24)
states: 20,181 (4)
abstracting: (1<=p15)
states: 2,917 (3)
abstracting: (p26<=p40)
states: 19,991 (4)
abstracting: (p11<=p0)
states: 19,604 (4)
abstracting: (p30<=p17)
states: 21,933 (4)
abstracting: (p7<=p7)
states: 22,521 (4)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[~ [[[p36<=p39 | ~ [[[[p36<=0 & p36<=p14] | [1<=p4 | p0<=1]] & [~ [1<=p12] | ~ [p39<=p36]]]]] & ~ [[~ [p9<=p32] & ~ [[~ [p15<=p31] & ~ [p33<=1]]]]]]] | [[[p31<=1 & [p6<=p5 | ~ [[p27<=0 & ~ [p27<=p30]]]]] | [~ [[[[p35<=0 | 1<=p8] & ~ [1<=p26]] | 1<=p21]] | ~ [[~ [p25<=p26] & 1<=p10]]]] | [p33<=p26 & ~ [1<=p36]]]] | 1<=p10]]
normalized: ~ [E [true U ~ [[1<=p10 | [[[p33<=p26 & ~ [1<=p36]] | [[~ [[1<=p10 & ~ [p25<=p26]]] | ~ [[1<=p21 | [~ [1<=p26] & [p35<=0 | 1<=p8]]]]] | [p31<=1 & [p6<=p5 | ~ [[p27<=0 & ~ [p27<=p30]]]]]]] | ~ [[~ [[~ [[~ [p33<=1] & ~ [p15<=p31]]] & ~ [p9<=p32]]] & [p36<=p39 | ~ [[[~ [p39<=p36] | ~ [1<=p12]] & [[1<=p4 | p0<=1] | [p36<=0 & p36<=p14]]]]]]]]]]]]

abstracting: (p36<=p14)
states: 6,722 (3)
abstracting: (p36<=0)
states: 4,364 (3)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p39<=p36)
states: 18,158 (4)
abstracting: (p36<=p39)
states: 10,785 (4)
abstracting: (p9<=p32)
states: 20,036 (4)
abstracting: (p15<=p31)
states: 19,960 (4)
abstracting: (p33<=1)
states: 22,521 (4)
abstracting: (p27<=p30)
states: 18,603 (4)
abstracting: (p27<=0)
states: 18,505 (4)
abstracting: (p6<=p5)
states: 17,734 (4)
abstracting: (p31<=1)
states: 22,521 (4)
abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (p35<=0)
states: 18,158 (4)
abstracting: (1<=p26)
states: 2,917 (3)
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p25<=p26)
states: 19,604 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (1<=p36)
states: 18,157 (4)
abstracting: (p33<=p26)
states: 15,579 (4)
abstracting: (1<=p10)
states: 4,015 (3)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: AG [[[~ [[[1<=p26 | ~ [p30<=0]] | [p15<=p9 | [[[[1<=p14 | p31<=1] | [p38<=p21 & p10<=p22]] | p4<=p15] | [[p5<=0 | [1<=p13 | p2<=1]] | ~ [[1<=p15 | p6<=1]]]]]]] | p29<=p4] | ~ [[[[[1<=p14 & ~ [p21<=0]] | [1<=p25 | ~ [[p13<=p6 | p3<=1]]]] & ~ [[p14<=1 | [p4<=0 & [~ [p34<=p23] & [1<=p28 | 1<=p10]]]]]] & p12<=p19]]]]
normalized: ~ [E [true U ~ [[~ [[p12<=p19 & [~ [[p14<=1 | [p4<=0 & [[1<=p28 | 1<=p10] & ~ [p34<=p23]]]]] & [[1<=p25 | ~ [[p13<=p6 | p3<=1]]] | [1<=p14 & ~ [p21<=0]]]]]] | [p29<=p4 | ~ [[[p15<=p9 | [[~ [[1<=p15 | p6<=1]] | [p5<=0 | [1<=p13 | p2<=1]]] | [p4<=p15 | [[p38<=p21 & p10<=p22] | [1<=p14 | p31<=1]]]]] | [1<=p26 | ~ [p30<=0]]]]]]]]]

abstracting: (p30<=0)
states: 21,835 (4)
abstracting: (1<=p26)
states: 2,917 (3)
abstracting: (p31<=1)
states: 22,521 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p10<=p22)
states: 19,083 (4)
abstracting: (p38<=p21)
states: 18,717 (4)
abstracting: (p4<=p15)
states: 18,141 (4)
abstracting: (p2<=1)
states: 22,521 (4)
abstracting: (1<=p13)
states: 4,016 (3)
abstracting: (p5<=0)
states: 17,536 (4)
abstracting: (p6<=1)
states: 22,521 (4)
abstracting: (1<=p15)
states: 2,917 (3)
abstracting: (p15<=p9)
states: 19,947 (4)
abstracting: (p29<=p4)
states: 21,835 (4)
abstracting: (p21<=0)
states: 19,604 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p3<=1)
states: 22,521 (4)
abstracting: (p13<=p6)
states: 19,446 (4)
abstracting: (1<=p25)
states: 2,917 (3)
abstracting: (p34<=p23)
states: 17,300 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (1<=p28)
states: 686
abstracting: (p4<=0)
states: 17,536 (4)
abstracting: (p14<=1)
states: 22,521 (4)
abstracting: (p12<=p19)
states: 19,959 (4)
-> the formula is TRUE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[1<=p10 & [[[[~ [[[1<=p20 | 1<=p14] | [p24<=0 & 1<=p6]]] & 1<=p16] & [[[~ [[1<=p38 | p40<=0]] | [1<=p37 | p33<=p33]] | p15<=0] & [[[p31<=0 & p3<=1] | ~ [[1<=p32 | 1<=p26]]] & [[[p12<=p12 & 1<=p1] & p15<=p22] & [p18<=1 & ~ [1<=p10]]]]]] & [~ [p37<=1] & [[1<=p18 & [[~ [p7<=0] & ~ [1<=p12]] & [~ [1<=p15] | [1<=p34 & p18<=p36]]]] & [[~ [1<=p37] | [[p26<=p22 | p0<=1] & p11<=p14]] & [[p10<=p34 & ~ [p13<=0]] & [[1<=p30 & 1<=p31] | [p5<=0 & p35<=1]]]]]]] & ~ [1<=p40]]]]
normalized: E [true U [1<=p10 & [~ [1<=p40] & [[[[[[[p5<=0 & p35<=1] | [1<=p30 & 1<=p31]] & [p10<=p34 & ~ [p13<=0]]] & [[p11<=p14 & [p26<=p22 | p0<=1]] | ~ [1<=p37]]] & [1<=p18 & [[[1<=p34 & p18<=p36] | ~ [1<=p15]] & [~ [1<=p12] & ~ [p7<=0]]]]] & ~ [p37<=1]] & [[[[[p18<=1 & ~ [1<=p10]] & [p15<=p22 & [p12<=p12 & 1<=p1]]] & [~ [[1<=p32 | 1<=p26]] | [p31<=0 & p3<=1]]] & [p15<=0 | [[1<=p37 | p33<=p33] | ~ [[1<=p38 | p40<=0]]]]] & [1<=p16 & ~ [[[p24<=0 & 1<=p6] | [1<=p20 | 1<=p14]]]]]]]]]

abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (1<=p6)
states: 4,787 (3)
abstracting: (p24<=0)
states: 18,506 (4)
abstracting: (1<=p16)
states: 2,821 (3)
abstracting: (p40<=0)
states: 19,511 (4)
abstracting: (1<=p38)
states: 4,363 (3)
abstracting: (p33<=p33)
states: 22,521 (4)
abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p15<=0)
states: 19,604 (4)
abstracting: (p3<=1)
states: 22,521 (4)
abstracting: (p31<=0)
states: 19,317 (4)
abstracting: (1<=p26)
states: 2,917 (3)
abstracting: (1<=p32)
states: 3,204 (3)
abstracting: (1<=p1)
states: 22,520 (4)
abstracting: (p12<=p12)
states: 22,521 (4)
abstracting: (p15<=p22)
states: 19,959 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p18<=1)
states: 22,521 (4)
abstracting: (p37<=1)
states: 22,521 (4)
abstracting: (p7<=0)
states: 19,604 (4)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (1<=p15)
states: 2,917 (3)
abstracting: (p18<=p36)
states: 21,962 (4)
abstracting: (1<=p34)
states: 5,949 (3)
abstracting: (1<=p18)
states: 2,917 (3)
abstracting: (1<=p37)
states: 4,363 (3)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (p26<=p22)
states: 19,604 (4)
abstracting: (p11<=p14)
states: 19,959 (4)
abstracting: (p13<=0)
states: 18,505 (4)
abstracting: (p10<=p34)
states: 19,620 (4)
abstracting: (1<=p31)
states: 3,204 (3)
abstracting: (1<=p30)
states: 686
abstracting: (p35<=1)
states: 22,521 (4)
abstracting: (p5<=0)
states: 17,536 (4)
abstracting: (1<=p40)
states: 3,010 (3)
abstracting: (1<=p10)
states: 4,015 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[~ [[[[[[1<=p13 & p27<=0] | [p29<=1 | [[1<=p4 & p7<=1] & [1<=p22 & p23<=p31]]]] & ~ [[p14<=0 | [p38<=0 | [p19<=p28 | 1<=p22]]]]] & p27<=0] | [[1<=p4 & 1<=p38] | [[[[[1<=p15 & p19<=p38] & p35<=1] | [~ [1<=p20] & [p14<=p25 | p17<=0]]] | ~ [[1<=p23 | p25<=p38]]] & [[[[p21<=p13 | 1<=p4] | [1<=p31 | p34<=p29]] | [1<=p31 & 1<=p40]] | ~ [1<=p28]]]]]] & ~ [[[[[[1<=p0 | [p30<=0 & p6<=p3]] | [[p31<=p30 & p37<=p3] | [p34<=0 & p16<=p34]]] & [p18<=p35 & [1<=p10 & ~ [p16<=1]]]] | ~ [[[p4<=p33 & ~ [p22<=1]] | ~ [[p26<=1 | 1<=p21]]]]] | [1<=p30 | [~ [1<=p22] & [[[p29<=0 | 1<=p0] & [p40<=1 & 1<=p27]] | p28<=0]]]]]]]
normalized: E [true U [~ [[[1<=p30 | [[p28<=0 | [[p40<=1 & 1<=p27] & [p29<=0 | 1<=p0]]] & ~ [1<=p22]]] | [~ [[~ [[p26<=1 | 1<=p21]] | [p4<=p33 & ~ [p22<=1]]]] | [[p18<=p35 & [1<=p10 & ~ [p16<=1]]] & [[[p34<=0 & p16<=p34] | [p31<=p30 & p37<=p3]] | [1<=p0 | [p30<=0 & p6<=p3]]]]]]] & ~ [[[[[~ [1<=p28] | [[1<=p31 & 1<=p40] | [[1<=p31 | p34<=p29] | [p21<=p13 | 1<=p4]]]] & [~ [[1<=p23 | p25<=p38]] | [[[p14<=p25 | p17<=0] & ~ [1<=p20]] | [p35<=1 & [1<=p15 & p19<=p38]]]]] | [1<=p4 & 1<=p38]] | [p27<=0 & [~ [[p14<=0 | [p38<=0 | [p19<=p28 | 1<=p22]]]] & [[p29<=1 | [[1<=p22 & p23<=p31] & [1<=p4 & p7<=1]]] | [1<=p13 & p27<=0]]]]]]]]

abstracting: (p27<=0)
states: 18,505 (4)
abstracting: (1<=p13)
states: 4,016 (3)
abstracting: (p7<=1)
states: 22,521 (4)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p23<=p31)
states: 20,036 (4)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (p29<=1)
states: 22,521 (4)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (p19<=p28)
states: 19,702 (4)
abstracting: (p38<=0)
states: 18,158 (4)
abstracting: (p14<=0)
states: 19,604 (4)
abstracting: (p27<=0)
states: 18,505 (4)
abstracting: (1<=p38)
states: 4,363 (3)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p19<=p38)
states: 20,163 (4)
abstracting: (1<=p15)
states: 2,917 (3)
abstracting: (p35<=1)
states: 22,521 (4)
abstracting: (1<=p20)
states: 4,016 (3)
abstracting: (p17<=0)
states: 18,506 (4)
abstracting: (p14<=p25)
states: 19,959 (4)
abstracting: (p25<=p38)
states: 20,163 (4)
abstracting: (1<=p23)
states: 2,821 (3)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p21<=p13)
states: 20,181 (4)
abstracting: (p34<=p29)
states: 16,572 (4)
abstracting: (1<=p31)
states: 3,204 (3)
abstracting: (1<=p40)
states: 3,010 (3)
abstracting: (1<=p31)
states: 3,204 (3)
abstracting: (1<=p28)
states: 686
abstracting: (p6<=p3)
states: 17,734 (4)
abstracting: (p30<=0)
states: 21,835 (4)
abstracting: (1<=p0)
states: 1
abstracting: (p37<=p3)
states: 18,844 (4)
abstracting: (p31<=p30)
states: 19,317 (4)
abstracting: (p16<=p34)
states: 20,428 (4)
abstracting: (p34<=0)
states: 16,572 (4)
abstracting: (p16<=1)
states: 22,521 (4)
abstracting: (1<=p10)
states: 4,015 (3)
abstracting: (p18<=p35)
states: 20,163 (4)
abstracting: (p22<=1)
states: 22,521 (4)
abstracting: (p4<=p33)
states: 19,251 (4)
abstracting: (1<=p21)
states: 2,917 (3)
abstracting: (p26<=1)
states: 22,521 (4)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p29<=0)
states: 21,835 (4)
abstracting: (1<=p27)
states: 4,016 (3)
abstracting: (p40<=1)
states: 22,521 (4)
abstracting: (p28<=0)
states: 21,835 (4)
abstracting: (1<=p30)
states: 686
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[[[[[1<=p14 | ~ [[[[p19<=p26 & p10<=1] & p2<=p6] | p10<=p24]]] & [[[~ [p14<=1] | ~ [[p1<=p16 | p26<=p21]]] & [[[p12<=0 & p36<=p32] | p13<=p40] & ~ [p36<=0]]] & p20<=1]] & [[[[[~ [p12<=p29] | p15<=p30] | 1<=p23] | p29<=p3] & [p4<=1 & [~ [p17<=1] | [p14<=p19 | ~ [p1<=0]]]]] & [[~ [[p16<=1 | 1<=p17]] & ~ [p25<=0]] | [[[~ [p9<=p25] | [1<=p4 & 1<=p8]] & [[p16<=p25 | p35<=1] & p22<=p34]] | p11<=0]]]] & ~ [[~ [[1<=p34 | ~ [[[p26<=0 & 1<=p12] | [p14<=0 | p28<=0]]]]] | 1<=p22]]] & [1<=p24 & [p0<=1 & [[~ [[~ [[1<=p34 | 1<=p28]] | p0<=0]] & 1<=p14] & [1<=p35 | [p11<=p33 & [[~ [p9<=1] | ~ [p13<=0]] | [p38<=0 & p17<=1]]]]]]]]]
normalized: E [true U [[1<=p24 & [p0<=1 & [[1<=p35 | [p11<=p33 & [[p38<=0 & p17<=1] | [~ [p13<=0] | ~ [p9<=1]]]]] & [1<=p14 & ~ [[p0<=0 | ~ [[1<=p34 | 1<=p28]]]]]]]] & [~ [[1<=p22 | ~ [[1<=p34 | ~ [[[p14<=0 | p28<=0] | [p26<=0 & 1<=p12]]]]]]] & [[[[p11<=0 | [[p22<=p34 & [p16<=p25 | p35<=1]] & [[1<=p4 & 1<=p8] | ~ [p9<=p25]]]] | [~ [p25<=0] & ~ [[p16<=1 | 1<=p17]]]] & [[p4<=1 & [[p14<=p19 | ~ [p1<=0]] | ~ [p17<=1]]] & [p29<=p3 | [1<=p23 | [p15<=p30 | ~ [p12<=p29]]]]]] & [[p20<=1 & [[~ [p36<=0] & [p13<=p40 | [p12<=0 & p36<=p32]]] & [~ [[p1<=p16 | p26<=p21]] | ~ [p14<=1]]]] & [1<=p14 | ~ [[p10<=p24 | [p2<=p6 & [p19<=p26 & p10<=1]]]]]]]]]]

abstracting: (p10<=1)
states: 22,521 (4)
abstracting: (p19<=p26)
states: 19,959 (4)
abstracting: (p2<=p6)
states: 18,531 (4)
abstracting: (p10<=p24)
states: 19,083 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p14<=1)
states: 22,521 (4)
abstracting: (p26<=p21)
states: 19,604 (4)
abstracting: (p1<=p16)
states: 2,822 (3)
abstracting: (p36<=p32)
states: 6,914 (3)
abstracting: (p12<=0)
states: 19,604 (4)
abstracting: (p13<=p40)
states: 19,091 (4)
abstracting: (p36<=0)
states: 4,364 (3)
abstracting: (p20<=1)
states: 22,521 (4)
abstracting: (p12<=p29)
states: 19,702 (4)
abstracting: (p15<=p30)
states: 19,702 (4)
abstracting: (1<=p23)
states: 2,821 (3)
abstracting: (p29<=p3)
states: 22,178 (4)
abstracting: (p17<=1)
states: 22,521 (4)
abstracting: (p1<=0)
states: 1
abstracting: (p14<=p19)
states: 19,604 (4)
abstracting: (p4<=1)
states: 22,521 (4)
abstracting: (1<=p17)
states: 4,015 (3)
abstracting: (p16<=1)
states: 22,521 (4)
abstracting: (p25<=0)
states: 19,604 (4)
abstracting: (p9<=p25)
states: 20,043 (4)
abstracting: (1<=p8)
states: 2,917 (3)
abstracting: (1<=p4)
states: 4,985 (3)
abstracting: (p35<=1)
states: 22,521 (4)
abstracting: (p16<=p25)
states: 20,043 (4)
abstracting: (p22<=p34)
states: 20,352 (4)
abstracting: (p11<=0)
states: 19,604 (4)
abstracting: (1<=p12)
states: 2,917 (3)
abstracting: (p26<=0)
states: 19,604 (4)
abstracting: (p28<=0)
states: 21,835 (4)
abstracting: (p14<=0)
states: 19,604 (4)
abstracting: (1<=p34)
states: 5,949 (3)
abstracting: (1<=p22)
states: 2,917 (3)
abstracting: (1<=p28)
states: 686
abstracting: (1<=p34)
states: 5,949 (3)
abstracting: (p0<=0)
states: 22,520 (4)
abstracting: (1<=p14)
states: 2,917 (3)
abstracting: (p9<=1)
states: 22,521 (4)
abstracting: (p13<=0)
states: 18,505 (4)
abstracting: (p17<=1)
states: 22,521 (4)
abstracting: (p38<=0)
states: 18,158 (4)
abstracting: (p11<=p33)
states: 20,767 (4)
abstracting: (1<=p35)
states: 4,363 (3)
abstracting: (p0<=1)
states: 22,521 (4)
abstracting: (1<=p24)
states: 4,015 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-03a-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

totally nodes used: 141764 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 388023 808356 1196379
used/not used/entry size/cache size: 875522 66233342 16 1024MB
basic ops cache: hits/miss/sum: 163982 283049 447031
used/not used/entry size/cache size: 476678 16300538 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: 13190 26461 39651
used/not used/entry size/cache size: 26449 8362159 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 66970977
1 134221
2 3463
3 195
4 8
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.003sec


BK_STOP 1678698943854

--------------------
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 ReachabilityCardinality -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:9994 (82), effective:565 (4)

initing FirstDep: 0m 0.000sec


iterations count:10970 (90), effective:365 (3)

iterations count:279 (2), effective:4 (0)

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

iterations count:8369 (69), effective:278 (2)

iterations count:13225 (109), effective:480 (3)

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="AutonomousCar-PT-03a"
export BK_EXAMINATION="ReachabilityCardinality"
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 AutonomousCar-PT-03a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599200566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-03a.tgz
mv AutonomousCar-PT-03a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;