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-167813599200550.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-02a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 23K 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-02a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-02a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678698748037

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-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:12:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:12:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:12:30] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-13 09:12:30] [INFO ] Transformed 33 places.
[2023-03-13 09:12:30] [INFO ] Transformed 69 transitions.
[2023-03-13 09:12:30] [INFO ] Found NUPN structural information;
[2023-03-13 09:12:30] [INFO ] Parsed PT model containing 33 places and 69 transitions and 368 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 23 transitions
Reduce redundant transitions removed 23 transitions.
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 1503 steps, including 97 resets, run visited all 5 properties in 49 ms. (steps per millisecond=30 )
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 275 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_02a
(NrP: 33 NrTr: 69 NrArc: 368)

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

net check time: 0m 0.000sec

init dd package: 0m 3.190sec


RS generation: 0m 0.010sec


-> reachability set: #nodes 457 (4.6e+02) #states 2,314 (3)



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

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

abstracting: (p12<=1)
states: 2,314 (3)
-> the formula is TRUE

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

MC time: 0m 0.001sec

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

abstracting: (1<=p20)
states: 98
-> the formula is FALSE

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

MC time: 0m 0.004sec

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

abstracting: (1<=p8)
states: 278
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=p32)
states: 267
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [p7<=p22]
normalized: ~ [E [true U ~ [p7<=p22]]]

abstracting: (p7<=p22)
states: 2,038 (3)
-> the formula is FALSE

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

MC time: 0m 0.021sec

checking: EF [[~ [p10<=0] | 1<=p31]]
normalized: E [true U [~ [p10<=0] | 1<=p31]]

abstracting: (1<=p31)
states: 1,170 (3)
abstracting: (p10<=0)
states: 2,024 (3)
-> the formula is TRUE

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

MC time: 0m 0.026sec

checking: AG [[[p5<=p30 | ~ [1<=p29]] | [[~ [p31<=1] | ~ [[p0<=0 | 1<=p30]]] & [~ [p1<=0] & 1<=p27]]]]
normalized: ~ [E [true U ~ [[[[~ [p1<=0] & 1<=p27] & [~ [[p0<=0 | 1<=p30]] | ~ [p31<=1]]] | [~ [1<=p29] | p5<=p30]]]]]

abstracting: (p5<=p30)
states: 1,842 (3)
abstracting: (1<=p29)
states: 438
abstracting: (p31<=1)
states: 2,314 (3)
abstracting: (1<=p30)
states: 438
abstracting: (p0<=0)
states: 2,313 (3)
abstracting: (1<=p27)
states: 438
abstracting: (p1<=0)
states: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EF [[[[1<=p17 | ~ [[1<=p7 | [~ [1<=p0] | p0<=p32]]]] | 1<=p29] & [[p13<=0 & [p2<=1 & p18<=0]] & [1<=p1 & ~ [p30<=p10]]]]]
normalized: E [true U [[[~ [p30<=p10] & 1<=p1] & [[p2<=1 & p18<=0] & p13<=0]] & [[~ [[[~ [1<=p0] | p0<=p32] | 1<=p7]] | 1<=p17] | 1<=p29]]]

abstracting: (1<=p29)
states: 438
abstracting: (1<=p17)
states: 290
abstracting: (1<=p7)
states: 290
abstracting: (p0<=p32)
states: 2,313 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p13<=0)
states: 2,024 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p30<=p10)
states: 1,930 (3)
-> the formula is TRUE

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

MC time: 0m 0.011sec

checking: EF [~ [[[p13<=1 | p29<=p9] | [p29<=p18 & [[[[p29<=p18 & [~ [p8<=1] & 1<=p16]] & p22<=p15] | 1<=p24] & p16<=0]]]]]
normalized: E [true U ~ [[[[[[[[~ [p8<=1] & 1<=p16] & p29<=p18] & p22<=p15] | 1<=p24] & p16<=0] & p29<=p18] | [p13<=1 | p29<=p9]]]]

abstracting: (p29<=p9)
states: 1,960 (3)
abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (p29<=p18)
states: 1,930 (3)
abstracting: (p16<=0)
states: 1,877 (3)
abstracting: (1<=p24)
states: 236
abstracting: (p22<=p15)
states: 2,230 (3)
abstracting: (p29<=p18)
states: 1,930 (3)
abstracting: (1<=p16)
states: 437
abstracting: (p8<=1)
states: 2,314 (3)
-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: AG [[~ [p13<=1] | ~ [[p13<=p18 | [[[[~ [1<=p18] | p18<=p4] | p24<=p27] & [p0<=1 & ~ [[[p17<=p32 & p1<=p20] & [p13<=p18 & p13<=p9]]]]] | p21<=p2]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[~ [[[p13<=p18 & p13<=p9] & [p17<=p32 & p1<=p20]]] & p0<=1] & [[~ [1<=p18] | p18<=p4] | p24<=p27]] | p21<=p2] | p13<=p18]] | ~ [p13<=1]]]]]

abstracting: (p13<=1)
states: 2,314 (3)
abstracting: (p13<=p18)
states: 2,024 (3)
abstracting: (p21<=p2)
states: 2,265 (3)
abstracting: (p24<=p27)
states: 2,126 (3)
abstracting: (p18<=p4)
states: 2,089 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p0<=1)
states: 2,314 (3)
abstracting: (p1<=p20)
states: 99
abstracting: (p17<=p32)
states: 2,056 (3)
abstracting: (p13<=p9)
states: 2,087 (3)
abstracting: (p13<=p18)
states: 2,024 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[~ [1<=p1] & [~ [1<=p17] & p7<=0]] | [[~ [[~ [p9<=p0] & ~ [[~ [p26<=p3] | [1<=p30 | 1<=p7]]]]] | [[[1<=p12 | [[1<=p8 & p12<=1] & [p2<=1 & p29<=p12]]] & [[[p0<=p11 | p12<=p17] & [p9<=0 | p11<=1]] | ~ [p23<=0]]] | [[[[p6<=0 & 1<=p28] & [1<=p21 & p6<=1]] & [[p19<=p3 & 1<=p1] | p11<=1]] & ~ [1<=p25]]]] | p30<=1]] | [~ [p30<=p19] | p9<=0]]]
normalized: ~ [E [true U ~ [[[~ [p30<=p19] | p9<=0] | [[[[[~ [1<=p25] & [[[p19<=p3 & 1<=p1] | p11<=1] & [[1<=p21 & p6<=1] & [p6<=0 & 1<=p28]]]] | [[~ [p23<=0] | [[p9<=0 | p11<=1] & [p0<=p11 | p12<=p17]]] & [[[p2<=1 & p29<=p12] & [1<=p8 & p12<=1]] | 1<=p12]]] | ~ [[~ [[[1<=p30 | 1<=p7] | ~ [p26<=p3]]] & ~ [p9<=p0]]]] | p30<=1] | [[p7<=0 & ~ [1<=p17]] & ~ [1<=p1]]]]]]]

abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (1<=p17)
states: 290
abstracting: (p7<=0)
states: 2,024 (3)
abstracting: (p30<=1)
states: 2,314 (3)
abstracting: (p9<=p0)
states: 1,877 (3)
abstracting: (p26<=p3)
states: 1,881 (3)
abstracting: (1<=p7)
states: 290
abstracting: (1<=p30)
states: 438
abstracting: (1<=p12)
states: 438
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p29<=p12)
states: 1,960 (3)
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (p12<=p17)
states: 1,939 (3)
abstracting: (p0<=p11)
states: 2,313 (3)
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (p9<=0)
states: 1,877 (3)
abstracting: (p23<=0)
states: 2,078 (3)
abstracting: (1<=p28)
states: 1,875 (3)
abstracting: (p6<=0)
states: 2,024 (3)
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p11<=1)
states: 2,314 (3)
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p19<=p3)
states: 1,953 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p9<=0)
states: 1,877 (3)
abstracting: (p30<=p19)
states: 1,960 (3)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: AG [[[p21<=1 | [~ [p6<=p29] & p26<=0]] & [~ [[[[[~ [[p0<=1 | p0<=0]] | [[1<=p12 | p8<=p0] & 1<=p20]] | p30<=1] | [[[1<=p4 & [1<=p24 | p8<=1]] | [p25<=p17 & [p16<=p24 | 1<=p2]]] | ~ [[~ [p10<=1] & [1<=p18 & 1<=p8]]]]] & [p27<=p16 & [p28<=p26 | [[[1<=p13 | p26<=0] | ~ [p19<=0]] | [[p1<=0 | p12<=p2] & [1<=p32 | p0<=p5]]]]]]] | p3<=1]]]
normalized: ~ [E [true U ~ [[[~ [[[[[[[1<=p32 | p0<=p5] & [p1<=0 | p12<=p2]] | [~ [p19<=0] | [1<=p13 | p26<=0]]] | p28<=p26] & p27<=p16] & [[~ [[[1<=p18 & 1<=p8] & ~ [p10<=1]]] | [[[p16<=p24 | 1<=p2] & p25<=p17] | [[1<=p24 | p8<=1] & 1<=p4]]] | [[[[1<=p12 | p8<=p0] & 1<=p20] | ~ [[p0<=1 | p0<=0]]] | p30<=1]]]] | p3<=1] & [[~ [p6<=p29] & p26<=0] | p21<=1]]]]]

abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (p6<=p29)
states: 2,078 (3)
abstracting: (p3<=1)
states: 2,314 (3)
abstracting: (p30<=1)
states: 2,314 (3)
abstracting: (p0<=0)
states: 2,313 (3)
abstracting: (p0<=1)
states: 2,314 (3)
abstracting: (1<=p20)
states: 98
abstracting: (p8<=p0)
states: 2,036 (3)
abstracting: (1<=p12)
states: 438
abstracting: (1<=p4)
states: 605
abstracting: (p8<=1)
states: 2,314 (3)
abstracting: (1<=p24)
states: 236
abstracting: (p25<=p17)
states: 1,528 (3)
abstracting: (1<=p2)
states: 576
abstracting: (p16<=p24)
states: 1,946 (3)
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p8)
states: 278
abstracting: (1<=p18)
states: 290
abstracting: (p27<=p16)
states: 1,960 (3)
abstracting: (p28<=p26)
states: 922
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p13)
states: 290
abstracting: (p19<=0)
states: 1,876 (3)
abstracting: (p12<=p2)
states: 1,960 (3)
abstracting: (p1<=0)
states: 1
abstracting: (p0<=p5)
states: 2,313 (3)
abstracting: (1<=p32)
states: 267
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AG [[[[~ [p16<=p16] & 1<=p26] | [[1<=p12 | [p24<=p17 | [1<=p8 & [[[p12<=0 & p16<=0] & [p29<=1 | p11<=p2]] & ~ [[p17<=p28 & p2<=0]]]]]] | [~ [p21<=0] | [[p18<=1 | [[[1<=p25 | p8<=p4] | [p5<=p18 | p19<=p30]] & ~ [p10<=p15]]] | [1<=p0 | [[p13<=p20 & [p22<=p23 & 1<=p16]] | [[p5<=0 & p3<=0] | ~ [1<=p17]]]]]]]] & [1<=p1 | 1<=p17]]]
normalized: ~ [E [true U ~ [[[1<=p1 | 1<=p17] & [[[[[1<=p0 | [[~ [1<=p17] | [p5<=0 & p3<=0]] | [p13<=p20 & [p22<=p23 & 1<=p16]]]] | [p18<=1 | [~ [p10<=p15] & [[p5<=p18 | p19<=p30] | [1<=p25 | p8<=p4]]]]] | ~ [p21<=0]] | [1<=p12 | [p24<=p17 | [1<=p8 & [~ [[p17<=p28 & p2<=0]] & [[p29<=1 | p11<=p2] & [p12<=0 & p16<=0]]]]]]] | [1<=p26 & ~ [p16<=p16]]]]]]]

abstracting: (p16<=p16)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p16<=0)
states: 1,877 (3)
abstracting: (p12<=0)
states: 1,876 (3)
abstracting: (p11<=p2)
states: 2,107 (3)
abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (p2<=0)
states: 1,738 (3)
abstracting: (p17<=p28)
states: 2,260 (3)
abstracting: (1<=p8)
states: 278
abstracting: (p24<=p17)
states: 2,098 (3)
abstracting: (1<=p12)
states: 438
abstracting: (p21<=0)
states: 2,216 (3)
abstracting: (p8<=p4)
states: 2,101 (3)
abstracting: (1<=p25)
states: 918
abstracting: (p19<=p30)
states: 1,960 (3)
abstracting: (p5<=p18)
states: 1,786 (3)
abstracting: (p10<=p15)
states: 2,056 (3)
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p16)
states: 437
abstracting: (p22<=p23)
states: 2,216 (3)
abstracting: (p13<=p20)
states: 2,038 (3)
abstracting: (p3<=0)
states: 1,775 (3)
abstracting: (p5<=0)
states: 1,721 (3)
abstracting: (1<=p17)
states: 290
abstracting: (1<=p0)
states: 1
abstracting: (1<=p17)
states: 290
abstracting: (1<=p1)
states: 2,313 (3)
-> the formula is FALSE

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

MC time: 0m 0.015sec

checking: EF [[[~ [p30<=0] & [[~ [[[[[p18<=p12 | 1<=p7] & p9<=p24] | [[p10<=p4 & p15<=1] & ~ [p4<=p32]]] | p8<=p5]] | p1<=p8] | ~ [[[[p32<=p21 & p10<=1] & [[[p21<=p19 & p5<=1] | p23<=p24] | [[p32<=0 | p27<=p19] | [p2<=p17 & 1<=p23]]]] & [[p3<=1 & [[p14<=p4 | p32<=p7] & [p26<=0 & 1<=p21]]] | p18<=p31]]]]] | [p29<=p8 | p30<=0]]]
normalized: E [true U [[p29<=p8 | p30<=0] | [[~ [[[p18<=p31 | [p3<=1 & [[p26<=0 & 1<=p21] & [p14<=p4 | p32<=p7]]]] & [[[[p2<=p17 & 1<=p23] | [p32<=0 | p27<=p19]] | [p23<=p24 | [p21<=p19 & p5<=1]]] & [p32<=p21 & p10<=1]]]] | [p1<=p8 | ~ [[p8<=p5 | [[~ [p4<=p32] & [p10<=p4 & p15<=1]] | [p9<=p24 & [p18<=p12 | 1<=p7]]]]]]] & ~ [p30<=0]]]]

abstracting: (p30<=0)
states: 1,876 (3)
abstracting: (1<=p7)
states: 290
abstracting: (p18<=p12)
states: 2,087 (3)
abstracting: (p9<=p24)
states: 1,946 (3)
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (p10<=p4)
states: 2,089 (3)
abstracting: (p4<=p32)
states: 1,830 (3)
abstracting: (p8<=p5)
states: 2,095 (3)
abstracting: (p1<=p8)
states: 279
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (p32<=p21)
states: 2,047 (3)
abstracting: (p5<=1)
states: 2,314 (3)
abstracting: (p21<=p19)
states: 2,230 (3)
abstracting: (p23<=p24)
states: 2,078 (3)
abstracting: (p27<=p19)
states: 1,960 (3)
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (1<=p23)
states: 236
abstracting: (p2<=p17)
states: 1,821 (3)
abstracting: (p32<=p7)
states: 2,079 (3)
abstracting: (p14<=p4)
states: 2,089 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (p3<=1)
states: 2,314 (3)
abstracting: (p18<=p31)
states: 2,174 (3)
abstracting: (p30<=0)
states: 1,876 (3)
abstracting: (p29<=p8)
states: 1,930 (3)
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: AG [[[[p17<=p27 | [[[[~ [[p29<=0 | p29<=1]] | [[p24<=p13 & 1<=p14] & [1<=p14 | p5<=p8]]] & ~ [p18<=1]] & p13<=p19] | ~ [p26<=0]]] | ~ [[[p28<=p11 | 1<=p20] & ~ [[1<=p20 | ~ [1<=p15]]]]]] | [~ [[[p30<=p20 & [[[~ [p13<=p17] & [p12<=1 & p15<=p4]] | 1<=p28] | ~ [[1<=p27 & ~ [p18<=1]]]]] & [[[p5<=0 | [p20<=0 & ~ [p8<=p14]]] & [~ [p8<=0] & ~ [p13<=p1]]] & [[[~ [p21<=1] & [p2<=1 | p32<=0]] & 1<=p3] & 1<=p24]]]] | p31<=1]]]
normalized: ~ [E [true U ~ [[[p31<=1 | ~ [[[[1<=p24 & [1<=p3 & [[p2<=1 | p32<=0] & ~ [p21<=1]]]] & [[~ [p13<=p1] & ~ [p8<=0]] & [p5<=0 | [p20<=0 & ~ [p8<=p14]]]]] & [p30<=p20 & [~ [[1<=p27 & ~ [p18<=1]]] | [1<=p28 | [[p12<=1 & p15<=p4] & ~ [p13<=p17]]]]]]]] | [~ [[~ [[1<=p20 | ~ [1<=p15]]] & [p28<=p11 | 1<=p20]]] | [p17<=p27 | [~ [p26<=0] | [p13<=p19 & [~ [p18<=1] & [[[1<=p14 | p5<=p8] & [p24<=p13 & 1<=p14]] | ~ [[p29<=0 | p29<=1]]]]]]]]]]]]

abstracting: (p29<=1)
states: 2,314 (3)
abstracting: (p29<=0)
states: 1,876 (3)
abstracting: (1<=p14)
states: 290
abstracting: (p24<=p13)
states: 2,098 (3)
abstracting: (p5<=p8)
states: 1,780 (3)
abstracting: (1<=p14)
states: 290
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (p13<=p19)
states: 2,024 (3)
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (p17<=p27)
states: 2,078 (3)
abstracting: (1<=p20)
states: 98
abstracting: (p28<=p11)
states: 675
abstracting: (1<=p15)
states: 278
abstracting: (1<=p20)
states: 98
abstracting: (p13<=p17)
states: 2,024 (3)
abstracting: (p15<=p4)
states: 2,101 (3)
abstracting: (p12<=1)
states: 2,314 (3)
abstracting: (1<=p28)
states: 1,875 (3)
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (1<=p27)
states: 438
abstracting: (p30<=p20)
states: 1,876 (3)
abstracting: (p8<=p14)
states: 2,068 (3)
abstracting: (p20<=0)
states: 2,216 (3)
abstracting: (p5<=0)
states: 1,721 (3)
abstracting: (p8<=0)
states: 2,036 (3)
abstracting: (p13<=p1)
states: 2,314 (3)
abstracting: (p21<=1)
states: 2,314 (3)
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (p2<=1)
states: 2,314 (3)
abstracting: (1<=p3)
states: 539
abstracting: (1<=p24)
states: 236
abstracting: (p31<=1)
states: 2,314 (3)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[[[[1<=p13 & ~ [[[~ [p23<=p26] | 1<=p32] | ~ [[p11<=0 | [p32<=p19 | p7<=1]]]]]] & [[[[~ [[p0<=p19 | 1<=p12]] | ~ [[p32<=0 | 1<=p10]]] & 1<=p14] | [[~ [p4<=1] & ~ [[1<=p6 | 1<=p25]]] & ~ [p15<=1]]] | [[~ [[[p24<=1 | 1<=p26] & [1<=p27 & p14<=0]]] | 1<=p22] | p32<=p26]]] & [~ [[[~ [[~ [1<=p17] & ~ [p31<=p31]]] & [p31<=1 | [[p12<=p0 & 1<=p9] & [1<=p1 | p1<=0]]]] | [[[[p27<=p11 & 1<=p16] | ~ [p18<=1]] & [p26<=1 | [p9<=p28 & p6<=1]]] | [[[p24<=1 | p16<=p32] & ~ [1<=p21]] | p5<=0]]]] & [~ [[p15<=0 | ~ [[p10<=1 & p10<=1]]]] | [[[1<=p15 & ~ [[p15<=p10 & p4<=0]]] & [[[p26<=0 & 1<=p10] & [p10<=1 & 1<=p10]] & ~ [[p24<=1 | 1<=p18]]]] & [~ [p8<=p13] | ~ [[p18<=0 | p3<=1]]]]]]] & p5<=1]]
normalized: E [true U [p5<=1 & [[[[[~ [[p18<=0 | p3<=1]] | ~ [p8<=p13]] & [[~ [[p24<=1 | 1<=p18]] & [[p10<=1 & 1<=p10] & [p26<=0 & 1<=p10]]] & [1<=p15 & ~ [[p15<=p10 & p4<=0]]]]] | ~ [[p15<=0 | ~ [[p10<=1 & p10<=1]]]]] & ~ [[[[p5<=0 | [~ [1<=p21] & [p24<=1 | p16<=p32]]] | [[p26<=1 | [p9<=p28 & p6<=1]] & [~ [p18<=1] | [p27<=p11 & 1<=p16]]]] | [[p31<=1 | [[1<=p1 | p1<=0] & [p12<=p0 & 1<=p9]]] & ~ [[~ [p31<=p31] & ~ [1<=p17]]]]]]] & [[[p32<=p26 | [1<=p22 | ~ [[[1<=p27 & p14<=0] & [p24<=1 | 1<=p26]]]]] | [[~ [p15<=1] & [~ [[1<=p6 | 1<=p25]] & ~ [p4<=1]]] | [1<=p14 & [~ [[p32<=0 | 1<=p10]] | ~ [[p0<=p19 | 1<=p12]]]]]] & [1<=p13 & ~ [[~ [[p11<=0 | [p32<=p19 | p7<=1]]] | [1<=p32 | ~ [p23<=p26]]]]]]]]]

abstracting: (p23<=p26)
states: 2,078 (3)
abstracting: (1<=p32)
states: 267
abstracting: (p7<=1)
states: 2,314 (3)
abstracting: (p32<=p19)
states: 2,107 (3)
abstracting: (p11<=0)
states: 2,024 (3)
abstracting: (1<=p13)
states: 290
abstracting: (1<=p12)
states: 438
abstracting: (p0<=p19)
states: 2,313 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p32<=0)
states: 2,047 (3)
abstracting: (1<=p14)
states: 290
abstracting: (p4<=1)
states: 2,314 (3)
abstracting: (1<=p25)
states: 918
abstracting: (1<=p6)
states: 290
abstracting: (p15<=1)
states: 2,314 (3)
abstracting: (1<=p26)
states: 629
abstracting: (p24<=1)
states: 2,314 (3)
abstracting: (p14<=0)
states: 2,024 (3)
abstracting: (1<=p27)
states: 438
abstracting: (1<=p22)
states: 98
abstracting: (p32<=p26)
states: 2,092 (3)
abstracting: (1<=p17)
states: 290
abstracting: (p31<=p31)
states: 2,314 (3)
abstracting: (1<=p9)
states: 437
abstracting: (p12<=p0)
states: 1,876 (3)
abstracting: (p1<=0)
states: 1
abstracting: (1<=p1)
states: 2,313 (3)
abstracting: (p31<=1)
states: 2,314 (3)
abstracting: (1<=p16)
states: 437
abstracting: (p27<=p11)
states: 1,930 (3)
abstracting: (p18<=1)
states: 2,314 (3)
abstracting: (p6<=1)
states: 2,314 (3)
abstracting: (p9<=p28)
states: 2,230 (3)
abstracting: (p26<=1)
states: 2,314 (3)
abstracting: (p16<=p32)
states: 1,936 (3)
abstracting: (p24<=1)
states: 2,314 (3)
abstracting: (1<=p21)
states: 98
abstracting: (p5<=0)
states: 1,721 (3)
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (p15<=0)
states: 2,036 (3)
abstracting: (p4<=0)
states: 1,709 (3)
abstracting: (p15<=p10)
states: 2,068 (3)
abstracting: (1<=p15)
states: 278
abstracting: (1<=p10)
states: 290
abstracting: (p26<=0)
states: 1,685 (3)
abstracting: (1<=p10)
states: 290
abstracting: (p10<=1)
states: 2,314 (3)
abstracting: (1<=p18)
states: 290
abstracting: (p24<=1)
states: 2,314 (3)
abstracting: (p8<=p13)
states: 2,068 (3)
abstracting: (p3<=1)
states: 2,314 (3)
abstracting: (p18<=0)
states: 2,024 (3)
abstracting: (p5<=1)
states: 2,314 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

totally nodes used: 35392 (3.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 54588 138219 192807
used/not used/entry size/cache size: 154820 66954044 16 1024MB
basic ops cache: hits/miss/sum: 34062 78217 112279
used/not used/entry size/cache size: 131862 16645354 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: 4440 9150 13590
used/not used/entry size/cache size: 9150 8379458 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 67073846
1 34646
2 370
3 2
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.977sec


BK_STOP 1678698756908

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


iterations count:1974 (28), effective:167 (2)

initing FirstDep: 0m 0.012sec


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

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

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

iterations count:760 (11), effective:42 (0)

iterations count:1381 (20), effective:84 (1)

iterations count:1980 (28), effective:124 (1)

iterations count:1101 (15), effective:71 (1)

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

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

iterations count:69 (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="AutonomousCar-PT-02a"
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-02a, 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-167813599200550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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