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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 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 228K 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-06b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678699901642

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-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:31:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:31:45] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-13 09:31:45] [INFO ] Transformed 289 places.
[2023-03-13 09:31:45] [INFO ] Transformed 644 transitions.
[2023-03-13 09:31:45] [INFO ] Found NUPN structural information;
[2023-03-13 09:31:45] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 27 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 11) seen :7
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 644 rows 289 cols
[2023-03-13 09:31:45] [INFO ] Computed 11 place invariants in 25 ms
[2023-03-13 09:31:47] [INFO ] After 976ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 09:31:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-13 09:31:47] [INFO ] After 599ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-13 09:31:48] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 8 ms to minimize.
[2023-03-13 09:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-13 09:31:48] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-13 09:31:48] [INFO ] After 1730ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 36 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 208 edges and 289 vertex of which 4 / 289 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 958 edges and 287 vertex of which 280 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 280 transition count 551
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 94 rules applied. Total rules applied 180 place count 198 transition count 539
Reduce places removed 5 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 20 rules applied. Total rules applied 200 place count 193 transition count 524
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 20 rules applied. Total rules applied 220 place count 178 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 222 place count 176 transition count 519
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 222 place count 176 transition count 507
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 246 place count 164 transition count 507
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 266 place count 144 transition count 487
Iterating global reduction 5 with 20 rules applied. Total rules applied 286 place count 144 transition count 487
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 5 with 146 rules applied. Total rules applied 432 place count 144 transition count 341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 432 place count 144 transition count 340
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 434 place count 143 transition count 340
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 438 place count 139 transition count 316
Iterating global reduction 6 with 4 rules applied. Total rules applied 442 place count 139 transition count 316
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 502 place count 109 transition count 286
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 505 place count 106 transition count 265
Iterating global reduction 6 with 3 rules applied. Total rules applied 508 place count 106 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 510 place count 105 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 511 place count 105 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 515 place count 105 transition count 260
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 522 place count 105 transition count 253
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 529 place count 98 transition count 253
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 530 place count 98 transition count 252
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 531 place count 98 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 532 place count 97 transition count 251
Applied a total of 532 rules in 229 ms. Remains 97 /289 variables (removed 192) and now considering 251/644 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 97/289 places, 251/644 transitions.
Incomplete random walk after 10000 steps, including 300 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 906626 steps, run timeout after 3001 ms. (steps per millisecond=302 ) properties seen :{}
Probabilistic random walk after 906626 steps, saw 148249 distinct states, run finished after 3005 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 251 rows 97 cols
[2023-03-13 09:31:52] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-13 09:31:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:31:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 56 ms returned sat
[2023-03-13 09:31:52] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:31:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:31:53] [INFO ] After 122ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:31:53] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-13 09:31:53] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 36 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 251/251 transitions.
Applied a total of 0 rules in 8 ms. Remains 97 /97 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 97/97 places, 251/251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 251/251 transitions.
Applied a total of 0 rules in 20 ms. Remains 97 /97 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2023-03-13 09:31:53] [INFO ] Invariant cache hit.
[2023-03-13 09:31:53] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-13 09:31:53] [INFO ] Invariant cache hit.
[2023-03-13 09:31:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:31:54] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-03-13 09:31:54] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 09:31:54] [INFO ] Invariant cache hit.
[2023-03-13 09:31:55] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1807 ms. Remains : 97/97 places, 251/251 transitions.
Applied a total of 0 rules in 13 ms. Remains 97 /97 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-13 09:31:55] [INFO ] Invariant cache hit.
[2023-03-13 09:31:55] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:31:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 29 ms returned sat
[2023-03-13 09:31:55] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:31:55] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 2 ms to minimize.
[2023-03-13 09:31:56] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-13 09:31:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
[2023-03-13 09:31:56] [INFO ] After 865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-13 09:31:56] [INFO ] After 1117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:31:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 40 ms.
[2023-03-13 09:31:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 251 transitions and 1917 arcs took 5 ms.
[2023-03-13 09:31:56] [INFO ] Flatten gal took : 139 ms
Total runtime 12143 ms.
There are residual formulas that ITS could not solve within timeout
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_06b
(NrP: 97 NrTr: 251 NrArc: 1917)

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

net check time: 0m 0.000sec

init dd package: 0m 2.898sec


RS generation: 0m16.213sec


-> reachability set: #nodes 19706 (2.0e+04) #states 183,043,248 (8)



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

checking: AG [[[[[[[[0<=p56 & p56<=0] | [p57<=1 & 1<=p57]] & [p85<=1 & 1<=p85]] & [p54<=0 & 0<=p54]] | [[p36<=0 & 0<=p36] & [[p26<=0 & 0<=p26] & [p32<=1 & 1<=p32]]]] | [[p70<=1 & 1<=p70] | [[p78<=0 & 0<=p78] & [p67<=1 & 1<=p67]]]] | [[[0<=p17 & p17<=0] | [1<=p80 & p80<=1]] | [0<=p93 & p93<=0]]]]
normalized: ~ [E [true U ~ [[[[0<=p93 & p93<=0] | [[1<=p80 & p80<=1] | [0<=p17 & p17<=0]]] | [[[[[p26<=0 & 0<=p26] & [p32<=1 & 1<=p32]] & [p36<=0 & 0<=p36]] | [[p54<=0 & 0<=p54] & [[[0<=p56 & p56<=0] | [p57<=1 & 1<=p57]] & [p85<=1 & 1<=p85]]]] | [[[p67<=1 & 1<=p67] & [p78<=0 & 0<=p78]] | [p70<=1 & 1<=p70]]]]]]]

abstracting: (1<=p70)
states: 22,435,992 (7)
abstracting: (p70<=1)
states: 183,043,248 (8)
abstracting: (0<=p78)
states: 183,043,248 (8)
abstracting: (p78<=0)
states: 180,720,816 (8)
abstracting: (1<=p67)
states: 22,435,992 (7)
abstracting: (p67<=1)
states: 183,043,248 (8)
abstracting: (1<=p85)
states: 30,505,248 (7)
abstracting: (p85<=1)
states: 183,043,248 (8)
abstracting: (1<=p57)
states: 6,534,144 (6)
abstracting: (p57<=1)
states: 183,043,248 (8)
abstracting: (p56<=0)
states: 164,446,944 (8)
abstracting: (0<=p56)
states: 183,043,248 (8)
abstracting: (0<=p54)
states: 183,043,248 (8)
abstracting: (p54<=0)
states: 176,509,104 (8)
abstracting: (0<=p36)
states: 183,043,248 (8)
abstracting: (p36<=0)
states: 158,587,776 (8)
abstracting: (1<=p32)
states: 72
abstracting: (p32<=1)
states: 183,043,248 (8)
abstracting: (0<=p26)
states: 183,043,248 (8)
abstracting: (p26<=0)
states: 161,523,816 (8)
abstracting: (p17<=0)
states: 160,607,256 (8)
abstracting: (0<=p17)
states: 183,043,248 (8)
abstracting: (p80<=1)
states: 183,043,248 (8)
abstracting: (1<=p80)
states: 69,709,824 (7)
abstracting: (p93<=0)
states: 172,874,832 (8)
abstracting: (0<=p93)
states: 183,043,248 (8)
-> the formula is FALSE

FORMULA AutonomousCar-PT-06b-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.636sec

checking: AG [[[[[[p51<=1 & 1<=p51] | [p76<=1 & 1<=p76]] | [p47<=0 & 0<=p47]] | [[p35<=0 & 0<=p35] | [p61<=0 & 0<=p61]]] | [[[[0<=p73 & p73<=0] & [p37<=1 & 1<=p37]] | [[p1<=0 & 0<=p1] & [p74<=1 & 1<=p74]]] | [[[[[p64<=1 & 1<=p64] | [[p31<=0 & 0<=p31] | [p83<=1 & 1<=p83]]] | [[p15<=0 & 0<=p15] | [[p23<=1 & 1<=p23] | [p49<=1 & 1<=p49]]]] & [[p90<=0 & 0<=p90] | [p94<=1 & 1<=p94]]] | [[[p48<=1 & 1<=p48] & [p65<=1 & 1<=p65]] | [[[[p22<=1 & 1<=p22] | [p12<=0 & 0<=p12]] | [p26<=0 & 0<=p26]] & [[p3<=0 & 0<=p3] | [p44<=1 & 1<=p44]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[p37<=1 & 1<=p37] & [0<=p73 & p73<=0]] | [[p74<=1 & 1<=p74] & [p1<=0 & 0<=p1]]] | [[[[[p44<=1 & 1<=p44] | [p3<=0 & 0<=p3]] & [[p26<=0 & 0<=p26] | [[p12<=0 & 0<=p12] | [p22<=1 & 1<=p22]]]] | [[p65<=1 & 1<=p65] & [p48<=1 & 1<=p48]]] | [[[p94<=1 & 1<=p94] | [p90<=0 & 0<=p90]] & [[[[p49<=1 & 1<=p49] | [p23<=1 & 1<=p23]] | [p15<=0 & 0<=p15]] | [[[p83<=1 & 1<=p83] | [p31<=0 & 0<=p31]] | [p64<=1 & 1<=p64]]]]]] | [[[p61<=0 & 0<=p61] | [p35<=0 & 0<=p35]] | [[p47<=0 & 0<=p47] | [[p76<=1 & 1<=p76] | [p51<=1 & 1<=p51]]]]]]]]

abstracting: (1<=p51)
states: 20,852,532 (7)
abstracting: (p51<=1)
states: 183,043,248 (8)
abstracting: (1<=p76)
states: 2,322,432 (6)
abstracting: (p76<=1)
states: 183,043,248 (8)
abstracting: (0<=p47)
states: 183,043,248 (8)
abstracting: (p47<=0)
states: 163,718,880 (8)
abstracting: (0<=p35)
states: 183,043,248 (8)
abstracting: (p35<=0)
states: 158,587,776 (8)
abstracting: (0<=p61)
states: 183,043,248 (8)
abstracting: (p61<=0)
states: 164,446,944 (8)
abstracting: (1<=p64)
states: 120
abstracting: (p64<=1)
states: 183,043,248 (8)
abstracting: (0<=p31)
states: 183,043,248 (8)
abstracting: (p31<=0)
states: 159,746,280 (8)
abstracting: (1<=p83)
states: 12,400,592 (7)
abstracting: (p83<=1)
states: 183,043,248 (8)
abstracting: (0<=p15)
states: 183,043,248 (8)
abstracting: (p15<=0)
states: 160,607,256 (8)
abstracting: (1<=p23)
states: 21,519,432 (7)
abstracting: (p23<=1)
states: 183,043,248 (8)
abstracting: (1<=p49)
states: 19,324,368 (7)
abstracting: (p49<=1)
states: 183,043,248 (8)
abstracting: (0<=p90)
states: 183,043,248 (8)
abstracting: (p90<=0)
states: 149,054,352 (8)
abstracting: (1<=p94)
states: 10,168,416 (7)
abstracting: (p94<=1)
states: 183,043,248 (8)
abstracting: (1<=p48)
states: 19,324,368 (7)
abstracting: (p48<=1)
states: 183,043,248 (8)
abstracting: (1<=p65)
states: 22,435,992 (7)
abstracting: (p65<=1)
states: 183,043,248 (8)
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 183,043,248 (8)
abstracting: (0<=p12)
states: 183,043,248 (8)
abstracting: (p12<=0)
states: 183,043,236 (8)
abstracting: (0<=p26)
states: 183,043,248 (8)
abstracting: (p26<=0)
states: 161,523,816 (8)
abstracting: (0<=p3)
states: 183,043,248 (8)
abstracting: (p3<=0)
states: 92,111,544 (7)
abstracting: (1<=p44)
states: 19,324,368 (7)
abstracting: (p44<=1)
states: 183,043,248 (8)
abstracting: (0<=p1)
states: 183,043,248 (8)
abstracting: (p1<=0)
states: 182,453,328 (8)
abstracting: (1<=p74)
states: 8,128,512 (6)
abstracting: (p74<=1)
states: 183,043,248 (8)
abstracting: (p73<=0)
states: 180,720,816 (8)
abstracting: (0<=p73)
states: 183,043,248 (8)
abstracting: (1<=p37)
states: 8,211,456 (6)
abstracting: (p37<=1)
states: 183,043,248 (8)
-> the formula is FALSE

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

MC time: 0m 3.529sec

totally nodes used: 6581552 (6.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 42450280 84314339 126764619
used/not used/entry size/cache size: 49084447 18024417 16 1024MB
basic ops cache: hits/miss/sum: 4276795 7317473 11594268
used/not used/entry size/cache size: 8989334 7787882 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: 102151 242477 344628
used/not used/entry size/cache size: 239652 8148956 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 61226389
1 5271415
2 532870
3 69301
4 8026
5 793
6 66
7 3
8 1
9 0
>= 10 0

Total processing time: 0m34.827sec


BK_STOP 1678699952089

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

16288 22964 26684 34676
iterations count:490414 (1953), effective:12385 (49)

initing FirstDep: 0m 0.013sec

20517 24516
iterations count:226692 (903), effective:7407 (29)
17538
iterations count:140138 (558), effective:3317 (13)

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-06b"
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-06b, 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-167813599300622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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