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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 448K 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-08a-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678700884961

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-08a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:48:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:48:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:48:08] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2023-03-13 09:48:08] [INFO ] Transformed 81 places.
[2023-03-13 09:48:08] [INFO ] Transformed 849 transitions.
[2023-03-13 09:48:08] [INFO ] Found NUPN structural information;
[2023-03-13 09:48:08] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 520 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 9) seen :7
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-13 09:48:09] [INFO ] Flow matrix only has 573 transitions (discarded 1 similar events)
// Phase 1: matrix 573 rows 81 cols
[2023-03-13 09:48:09] [INFO ] Computed 13 place invariants in 22 ms
[2023-03-13 09:48:09] [INFO ] [Real]Absence check using 13 positive place invariants in 42 ms returned sat
[2023-03-13 09:48:10] [INFO ] After 397ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 09:48:10] [INFO ] State equation strengthened by 259 read => feed constraints.
[2023-03-13 09:48:10] [INFO ] After 62ms SMT Verify possible using 259 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:48:10] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:48:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 09:48:10] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:48:10] [INFO ] After 48ms SMT Verify possible using 259 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:48:10] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-13 09:48:10] [INFO ] After 726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 574/574 transitions.
Graph (complete) has 853 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 80 transition count 563
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 72 transition count 563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 72 transition count 562
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 71 transition count 562
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 28 place count 64 transition count 499
Iterating global reduction 2 with 7 rules applied. Total rules applied 35 place count 64 transition count 499
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 62 transition count 497
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 62 transition count 489
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 111 place count 54 transition count 433
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 54 transition count 433
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 53 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 52 transition count 432
Applied a total of 114 rules in 248 ms. Remains 52 /81 variables (removed 29) and now considering 432/574 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 52/81 places, 432/574 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1852340 steps, run timeout after 3001 ms. (steps per millisecond=617 ) properties seen :{}
Probabilistic random walk after 1852340 steps, saw 233358 distinct states, run finished after 3010 ms. (steps per millisecond=615 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 52 cols
[2023-03-13 09:48:14] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-13 09:48:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-13 09:48:14] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:48:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2023-03-13 09:48:14] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:48:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:48:14] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:48:14] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 09:48:14] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 432/432 transitions.
Applied a total of 0 rules in 14 ms. Remains 52 /52 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 52/52 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 432/432 transitions.
Applied a total of 0 rules in 18 ms. Remains 52 /52 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-03-13 09:48:14] [INFO ] Invariant cache hit.
[2023-03-13 09:48:15] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-13 09:48:15] [INFO ] Invariant cache hit.
[2023-03-13 09:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:48:15] [INFO ] Implicit Places using invariants and state equation in 642 ms returned [47, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 856 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 50/52 places, 432/432 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 431
Applied a total of 2 rules in 21 ms. Remains 49 /50 variables (removed 1) and now considering 431/432 (removed 1) transitions.
// Phase 1: matrix 431 rows 49 cols
[2023-03-13 09:48:15] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-13 09:48:16] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-13 09:48:16] [INFO ] Invariant cache hit.
[2023-03-13 09:48:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:48:17] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/52 places, 431/432 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2041 ms. Remains : 49/52 places, 431/432 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2013118 steps, run visited all 1 properties in 2725 ms. (steps per millisecond=738 )
Probabilistic random walk after 2013118 steps, saw 249966 distinct states, run finished after 2725 ms. (steps per millisecond=738 ) properties seen :1
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 11442 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_08a
(NrP: 81 NrTr: 849 NrArc: 8894)

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

net check time: 0m 0.013sec

init dd package: 0m 3.083sec


RS generation: 1m 0.261sec


-> reachability set: #nodes 95344 (9.5e+04) #states 992,718,112 (8)



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

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

abstracting: (p42<=1)
states: 992,718,112 (8)
-> the formula is TRUE

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

MC time: 0m 0.014sec

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

abstracting: (p30<=1)
states: 992,718,112 (8)
-> the formula is FALSE

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

MC time: 0m 0.049sec

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

abstracting: (p39<=1)
states: 992,718,112 (8)
-> the formula is TRUE

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

MC time: 0m 0.028sec

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

abstracting: (p35<=p32)
states: 875,503,711 (8)
MC time: 4m33.016sec

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

abstracting: (p6<=p47)
states: 898,580,452 (8)
MC time: 4m12.002sec

checking: EF [[~ [p73<=1] | 1<=p70]]
normalized: E [true U [1<=p70 | ~ [p73<=1]]]

abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p70)
states: 11,529,602 (7)
MC time: 3m52.000sec

checking: AG [[1<=p33 | [1<=p23 | p5<=0]]]
normalized: ~ [E [true U ~ [[1<=p33 | [1<=p23 | p5<=0]]]]]

abstracting: (p5<=0)
states: 883,281,467 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (1<=p33)
states: 139,344,164 (8)

before gc: list nodes free: 1431568

after gc: idd nodes used:341038, unused:63658962; list nodes free:302521025
MC time: 3m34.000sec

checking: EF [~ [[[p63<=p18 | ~ [1<=p22]] | p34<=0]]]
normalized: E [true U ~ [[p34<=0 | [p63<=p18 | ~ [1<=p22]]]]]

abstracting: (1<=p22)
states: 148,533,941 (8)
abstracting: (p63<=p18)
states: 875,503,711 (8)
abstracting: (p34<=0)
states: 853,373,948 (8)
MC time: 3m18.000sec

checking: AG [[[p14<=p10 | ~ [p58<=p34]] | p49<=p25]]
normalized: ~ [E [true U ~ [[p49<=p25 | [p14<=p10 | ~ [p58<=p34]]]]]]

abstracting: (p58<=p34)
states: 872,779,330 (8)
abstracting: (p14<=p10)
states: 869,743,525 (8)
abstracting: (p49<=p25)
states: 875,503,711 (8)
MC time: 3m 3.000sec

checking: EF [[[~ [p66<=1] | ~ [p70<=1]] & [~ [1<=p66] | [[p65<=0 | p35<=1] & p72<=p39]]]]
normalized: E [true U [[[p72<=p39 & [p65<=0 | p35<=1]] | ~ [1<=p66]] & [~ [p70<=1] | ~ [p66<=1]]]]

abstracting: (p66<=1)
states: 992,718,112 (8)
abstracting: (p70<=1)
states: 992,718,112 (8)
abstracting: (1<=p66)
states: 139,344,164 (8)
abstracting: (p35<=1)
states: 992,718,112 (8)
abstracting: (p65<=0)
states: 853,373,948 (8)
abstracting: (p72<=p39)
states: 813,909,281 (8)
-> the formula is FALSE

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

MC time: 0m 0.282sec

checking: AG [[p2<=1 | ~ [[p41<=1 | [~ [[p60<=0 & [[[p20<=0 & p52<=1] | [p8<=p31 & p42<=0]] | ~ [1<=p80]]]] & ~ [[[p58<=1 & 1<=p62] | 1<=p58]]]]]]]
normalized: ~ [E [true U ~ [[p2<=1 | ~ [[p41<=1 | [~ [[1<=p58 | [p58<=1 & 1<=p62]]] & ~ [[p60<=0 & [~ [1<=p80] | [[p8<=p31 & p42<=0] | [p20<=0 & p52<=1]]]]]]]]]]]]

abstracting: (p52<=1)
states: 992,718,112 (8)
abstracting: (p20<=0)
states: 853,373,948 (8)
abstracting: (p42<=0)
states: 854,444,540 (8)
abstracting: (p8<=p31)
states: 898,580,452 (8)
abstracting: (1<=p80)
states: 165,497,961 (8)
abstracting: (p60<=0)
states: 844,184,170 (8)
abstracting: (1<=p62)
states: 139,344,164 (8)
abstracting: (p58<=1)
states: 992,718,112 (8)
abstracting: (1<=p58)
states: 139,344,164 (8)
abstracting: (p41<=1)
states: 992,718,112 (8)
abstracting: (p2<=1)
states: 992,718,112 (8)
-> the formula is TRUE

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

MC time: 0m 1.035sec

checking: AG [~ [[~ [[p12<=p52 | [[[[~ [p72<=p61] & ~ [1<=p77]] & [p75<=0 | [1<=p50 & p13<=0]]] & [p74<=p4 | p19<=1]] | [[1<=p56 | ~ [p36<=1]] | [p70<=1 & ~ [p1<=p71]]]]]] & 1<=p39]]]
normalized: ~ [E [true U [1<=p39 & ~ [[p12<=p52 | [[[p70<=1 & ~ [p1<=p71]] | [1<=p56 | ~ [p36<=1]]] | [[p74<=p4 | p19<=1] & [[p75<=0 | [1<=p50 & p13<=0]] & [~ [1<=p77] & ~ [p72<=p61]]]]]]]]]]

abstracting: (p72<=p61)
states: 810,846,022 (8)
abstracting: (1<=p77)
states: 198,157,836 (8)
abstracting: (p13<=0)
states: 853,373,948 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p75<=0)
states: 794,560,276 (8)
abstracting: (p19<=1)
states: 992,718,112 (8)
abstracting: (p74<=p4)
states: 762,263,639 (8)
abstracting: (p36<=1)
states: 992,718,112 (8)
abstracting: (1<=p56)
states: 138,273,572 (8)
abstracting: (p1<=p71)
states: 211,206,945 (8)
abstracting: (p70<=1)
states: 992,718,112 (8)
abstracting: (p12<=p52)
states: 872,779,330 (8)
abstracting: (1<=p39)
states: 148,533,942 (8)
-> the formula is FALSE

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

MC time: 0m48.866sec

checking: AG [[[[~ [p54<=0] & p56<=p44] | [~ [[p27<=p53 & ~ [[~ [[p62<=1 | 1<=p60]] & [1<=p53 & [1<=p6 | 1<=p74]]]]]] | ~ [[~ [[[[1<=p23 | p64<=0] | [p53<=p61 & 1<=p25]] & ~ [p8<=0]]] & [p32<=p58 & 1<=p78]]]]] | 1<=p9]]
normalized: ~ [E [true U ~ [[1<=p9 | [[~ [[[p32<=p58 & 1<=p78] & ~ [[~ [p8<=0] & [[p53<=p61 & 1<=p25] | [1<=p23 | p64<=0]]]]]] | ~ [[p27<=p53 & ~ [[[1<=p53 & [1<=p6 | 1<=p74]] & ~ [[p62<=1 | 1<=p60]]]]]]] | [p56<=p44 & ~ [p54<=0]]]]]]]

abstracting: (p54<=0)
states: 853,373,948 (8)
abstracting: (p56<=p44)
states: 873,675,586 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p62<=1)
states: 992,718,112 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (1<=p6)
states: 109,436,645 (8)
abstracting: (1<=p53)
states: 148,533,942 (8)
abstracting: (p27<=p53)
states: 874,619,743 (8)
abstracting: (p64<=0)
states: 844,184,171 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (1<=p25)
states: 148,533,942 (8)
abstracting: (p53<=p61)
states: 865,429,965 (8)
abstracting: (p8<=0)
states: 883,281,467 (8)
abstracting: (1<=p78)
states: 198,157,836 (8)
abstracting: (p32<=p58)
states: 865,429,965 (8)
abstracting: (1<=p9)
states: 109,436,645 (8)
MC time: 3m34.000sec

checking: EF [[[1<=p77 & 1<=p40] & [[[[~ [1<=p34] & ~ [p62<=1]] & p20<=1] & [[~ [[[p60<=0 | p20<=p17] | [p29<=0 | 1<=p60]]] & ~ [[1<=p45 | 1<=p38]]] & [[[[p14<=p51 & ~ [1<=p40]] | [[1<=p52 & p1<=1] | [p4<=1 | p15<=p78]]] | p51<=p13] | [p73<=1 | ~ [p70<=p33]]]]] | ~ [p37<=0]]]]
normalized: E [true U [[~ [p37<=0] | [[[[p73<=1 | ~ [p70<=p33]] | [p51<=p13 | [[[p4<=1 | p15<=p78] | [1<=p52 & p1<=1]] | [p14<=p51 & ~ [1<=p40]]]]] & [~ [[1<=p45 | 1<=p38]] & ~ [[[p29<=0 | 1<=p60] | [p60<=0 | p20<=p17]]]]] & [p20<=1 & [~ [p62<=1] & ~ [1<=p34]]]]] & [1<=p77 & 1<=p40]]]

abstracting: (1<=p40)
states: 139,344,164 (8)
abstracting: (1<=p77)
states: 198,157,836 (8)
abstracting: (1<=p34)
states: 139,344,164 (8)
abstracting: (p62<=1)
states: 992,718,112 (8)
abstracting: (p20<=1)
states: 992,718,112 (8)
abstracting: (p20<=p17)
states: 872,779,330 (8)
abstracting: (p60<=0)
states: 844,184,170 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p29<=0)
states: 844,184,171 (8)
abstracting: (1<=p38)
states: 139,344,164 (8)
abstracting: (1<=p45)
states: 139,344,164 (8)
abstracting: (1<=p40)
states: 139,344,164 (8)
abstracting: (p14<=p51)
states: 873,675,586 (8)
abstracting: (p1<=1)
states: 992,718,112 (8)
abstracting: (1<=p52)
states: 139,344,164 (8)
abstracting: (p15<=p78)
states: 873,831,719 (8)
abstracting: (p4<=1)
states: 992,718,112 (8)
abstracting: (p51<=p13)
states: 872,779,330 (8)
abstracting: (p70<=p33)
states: 982,835,596 (8)
abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (p37<=0)
states: 853,373,948 (8)
-> the formula is TRUE

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

MC time: 1m45.973sec

checking: EF [[~ [[[~ [[[[~ [p50<=1] & p69<=0] | ~ [[p16<=p44 | p75<=p3]]] | [[[1<=p68 & p13<=p73] | [1<=p61 | 1<=p41]] | ~ [[1<=p55 & 1<=p4]]]]] | [[[[[p80<=p74 | 1<=p69] | ~ [1<=p20]] & ~ [p45<=p2]] | [p14<=1 & ~ [p61<=p69]]] | ~ [[1<=p74 & [p31<=p36 & 1<=p63]]]]] | [[~ [p36<=0] & [[[[p34<=p9 | 1<=p17] | ~ [1<=p14]] | 1<=p37] & 1<=p2]] | ~ [[~ [1<=p68] | ~ [[[p24<=p46 | 1<=p74] | [p60<=p57 | p44<=p4]]]]]]]] & ~ [p78<=1]]]
normalized: E [true U [~ [p78<=1] & ~ [[[~ [[~ [[[p60<=p57 | p44<=p4] | [p24<=p46 | 1<=p74]]] | ~ [1<=p68]]] | [[1<=p2 & [1<=p37 | [~ [1<=p14] | [p34<=p9 | 1<=p17]]]] & ~ [p36<=0]]] | [[~ [[1<=p74 & [p31<=p36 & 1<=p63]]] | [[p14<=1 & ~ [p61<=p69]] | [~ [p45<=p2] & [~ [1<=p20] | [p80<=p74 | 1<=p69]]]]] | ~ [[[~ [[1<=p55 & 1<=p4]] | [[1<=p61 | 1<=p41] | [1<=p68 & p13<=p73]]] | [~ [[p16<=p44 | p75<=p3]] | [p69<=0 & ~ [p50<=1]]]]]]]]]]

abstracting: (p50<=1)
states: 992,718,112 (8)
abstracting: (p69<=0)
states: 981,188,510 (8)
abstracting: (p75<=p3)
states: 806,089,878 (8)
abstracting: (p16<=p44)
states: 872,779,330 (8)
abstracting: (p13<=p73)
states: 893,183,948 (8)
abstracting: (1<=p68)
states: 11,529,602 (7)
abstracting: (1<=p41)
states: 139,344,164 (8)
abstracting: (1<=p61)
states: 139,344,164 (8)
abstracting: (1<=p4)
states: 109,436,645 (8)
abstracting: (1<=p55)
states: 139,344,164 (8)
abstracting: (1<=p69)
states: 11,529,602 (7)
abstracting: (p80<=p74)
states: 866,453,464 (8)
abstracting: (1<=p20)
states: 139,344,164 (8)
abstracting: (p45<=p2)
states: 862,712,857 (8)
abstracting: (p61<=p69)
states: 855,021,034 (8)
abstracting: (p14<=1)
states: 992,718,112 (8)
abstracting: (1<=p63)
states: 138,273,572 (8)
abstracting: (p31<=p36)
states: 874,619,743 (8)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p36<=0)
states: 844,184,171 (8)
abstracting: (1<=p17)
states: 139,344,164 (8)
abstracting: (p34<=p9)
states: 868,672,933 (8)
abstracting: (1<=p14)
states: 138,273,572 (8)
abstracting: (1<=p37)
states: 139,344,164 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (1<=p68)
states: 11,529,602 (7)
abstracting: (1<=p74)
states: 257,325,353 (8)
abstracting: (p24<=p46)
states: 874,619,743 (8)
abstracting: (p44<=p4)
states: 868,672,933 (8)
abstracting: (p60<=p57)
states: 844,184,170 (8)
abstracting: (p78<=1)
states: 992,718,112 (8)
-> the formula is FALSE

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

MC time: 0m 2.378sec

checking: EF [[[[[[[[[[1<=p3 & p15<=p38] | [1<=p15 | 1<=p11]] & [p16<=p9 | 1<=p24]] & [[1<=p56 | [p22<=0 | p72<=p29]] | [~ [p6<=1] & p53<=1]]] | ~ [[[~ [1<=p50] | [p21<=0 & p6<=p42]] & [1<=p47 & ~ [1<=p47]]]]] & 1<=p2] | [[[[[~ [p22<=1] | p79<=1] & [[p38<=1 | p45<=p57] | ~ [1<=p18]]] | [~ [[1<=p55 & p27<=1]] | [[1<=p72 & p43<=p50] & [p65<=p55 | 1<=p51]]]] | [[[[p65<=p57 | p6<=p58] | [p21<=p36 & p10<=p41]] & p80<=0] & [[1<=p71 & [1<=p36 & p7<=0]] & p44<=1]]] & [[~ [[~ [p12<=p66] & 1<=p60]] & [p34<=p30 | [~ [p39<=p76] & [p20<=1 & 1<=p38]]]] & [~ [p65<=1] | [[~ [1<=p46] & ~ [p38<=p39]] | 1<=p10]]]]] & [~ [[p77<=p31 | ~ [[1<=p1 & p42<=p1]]]] & [~ [[p46<=p72 & p34<=1]] | 1<=p77]]] & [[~ [[[p35<=p3 & p6<=0] & [1<=p17 | [p26<=p71 | p21<=p68]]]] & ~ [p0<=1]] & [~ [1<=p26] | [~ [p13<=p40] | [~ [[[~ [p39<=p53] | [p37<=p37 & p59<=p15]] & [~ [p39<=p66] & [1<=p52 | 1<=p32]]]] & ~ [[~ [1<=p79] & [[p39<=p14 & 1<=p35] & [p68<=0 | p62<=p0]]]]]]]]]]
normalized: E [true U [[[[[~ [[[[p68<=0 | p62<=p0] & [p39<=p14 & 1<=p35]] & ~ [1<=p79]]] & ~ [[[[1<=p52 | 1<=p32] & ~ [p39<=p66]] & [[p37<=p37 & p59<=p15] | ~ [p39<=p53]]]]] | ~ [p13<=p40]] | ~ [1<=p26]] & [~ [p0<=1] & ~ [[[1<=p17 | [p26<=p71 | p21<=p68]] & [p35<=p3 & p6<=0]]]]] & [[[1<=p77 | ~ [[p46<=p72 & p34<=1]]] & ~ [[p77<=p31 | ~ [[1<=p1 & p42<=p1]]]]] & [[[[[1<=p10 | [~ [p38<=p39] & ~ [1<=p46]]] | ~ [p65<=1]] & [[p34<=p30 | [[p20<=1 & 1<=p38] & ~ [p39<=p76]]] & ~ [[1<=p60 & ~ [p12<=p66]]]]] & [[[p44<=1 & [1<=p71 & [1<=p36 & p7<=0]]] & [p80<=0 & [[p21<=p36 & p10<=p41] | [p65<=p57 | p6<=p58]]]] | [[[[p65<=p55 | 1<=p51] & [1<=p72 & p43<=p50]] | ~ [[1<=p55 & p27<=1]]] | [[~ [1<=p18] | [p38<=1 | p45<=p57]] & [p79<=1 | ~ [p22<=1]]]]]] | [1<=p2 & [~ [[[1<=p47 & ~ [1<=p47]] & [[p21<=0 & p6<=p42] | ~ [1<=p50]]]] | [[[p53<=1 & ~ [p6<=1]] | [1<=p56 | [p22<=0 | p72<=p29]]] & [[p16<=p9 | 1<=p24] & [[1<=p15 | 1<=p11] | [1<=p3 & p15<=p38]]]]]]]]]]

abstracting: (p15<=p38)
states: 865,429,966 (8)
abstracting: (1<=p3)
states: 63,412,811 (7)
abstracting: (1<=p11)
states: 98,156,357 (7)
abstracting: (1<=p15)
states: 148,533,941 (8)
abstracting: (1<=p24)
states: 139,344,164 (8)
abstracting: (p16<=p9)
states: 868,672,933 (8)
abstracting: (p72<=p29)
states: 813,909,281 (8)
abstracting: (p22<=0)
states: 844,184,171 (8)
abstracting: (1<=p56)
states: 138,273,572 (8)
abstracting: (p6<=1)
states: 992,718,112 (8)
abstracting: (p53<=1)
states: 992,718,112 (8)
abstracting: (1<=p50)
states: 148,533,941 (8)
abstracting: (p6<=p42)
states: 898,580,452 (8)
abstracting: (p21<=0)
states: 854,444,540 (8)
abstracting: (1<=p47)
states: 139,344,164 (8)
abstracting: (1<=p47)
states: 139,344,164 (8)
abstracting: (1<=p2)
states: 65,092,428 (7)
abstracting: (p22<=1)
states: 992,718,112 (8)
abstracting: (p79<=1)
states: 992,718,112 (8)
abstracting: (p45<=p57)
states: 874,619,743 (8)
abstracting: (p38<=1)
states: 992,718,112 (8)
abstracting: (1<=p18)
states: 148,533,942 (8)
abstracting: (p27<=1)
states: 992,718,112 (8)
abstracting: (1<=p55)
states: 139,344,164 (8)
abstracting: (p43<=p50)
states: 865,429,966 (8)
abstracting: (1<=p72)
states: 211,206,944 (8)
abstracting: (1<=p51)
states: 139,344,164 (8)
abstracting: (p65<=p55)
states: 872,779,330 (8)
abstracting: (p6<=p58)
states: 898,580,452 (8)
abstracting: (p65<=p57)
states: 874,619,743 (8)
abstracting: (p10<=p41)
states: 898,580,452 (8)
abstracting: (p21<=p36)
states: 875,503,711 (8)
abstracting: (p80<=0)
states: 827,220,151 (8)
abstracting: (p7<=0)
states: 883,281,467 (8)
abstracting: (1<=p36)
states: 148,533,941 (8)
abstracting: (1<=p71)
states: 211,206,944 (8)
abstracting: (p44<=1)
states: 992,718,112 (8)
abstracting: (p12<=p66)
states: 872,779,330 (8)
abstracting: (1<=p60)
states: 148,533,942 (8)
abstracting: (p39<=p76)
states: 963,070,564 (8)
abstracting: (1<=p38)
states: 139,344,164 (8)
abstracting: (p20<=1)
states: 992,718,112 (8)
abstracting: (p34<=p30)
states: 872,779,330 (8)
abstracting: (p65<=1)
states: 992,718,112 (8)
abstracting: (1<=p46)
states: 148,533,942 (8)
abstracting: (p38<=p39)
states: 853,373,948 (8)
abstracting: (1<=p10)
states: 109,436,645 (8)
abstracting: (p42<=p1)
states: 992,718,112 (8)
abstracting: (1<=p1)
states: 992,718,111 (8)
abstracting: (p77<=p31)
states: 822,332,824 (8)
abstracting: (p34<=1)
states: 992,718,112 (8)
abstracting: (p46<=p72)
states: 876,582,283 (8)
abstracting: (1<=p77)
states: 198,157,836 (8)
abstracting: (p6<=0)
states: 883,281,467 (8)
abstracting: (p35<=p3)
states: 863,503,513 (8)
abstracting: (p21<=p68)
states: 856,091,626 (8)
abstracting: (p26<=p71)
states: 882,708,802 (8)
abstracting: (1<=p17)
states: 139,344,164 (8)
abstracting: (p0<=1)
states: 992,718,112 (8)
abstracting: (1<=p26)
states: 139,344,164 (8)
abstracting: (p13<=p40)
states: 872,779,330 (8)
abstracting: (p39<=p53)
states: 865,429,966 (8)
abstracting: (p59<=p15)
states: 874,619,743 (8)
abstracting: (p37<=p37)
states: 992,718,112 (8)
abstracting: (p39<=p66)
states: 865,429,965 (8)
abstracting: (1<=p32)
states: 148,533,942 (8)
abstracting: (1<=p52)
states: 139,344,164 (8)
abstracting: (1<=p79)
states: 430,904,478 (8)
abstracting: (1<=p35)
states: 138,273,572 (8)
abstracting: (p39<=p14)
states: 865,243,341 (8)
abstracting: (p62<=p0)
states: 853,373,948 (8)
abstracting: (p68<=0)
states: 981,188,510 (8)
-> the formula is FALSE

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

MC time: 0m 4.681sec

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

abstracting: (p35<=p32)
states: 875,503,711 (8)

before gc: list nodes free: 2464273

after gc: idd nodes used:2660644, unused:61339356; list nodes free:291732467
-> the formula is FALSE

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

MC time: 6m45.432sec

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

abstracting: (p6<=p47)
states: 898,580,452 (8)
-> the formula is FALSE

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

MC time: 9m 0.628sec

checking: EF [[~ [p73<=1] | 1<=p70]]
normalized: E [true U [1<=p70 | ~ [p73<=1]]]

abstracting: (p73<=1)
states: 992,718,112 (8)
abstracting: (1<=p70)
states: 11,529,602 (7)

before gc: list nodes free: 878958

after gc: idd nodes used:2670893, unused:61329107; list nodes free:291687585
-> the formula is TRUE

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

MC time: 8m37.332sec

checking: AG [[1<=p33 | [1<=p23 | p5<=0]]]
normalized: ~ [E [true U ~ [[1<=p33 | [1<=p23 | p5<=0]]]]]

abstracting: (p5<=0)
states: 883,281,467 (8)
abstracting: (1<=p23)
states: 139,344,164 (8)
abstracting: (1<=p33)
states: 139,344,164 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5891216 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098344 kB

BK_TIME_CONFINEMENT_REACHED

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

46963 66552 101505 98395 77069 78920 79899 84309 84764 85403 85292 85488 85799 90961 90961 91521 91213 91510 92508 91717 92273 91926 94096 92785 92859 93396 110964 94739 95453 95154 95261 95921 97285 96581 95559 95683 95790 95779 96134 95821 95908 95891 96909 96837 96927 96683 95731 99056 95694 97386 95882 95799 95772 95841 95760 95666 95810
iterations count:5717545 (6734), effective:41371 (48)

initing FirstDep: 0m 0.013sec

43149 42812 49123 49696 47393 53629 54624 52800 57770 59612 57656 54104 59044 63185 61445 68060 69353 66375 71275 75280 73860 72359 76794 74229 75674 66798 64680 64731 64512 67745 63256 66095 70123 75190 76035 77264 75379 84700 89185 84714 87331 86549 81761 83360 86357 84290 84496 85129 87040 88221 82471 82554 79411 79612 73691 85323 89758 98088 100522 99461 101966 98916 99001 98351 102566 99450 97465 109121 116744 120834 123603 120327 122189 121796
sat_reach.icc:155: Timeout: after 272 sec

47750 51650 52303 56802 62396 59634 61350 58437 68136 65454 75922 71378 69863 69804 67947 71152 74251 69212 71874 76050 79385 77682 78539 84410 91572 95977 86429 87621 81932 85220 84011 84473 86017 87028 82489 81718 87020 91416 88963 84537 79950 76683 86821 83147 95547 99575
sat_reach.icc:155: Timeout: after 251 sec

28701 33824 32239 31347 36997 39116 38593 37778 36836 41260 44974 43862 46640 51307 55641 48798 47121 47290 46899 49777 46130 45595 51643 51049 57875 57900 56109 56199 57277 59550 66210 65143 72758 73091 62490 65744 66024 61985 61786 63312 61635 61993 62441 62952 63163 65001 60053 59513 59691 59159 66939 70762 67083 72533 77380 80528
sat_reach.icc:155: Timeout: after 231 sec

46935 50780 51368 56927 62389 58373 57257 57652 63718 63791 73001 77373 69671 68661 67817 69459 66080 64258 70311 74677 79120 75668 77120 78951 86690 89727 93397 95213 84653 84417 80249 82533 81558 81750 82438 85202 82224 79389 78972 77970 73727
sat_reach.icc:155: Timeout: after 213 sec

34342 36099 37140 34700 36648 45172 48795 46511 44856 47475 45612 51341 55739 54456 56125 55495 54598 53252 60949 66227 62211 64552 60922 62066 58114 54127 54154 54085 52539 60998 67856 65368 67408 67071 65094 76046 81381 79045 80463 79639 78277 69323 83707 89900 86297 88514 87590
sat_reach.icc:155: Timeout: after 197 sec

31931 31628 32341 41459 42027 41140 40306 38758 50168 52126 58043 56072 55331 56185 54666 58816 53826 55806 50988 59598 61423 67524 67960 78992 77695 84257 82758 78205 77998 80192 74006 77601 76881 75628 76298 78592 82019 81957 75040 75111 70425 76451 74978 71280 77751 83208 84075 87789 96044 97826 94692
sat_reach.icc:155: Timeout: after 182 sec

46268 47547 50487 48152 52564 55829 54973 54244 55117 56615 58039 58071 63429 60696 60681 60609 61113 59941 57823 62101 58655
iterations count:2140241 (2520), effective:12160 (14)
108042 112540 114155 114290 113740 120913 124681 128489 120477 121577 117968 127517 132204 134591 130665 136464 138841 144109 137479 134526 135277 133944 135394 132405 126526 132636 139077 140921 146493 146917 141798 141925 145011 152959
sat_reach.icc:155: Timeout: after 213 sec

49421 55519 54181 57549 61314 58904 58831 62391 66518 67075 67382 69941 65144 65984 64387 68049 70223 74859 71936 70943 79122 78305 82204 74202 75500 72704 72873 71995 75618 71197
iterations count:3077595 (3624), effective:16764 (19)
43149 42812 49123 49696 47393 53629 54624 52800 57770 59612 57656 54104 59044 63185 61445 68060 69353 66375 71275 75280 73860 72359 76794 74229 75674 66798 64680 64731 64512 67745 63256 66095 70123 75190 76035 77264 75379 84700 89185 84714 87331 86549 81761 83360 86357 84290 84496 85129 87040 88221 82471 82554 79411 79612 73691 85323 89758 98088 100522 99461 101966 98916 99001 98351 102566 99450 97465 109121 116744 120834 123603 120327 122189 121796 115073 114792 112639 116764 110197 111501 106033 108809 109188 112698 111260 113211 110441 110616 111164 112036 109104 109827 115680 114151 116099 120260 114833 113774 108202 108143 106741 109831 104277 102907 102611 104074 100875 101904
iterations count:10885603 (12821), effective:54566 (64)
47750 51650 52303 56802 62396 59634 61350 58437 68136 65454 75922 71378 69863 69804 67947 71152 74251 69212 71874 76050 79385 77682 78539 84410 91572 95977 86429 87621 81932 85220 84011 84473 86017 87028 82489 81718 87020 91416 88963 84537 79950 76683 86821 83147 95547 99575 92022 90536 90964 92646 90214 98228 106023 101909 109761 120350 106798 97606 101698 98782 102942 96917 94395 96164 98987 98977 97151 97137 98042 96073 99116 99447 104057 97745 92379 94398 93456 94954 89196 94955 95180 91676 109733 97985 88871 92086 90953 90865 83810 78834
iterations count:9010188 (10612), effective:44925 (52)
28701 33824 32239 31347 36997 39116 38593 37778 36836 41260 44974 43862 46640 51307 55641 48798 47121 47290 46899 49777 46130 45595 51643 51049 57875 57900 56109 56199 57277 59550 66210 65143 72758 73091 62490 65744 66024 61985 61786 63312 61635 61993 62441 62952 63163 65001 60053 59513 59691 59159 66939 70762 67083 72533 77380 80528 74978 76497 74208 75584 74716 76762 77193 73424 77453 85753 85563 84349 86503 92232 98824 101147 89803 91390 83578 87963 86239 84335 87478 81277 81685 77923 80814 80341 83372 85357 83264 81823 81577 81040 82028 82257 79686 80496 84849 83609 82051 86142 85699 81795 76307 78559 77383 77031 78800 73851 72413
iterations count:10720009 (12626), effective:50568 (59)
46935 50780 51368 56927 62389 58373 57257 57652 63718 63791 73001 77373 69671 68661 67817 69459 66080 64258 70311 74677 79120 75668 77120 78951 86690 89727 93397 95213 84653 84417 80249 82533 81558 81750 82438 85202 82224 79389 78972 77970 73727 80116 87118 82515 93386 95670 91864 87490 91121 89496 92234 89679 93631 106198 99169 101053

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-08a"
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-08a, 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-167813599300646"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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