fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r010-oct2-167813599200542
Last Updated
May 14, 2023

About the Execution of Marcie+red for AutonomousCar-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5453.159 10736.00 19020.00 55.20 TTFFTTTFFFFFFTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 11K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:55 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 31K 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-01b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-01b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678698670215

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-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:11:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:11:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:11:13] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-13 09:11:13] [INFO ] Transformed 119 places.
[2023-03-13 09:11:13] [INFO ] Transformed 132 transitions.
[2023-03-13 09:11:13] [INFO ] Found NUPN structural information;
[2023-03-13 09:11:13] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 5 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 12) seen :8
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 132 rows 119 cols
[2023-03-13 09:11:14] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-13 09:11:14] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:11:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-13 09:11:14] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-13 09:11:14] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 17 ms to minimize.
[2023-03-13 09:11:15] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2023-03-13 09:11:15] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2023-03-13 09:11:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 503 ms
[2023-03-13 09:11:15] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2023-03-13 09:11:15] [INFO ] After 927ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 2276 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_01b
(NrP: 119 NrTr: 132 NrArc: 339)

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

net check time: 0m 0.000sec

init dd package: 0m 2.964sec


RS generation: 0m 0.056sec


-> reachability set: #nodes 2607 (2.6e+03) #states 117,338 (5)



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

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

abstracting: (1<=p61)
states: 3,128 (3)
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

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

abstracting: (p27<=1)
states: 117,338 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p18<=p19)
states: 113,248 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AG [p32<=p86]
normalized: ~ [E [true U ~ [p32<=p86]]]

abstracting: (p32<=p86)
states: 114,962 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [p75<=p76]
normalized: ~ [E [true U ~ [p75<=p76]]]

abstracting: (p75<=p76)
states: 115,220 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [~ [[~ [1<=p103] | p82<=0]]]
normalized: E [true U ~ [[p82<=0 | ~ [1<=p103]]]]

abstracting: (1<=p103)
states: 13,017 (4)
abstracting: (p82<=0)
states: 116,825 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[p82<=p76 | p60<=0]]
normalized: ~ [E [true U ~ [[p82<=p76 | p60<=0]]]]

abstracting: (p60<=0)
states: 114,210 (5)
abstracting: (p82<=p76)
states: 117,004 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[[p25<=1 & p8<=p8] | ~ [p46<=p55]]]]
normalized: E [true U ~ [[~ [p46<=p55] | [p25<=1 & p8<=p8]]]]

abstracting: (p8<=p8)
states: 117,338 (5)
abstracting: (p25<=1)
states: 117,338 (5)
abstracting: (p46<=p55)
states: 116,738 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[~ [p48<=1] | [[~ [1<=p54] & p84<=1] | ~ [p50<=1]]] & [p85<=p92 & [~ [p3<=0] | 1<=p115]]]]]
normalized: ~ [E [true U [[p85<=p92 & [1<=p115 | ~ [p3<=0]]] & [[~ [p50<=1] | [p84<=1 & ~ [1<=p54]]] | ~ [p48<=1]]]]]

abstracting: (p48<=1)
states: 117,338 (5)
abstracting: (1<=p54)
states: 3,128 (3)
abstracting: (p84<=1)
states: 117,338 (5)
abstracting: (p50<=1)
states: 117,338 (5)
abstracting: (p3<=0)
states: 108,868 (5)
abstracting: (1<=p115)
states: 0
abstracting: (p85<=p92)
states: 108,885 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AG [[p111<=1 | [~ [[p3<=p90 & [1<=p30 & ~ [[[~ [1<=p23] & [p40<=0 | p99<=0]] & [[1<=p1 & p82<=1] & [p60<=p78 | p81<=0]]]]]]] & [[~ [1<=p79] & [p85<=p12 | ~ [[p105<=0 & p95<=p24]]]] | [1<=p108 & 1<=p52]]]]]
normalized: ~ [E [true U ~ [[p111<=1 | [[[1<=p108 & 1<=p52] | [[p85<=p12 | ~ [[p105<=0 & p95<=p24]]] & ~ [1<=p79]]] & ~ [[p3<=p90 & [1<=p30 & ~ [[[[p60<=p78 | p81<=0] & [1<=p1 & p82<=1]] & [[p40<=0 | p99<=0] & ~ [1<=p23]]]]]]]]]]]]

abstracting: (1<=p23)
states: 4,090 (3)
abstracting: (p99<=0)
states: 114,827 (5)
abstracting: (p40<=0)
states: 113,248 (5)
abstracting: (p82<=1)
states: 117,338 (5)
abstracting: (1<=p1)
states: 1,531 (3)
abstracting: (p81<=0)
states: 116,825 (5)
abstracting: (p60<=p78)
states: 114,210 (5)
abstracting: (1<=p30)
states: 4,090 (3)
abstracting: (p3<=p90)
states: 109,248 (5)
abstracting: (1<=p79)
states: 1,050 (3)
abstracting: (p95<=p24)
states: 109,181 (5)
abstracting: (p105<=0)
states: 114,827 (5)
abstracting: (p85<=p12)
states: 110,357 (5)
abstracting: (1<=p52)
states: 11,408 (4)
abstracting: (1<=p108)
states: 2,511 (3)
abstracting: (p111<=1)
states: 117,338 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [~ [[[p3<=p59 | ~ [[[[p84<=1 & 1<=p76] & [1<=p98 | 1<=p15]] | p42<=0]]] | [[p7<=p80 & [~ [1<=p112] & p93<=1]] | [~ [[1<=p14 & [[1<=p112 | p41<=p101] & 1<=p5]]] & ~ [[[p98<=p88 & [~ [p17<=p61] | ~ [p12<=1]]] | 1<=p20]]]]]]]
normalized: E [true U ~ [[[[~ [[1<=p20 | [p98<=p88 & [~ [p12<=1] | ~ [p17<=p61]]]]] & ~ [[1<=p14 & [1<=p5 & [1<=p112 | p41<=p101]]]]] | [p7<=p80 & [p93<=1 & ~ [1<=p112]]]] | [p3<=p59 | ~ [[p42<=0 | [[1<=p98 | 1<=p15] & [p84<=1 & 1<=p76]]]]]]]]

abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p84<=1)
states: 117,338 (5)
abstracting: (1<=p15)
states: 150
abstracting: (1<=p98)
states: 2,511 (3)
abstracting: (p42<=0)
states: 113,248 (5)
abstracting: (p3<=p59)
states: 108,868 (5)
abstracting: (1<=p112)
states: 24,360 (4)
abstracting: (p93<=1)
states: 117,338 (5)
abstracting: (p7<=p80)
states: 115,858 (5)
abstracting: (p41<=p101)
states: 113,329 (5)
abstracting: (1<=p112)
states: 24,360 (4)
abstracting: (1<=p5)
states: 42,136 (4)
abstracting: (1<=p14)
states: 5
abstracting: (p17<=p61)
states: 113,384 (5)
abstracting: (p12<=1)
states: 117,338 (5)
abstracting: (p98<=p88)
states: 114,827 (5)
abstracting: (1<=p20)
states: 2,484 (3)
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: EF [[~ [[p28<=1 & ~ [[[~ [[p94<=1 & p6<=p112]] & 1<=p27] & ~ [[1<=p112 | [p32<=1 | p96<=p56]]]]]]] & ~ [[~ [[[~ [[p72<=1 | 1<=p78]] & [~ [p112<=0] & [p30<=1 | p81<=1]]] & ~ [[[1<=p42 | p63<=p87] & 1<=p26]]]] & [[~ [1<=p106] | ~ [p93<=p117]] & ~ [[~ [1<=p96] | [~ [p66<=p21] & 1<=p114]]]]]]]]
normalized: E [true U [~ [[[~ [[[1<=p114 & ~ [p66<=p21]] | ~ [1<=p96]]] & [~ [p93<=p117] | ~ [1<=p106]]] & ~ [[~ [[1<=p26 & [1<=p42 | p63<=p87]]] & [[[p30<=1 | p81<=1] & ~ [p112<=0]] & ~ [[p72<=1 | 1<=p78]]]]]]] & ~ [[p28<=1 & ~ [[~ [[1<=p112 | [p32<=1 | p96<=p56]]] & [1<=p27 & ~ [[p94<=1 & p6<=p112]]]]]]]]]

abstracting: (p6<=p112)
states: 77,001 (4)
abstracting: (p94<=1)
states: 117,338 (5)
abstracting: (1<=p27)
states: 4,090 (3)
abstracting: (p96<=p56)
states: 114,773 (5)
abstracting: (p32<=1)
states: 117,338 (5)
abstracting: (1<=p112)
states: 24,360 (4)
abstracting: (p28<=1)
states: 117,338 (5)
abstracting: (1<=p78)
states: 1,050 (3)
abstracting: (p72<=1)
states: 117,338 (5)
abstracting: (p112<=0)
states: 92,978 (4)
abstracting: (p81<=1)
states: 117,338 (5)
abstracting: (p30<=1)
states: 117,338 (5)
abstracting: (p63<=p87)
states: 114,762 (5)
abstracting: (1<=p42)
states: 4,090 (3)
abstracting: (1<=p26)
states: 4,090 (3)
abstracting: (1<=p106)
states: 2,511 (3)
abstracting: (p93<=p117)
states: 91,792 (4)
abstracting: (1<=p96)
states: 2,565 (3)
abstracting: (p66<=p21)
states: 114,346 (5)
abstracting: (1<=p114)
states: 2,565 (3)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [~ [[~ [[[~ [[[p24<=1 & p5<=p54] | p0<=0]] | [[[p97<=1 | ~ [p100<=p58]] | [~ [p40<=p50] | p52<=1]] | ~ [[p3<=1 & 1<=p71]]]] & [[[[~ [p66<=p100] & [1<=p25 & p53<=0]] | [~ [1<=p43] | ~ [p77<=p10]]] & [p20<=0 & [1<=p115 | ~ [p47<=p20]]]] | p100<=p46]]] & p36<=0]]]
normalized: ~ [E [true U [p36<=0 & ~ [[[p100<=p46 | [[p20<=0 & [1<=p115 | ~ [p47<=p20]]] & [[~ [p77<=p10] | ~ [1<=p43]] | [[1<=p25 & p53<=0] & ~ [p66<=p100]]]]] & [[~ [[p3<=1 & 1<=p71]] | [[p52<=1 | ~ [p40<=p50]] | [p97<=1 | ~ [p100<=p58]]]] | ~ [[p0<=0 | [p24<=1 & p5<=p54]]]]]]]]]

abstracting: (p5<=p54)
states: 76,766 (4)
abstracting: (p24<=1)
states: 117,338 (5)
abstracting: (p0<=0)
states: 117,337 (5)
abstracting: (p100<=p58)
states: 114,827 (5)
abstracting: (p97<=1)
states: 117,338 (5)
abstracting: (p40<=p50)
states: 113,248 (5)
abstracting: (p52<=1)
states: 117,338 (5)
abstracting: (1<=p71)
states: 2,118 (3)
abstracting: (p3<=1)
states: 117,338 (5)
abstracting: (p66<=p100)
states: 114,210 (5)
abstracting: (p53<=0)
states: 114,210 (5)
abstracting: (1<=p25)
states: 4,090 (3)
abstracting: (1<=p43)
states: 4,090 (3)
abstracting: (p77<=p10)
states: 105,614 (5)
abstracting: (p47<=p20)
states: 116,738 (5)
abstracting: (1<=p115)
states: 0
abstracting: (p20<=0)
states: 114,854 (5)
abstracting: (p100<=p46)
states: 114,827 (5)
abstracting: (p36<=0)
states: 115,664 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: EF [~ [[[~ [[[[~ [1<=p104] | [1<=p85 & p64<=1]] & [1<=p20 & [p47<=p97 | [1<=p46 | 1<=p44]]]] | ~ [1<=p109]]] | ~ [[[[~ [[1<=p26 & p34<=p94]] | [~ [p1<=p118] & [p103<=p30 & p108<=p36]]] | [[[1<=p33 & 1<=p33] | [p72<=0 | 1<=p98]] | [[1<=p95 & p49<=1] | ~ [p22<=p61]]]] | p59<=p33]]] | [[[[[[1<=p84 & 1<=p74] | [[1<=p54 & 1<=p72] | ~ [1<=p61]]] | [[~ [p42<=1] | ~ [p99<=p56]] | [p47<=p75 & 1<=p115]]] & p51<=1] | 1<=p116] | p32<=0]]]]
normalized: E [true U ~ [[[p32<=0 | [1<=p116 | [p51<=1 & [[[p47<=p75 & 1<=p115] | [~ [p99<=p56] | ~ [p42<=1]]] | [[~ [1<=p61] | [1<=p54 & 1<=p72]] | [1<=p84 & 1<=p74]]]]]] | [~ [[p59<=p33 | [[[~ [p22<=p61] | [1<=p95 & p49<=1]] | [[p72<=0 | 1<=p98] | [1<=p33 & 1<=p33]]] | [[[p103<=p30 & p108<=p36] & ~ [p1<=p118]] | ~ [[1<=p26 & p34<=p94]]]]]] | ~ [[~ [1<=p109] | [[1<=p20 & [p47<=p97 | [1<=p46 | 1<=p44]]] & [[1<=p85 & p64<=1] | ~ [1<=p104]]]]]]]]]

abstracting: (1<=p104)
states: 13,017 (4)
abstracting: (p64<=1)
states: 117,338 (5)
abstracting: (1<=p85)
states: 8,453 (3)
abstracting: (1<=p44)
states: 7,174 (3)
abstracting: (1<=p46)
states: 600
abstracting: (p47<=p97)
states: 116,738 (5)
abstracting: (1<=p20)
states: 2,484 (3)
abstracting: (1<=p109)
states: 2,511 (3)
abstracting: (p34<=p94)
states: 113,544 (5)
abstracting: (1<=p26)
states: 4,090 (3)
abstracting: (p1<=p118)
states: 116,062 (5)
abstracting: (p108<=p36)
states: 114,908 (5)
abstracting: (p103<=p30)
states: 104,840 (5)
abstracting: (1<=p33)
states: 4,090 (3)
abstracting: (1<=p33)
states: 4,090 (3)
abstracting: (1<=p98)
states: 2,511 (3)
abstracting: (p72<=0)
states: 115,220 (5)
abstracting: (p49<=1)
states: 117,338 (5)
abstracting: (1<=p95)
states: 8,453 (3)
abstracting: (p22<=p61)
states: 113,384 (5)
abstracting: (p59<=p33)
states: 114,346 (5)
abstracting: (1<=p74)
states: 2,118 (3)
abstracting: (1<=p84)
states: 513
abstracting: (1<=p72)
states: 2,118 (3)
abstracting: (1<=p54)
states: 3,128 (3)
abstracting: (1<=p61)
states: 3,128 (3)
abstracting: (p42<=1)
states: 117,338 (5)
abstracting: (p99<=p56)
states: 114,827 (5)
abstracting: (1<=p115)
states: 0
abstracting: (p47<=p75)
states: 116,738 (5)
abstracting: (p51<=1)
states: 117,338 (5)
abstracting: (1<=p116)
states: 2,565 (3)
abstracting: (p32<=0)
states: 114,854 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [[~ [p56<=1] | [[[[[~ [[[p101<=0 | 1<=p30] | [1<=p104 | p103<=0]]] & [[[p88<=1 & p30<=p41] & [p22<=p70 | p7<=1]] & ~ [p69<=p63]]] | ~ [p105<=0]] & ~ [[[[p60<=0 & 1<=p40] | [~ [p57<=p3] & [1<=p33 & p30<=p24]]] | p59<=0]]] | ~ [1<=p28]] | ~ [[[~ [1<=p104] | ~ [p92<=p91]] & [[p22<=p91 & [[[p103<=1 & p112<=1] | [p8<=p25 | 1<=p117]] | [[1<=p31 & p21<=1] & [p7<=1 & p37<=p113]]]] | [[~ [[p46<=1 & 1<=p54]] & [~ [p74<=p11] & [p64<=p50 | p46<=p84]]] & ~ [1<=p15]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[~ [1<=p15] & [[[p64<=p50 | p46<=p84] & ~ [p74<=p11]] & ~ [[p46<=1 & 1<=p54]]]] | [p22<=p91 & [[[p7<=1 & p37<=p113] & [1<=p31 & p21<=1]] | [[p8<=p25 | 1<=p117] | [p103<=1 & p112<=1]]]]] & [~ [p92<=p91] | ~ [1<=p104]]]] | [~ [1<=p28] | [~ [[p59<=0 | [[[1<=p33 & p30<=p24] & ~ [p57<=p3]] | [p60<=0 & 1<=p40]]]] & [~ [p105<=0] | [[~ [p69<=p63] & [[p22<=p70 | p7<=1] & [p88<=1 & p30<=p41]]] & ~ [[[1<=p104 | p103<=0] | [p101<=0 | 1<=p30]]]]]]]] | ~ [p56<=1]]]]]

abstracting: (p56<=1)
states: 117,338 (5)
abstracting: (1<=p30)
states: 4,090 (3)
abstracting: (p101<=0)
states: 114,827 (5)
abstracting: (p103<=0)
states: 104,321 (5)
abstracting: (1<=p104)
states: 13,017 (4)
abstracting: (p30<=p41)
states: 113,248 (5)
abstracting: (p88<=1)
states: 117,338 (5)
abstracting: (p7<=1)
states: 117,338 (5)
abstracting: (p22<=p70)
states: 113,248 (5)
abstracting: (p69<=p63)
states: 115,220 (5)
abstracting: (p105<=0)
states: 114,827 (5)
abstracting: (1<=p40)
states: 4,090 (3)
abstracting: (p60<=0)
states: 114,210 (5)
abstracting: (p57<=p3)
states: 114,210 (5)
abstracting: (p30<=p24)
states: 113,248 (5)
abstracting: (1<=p33)
states: 4,090 (3)
abstracting: (p59<=0)
states: 114,210 (5)
abstracting: (1<=p28)
states: 4,090 (3)
abstracting: (1<=p104)
states: 13,017 (4)
abstracting: (p92<=p91)
states: 91,279 (4)
abstracting: (p112<=1)
states: 117,338 (5)
abstracting: (p103<=1)
states: 117,338 (5)
abstracting: (1<=p117)
states: 2,565 (3)
abstracting: (p8<=p25)
states: 115,837 (5)
abstracting: (p21<=1)
states: 117,338 (5)
abstracting: (1<=p31)
states: 4,090 (3)
abstracting: (p37<=p113)
states: 114,173 (5)
abstracting: (p7<=1)
states: 117,338 (5)
abstracting: (p22<=p91)
states: 113,356 (5)
abstracting: (1<=p54)
states: 3,128 (3)
abstracting: (p46<=1)
states: 117,338 (5)
abstracting: (p74<=p11)
states: 115,220 (5)
abstracting: (p46<=p84)
states: 116,758 (5)
abstracting: (p64<=p50)
states: 114,210 (5)
abstracting: (1<=p15)
states: 150
-> the formula is FALSE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [[[p85<=p68 & ~ [[p55<=p78 | [p0<=p44 & ~ [1<=p112]]]]] & [[[p16<=1 | ~ [[~ [p113<=1] | [[[p28<=0 | 1<=p64] & ~ [p104<=p72]] | ~ [p92<=p74]]]]] | ~ [[~ [p10<=1] & [[[~ [p30<=0] & p78<=p11] | ~ [[p62<=p14 | p0<=0]]] | [[~ [p100<=p61] | [p3<=0 & 1<=p99]] & [~ [1<=p90] | [p112<=0 & 1<=p34]]]]]]] | [[~ [p93<=p92] | 1<=p69] | [[[[[p102<=p62 | p115<=p44] | [[1<=p9 & p2<=p70] & [1<=p102 & p32<=p28]]] & [[1<=p93 & [p56<=1 | p117<=1]] & [[p89<=1 & 1<=p9] | [p42<=p105 | 1<=p0]]]] | [~ [1<=p60] & [[~ [p86<=1] & [p95<=p23 | p77<=1]] | 1<=p10]]] | [~ [[[[p115<=p0 & p24<=0] & [p47<=1 & p50<=p0]] & 1<=p112]] & [[[[p28<=1 & 1<=p61] & ~ [p13<=p23]] | [~ [p55<=0] & [p100<=0 | p11<=p47]]] & [[[p49<=1 & p12<=1] | 1<=p46] | ~ [p103<=0]]]]]]]]]
normalized: E [true U [[[[[[[~ [p103<=0] | [1<=p46 | [p49<=1 & p12<=1]]] & [[[p100<=0 | p11<=p47] & ~ [p55<=0]] | [~ [p13<=p23] & [p28<=1 & 1<=p61]]]] & ~ [[1<=p112 & [[p47<=1 & p50<=p0] & [p115<=p0 & p24<=0]]]]] | [[[1<=p10 | [[p95<=p23 | p77<=1] & ~ [p86<=1]]] & ~ [1<=p60]] | [[[[p42<=p105 | 1<=p0] | [p89<=1 & 1<=p9]] & [1<=p93 & [p56<=1 | p117<=1]]] & [[[1<=p102 & p32<=p28] & [1<=p9 & p2<=p70]] | [p102<=p62 | p115<=p44]]]]] | [1<=p69 | ~ [p93<=p92]]] | [~ [[[[[[p112<=0 & 1<=p34] | ~ [1<=p90]] & [[p3<=0 & 1<=p99] | ~ [p100<=p61]]] | [~ [[p62<=p14 | p0<=0]] | [p78<=p11 & ~ [p30<=0]]]] & ~ [p10<=1]]] | [p16<=1 | ~ [[[~ [p92<=p74] | [~ [p104<=p72] & [p28<=0 | 1<=p64]]] | ~ [p113<=1]]]]]] & [p85<=p68 & ~ [[p55<=p78 | [p0<=p44 & ~ [1<=p112]]]]]]]

abstracting: (1<=p112)
states: 24,360 (4)
abstracting: (p0<=p44)
states: 117,337 (5)
abstracting: (p55<=p78)
states: 114,210 (5)
abstracting: (p85<=p68)
states: 108,990 (5)
abstracting: (p113<=1)
states: 117,338 (5)
abstracting: (1<=p64)
states: 3,128 (3)
abstracting: (p28<=0)
states: 113,248 (5)
abstracting: (p104<=p72)
states: 104,441 (5)
abstracting: (p92<=p74)
states: 91,720 (4)
abstracting: (p16<=1)
states: 117,338 (5)
abstracting: (p10<=1)
states: 117,338 (5)
abstracting: (p30<=0)
states: 113,248 (5)
abstracting: (p78<=p11)
states: 116,288 (5)
abstracting: (p0<=0)
states: 117,337 (5)
abstracting: (p62<=p14)
states: 114,210 (5)
abstracting: (p100<=p61)
states: 114,827 (5)
abstracting: (1<=p99)
states: 2,511 (3)
abstracting: (p3<=0)
states: 108,868 (5)
abstracting: (1<=p90)
states: 3,348 (3)
abstracting: (1<=p34)
states: 4,090 (3)
abstracting: (p112<=0)
states: 92,978 (4)
abstracting: (p93<=p92)
states: 91,279 (4)
abstracting: (1<=p69)
states: 2,118 (3)
abstracting: (p115<=p44)
states: 117,338 (5)
abstracting: (p102<=p62)
states: 114,827 (5)
abstracting: (p2<=p70)
states: 115,807 (5)
abstracting: (1<=p9)
states: 27,192 (4)
abstracting: (p32<=p28)
states: 114,854 (5)
abstracting: (1<=p102)
states: 2,511 (3)
abstracting: (p117<=1)
states: 117,338 (5)
abstracting: (p56<=1)
states: 117,338 (5)
abstracting: (1<=p93)
states: 26,059 (4)
abstracting: (1<=p9)
states: 27,192 (4)
abstracting: (p89<=1)
states: 117,338 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p42<=p105)
states: 113,329 (5)
abstracting: (1<=p60)
states: 3,128 (3)
abstracting: (p86<=1)
states: 117,338 (5)
abstracting: (p77<=1)
states: 117,338 (5)
abstracting: (p95<=p23)
states: 109,181 (5)
abstracting: (1<=p10)
states: 21,068 (4)
abstracting: (p24<=0)
states: 113,248 (5)
abstracting: (p115<=p0)
states: 117,338 (5)
abstracting: (p50<=p0)
states: 116,288 (5)
abstracting: (p47<=1)
states: 117,338 (5)
abstracting: (1<=p112)
states: 24,360 (4)
abstracting: (1<=p61)
states: 3,128 (3)
abstracting: (p28<=1)
states: 117,338 (5)
abstracting: (p13<=p23)
states: 92,204 (4)
abstracting: (p55<=0)
states: 114,210 (5)
abstracting: (p11<=p47)
states: 96,270 (4)
abstracting: (p100<=0)
states: 114,827 (5)
abstracting: (p12<=1)
states: 117,338 (5)
abstracting: (p49<=1)
states: 117,338 (5)
abstracting: (1<=p46)
states: 600
abstracting: (p103<=0)
states: 104,321 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

totally nodes used: 288952 (2.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 484866 1315718 1800584
used/not used/entry size/cache size: 1491303 65617561 16 1024MB
basic ops cache: hits/miss/sum: 161382 513397 674779
used/not used/entry size/cache size: 838010 15939206 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: 13969 48857 62826
used/not used/entry size/cache size: 48731 8339877 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 66834768
1 260130
2 13124
3 801
4 34
5 7
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.367sec


BK_STOP 1678698680951

--------------------
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:3358 (25), effective:322 (2)

initing FirstDep: 0m 0.000sec


iterations count:1805 (13), effective:152 (1)

iterations count:1296 (9), effective:103 (0)

iterations count:1301 (9), effective:106 (0)

iterations count:1992 (15), effective:184 (1)

iterations count:2028 (15), effective:183 (1)

iterations count:1759 (13), effective:146 (1)

iterations count:1782 (13), effective:141 (1)

iterations count:1308 (9), effective:106 (0)

iterations count:1806 (13), effective:149 (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="AutonomousCar-PT-01b"
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-01b, 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-167813599200542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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