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.r007-oct2-167813595800623.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 lolaxred
Input is AutonomousCar-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595800623
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678351948524

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:52:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:52:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:52:31] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-09 08:52:31] [INFO ] Transformed 289 places.
[2023-03-09 08:52:31] [INFO ] Transformed 644 transitions.
[2023-03-09 08:52:31] [INFO ] Found NUPN structural information;
[2023-03-09 08:52:31] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 57 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 16) seen :7
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :3
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 644 rows 289 cols
[2023-03-09 08:52:32] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-09 08:52:33] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 08:52:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 52 ms returned sat
[2023-03-09 08:52:34] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 08:52:35] [INFO ] Deduced a trap composed of 35 places in 595 ms of which 43 ms to minimize.
[2023-03-09 08:52:35] [INFO ] Deduced a trap composed of 35 places in 591 ms of which 1 ms to minimize.
[2023-03-09 08:52:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1249 ms
[2023-03-09 08:52:36] [INFO ] After 2943ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 488 ms.
[2023-03-09 08:52:36] [INFO ] After 3745ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 63 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Graph (trivial) has 169 edges and 289 vertex of which 4 / 289 are part of one of the 2 SCC in 18 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 282 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 282 transition count 556
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 103 rules applied. Total rules applied 186 place count 201 transition count 534
Reduce places removed 12 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 23 rules applied. Total rules applied 209 place count 189 transition count 523
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 222 place count 178 transition count 521
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 222 place count 178 transition count 506
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 252 place count 163 transition count 506
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 278 place count 137 transition count 480
Iterating global reduction 4 with 26 rules applied. Total rules applied 304 place count 137 transition count 480
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 148 rules applied. Total rules applied 452 place count 137 transition count 332
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 454 place count 136 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 455 place count 135 transition count 331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 455 place count 135 transition count 330
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 457 place count 134 transition count 330
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 458 place count 133 transition count 329
Iterating global reduction 7 with 1 rules applied. Total rules applied 459 place count 133 transition count 329
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 485 place count 120 transition count 316
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 486 place count 120 transition count 315
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 500 place count 120 transition count 301
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 514 place count 106 transition count 301
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 516 place count 106 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 517 place count 105 transition count 300
Applied a total of 517 rules in 187 ms. Remains 105 /289 variables (removed 184) and now considering 300/644 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 105/289 places, 300/644 transitions.
Incomplete random walk after 10000 steps, including 242 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 963522 steps, run timeout after 3003 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 963522 steps, saw 152516 distinct states, run finished after 3007 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 300 rows 105 cols
[2023-03-09 08:52:40] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-09 08:52:40] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:52:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-09 08:52:41] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:52:41] [INFO ] After 289ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 08:52:41] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-09 08:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-09 08:52:41] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 430 ms.
[2023-03-09 08:52:42] [INFO ] After 1629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 63 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 300/300 transitions.
Applied a total of 0 rules in 19 ms. Remains 105 /105 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 105/105 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 300/300 transitions.
Applied a total of 0 rules in 15 ms. Remains 105 /105 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2023-03-09 08:52:42] [INFO ] Invariant cache hit.
[2023-03-09 08:52:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 08:52:42] [INFO ] Invariant cache hit.
[2023-03-09 08:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:52:42] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 243 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/105 places, 300/300 transitions.
Applied a total of 0 rules in 12 ms. Remains 104 /104 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 270 ms. Remains : 104/105 places, 300/300 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 727466 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 727466 steps, saw 114932 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 300 rows 104 cols
[2023-03-09 08:52:45] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:52:46] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 08:52:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 08:52:46] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 08:52:46] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-09 08:52:47] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2023-03-09 08:52:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-03-09 08:52:47] [INFO ] After 1203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 361 ms.
[2023-03-09 08:52:47] [INFO ] After 1648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 63 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 300/300 transitions.
Applied a total of 0 rules in 15 ms. Remains 104 /104 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 104/104 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 300/300 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2023-03-09 08:52:47] [INFO ] Invariant cache hit.
[2023-03-09 08:52:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 08:52:47] [INFO ] Invariant cache hit.
[2023-03-09 08:52:47] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-09 08:52:47] [INFO ] Redundant transitions in 27 ms returned [273]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 299 rows 104 cols
[2023-03-09 08:52:47] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:52:48] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 299/300 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 479 ms. Remains : 104/104 places, 299/300 transitions.
Incomplete random walk after 10000 steps, including 238 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:52:48] [INFO ] Invariant cache hit.
[2023-03-09 08:52:48] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:52:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-03-09 08:52:48] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 08:52:49] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 2 ms to minimize.
[2023-03-09 08:52:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-09 08:52:49] [INFO ] After 978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-09 08:52:49] [INFO ] After 1296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 63 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 299/299 transitions.
Applied a total of 0 rules in 24 ms. Remains 104 /104 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 104/104 places, 299/299 transitions.
Incomplete random walk after 10000 steps, including 247 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
[2023-03-09 08:52:50] [INFO ] Invariant cache hit.
[2023-03-09 08:52:50] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:52:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-09 08:52:50] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:52:50] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 26 ms to minimize.
[2023-03-09 08:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-09 08:52:50] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-09 08:52:51] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 47 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 299/299 transitions.
Graph (complete) has 642 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 103 transition count 294
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 100 transition count 294
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 100 transition count 292
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 98 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 97 transition count 291
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 97 transition count 291
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 93 transition count 287
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 93 transition count 279
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 85 transition count 279
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 85 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 84 transition count 278
Applied a total of 41 rules in 40 ms. Remains 84 /104 variables (removed 20) and now considering 278/299 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 84/104 places, 278/299 transitions.
Incomplete random walk after 10000 steps, including 290 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2481308 steps, run timeout after 3001 ms. (steps per millisecond=826 ) properties seen :{}
Probabilistic random walk after 2481308 steps, saw 365883 distinct states, run finished after 3001 ms. (steps per millisecond=826 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 278 rows 84 cols
[2023-03-09 08:52:54] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-09 08:52:54] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:52:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 08:52:54] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:52:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:52:54] [INFO ] After 157ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:52:55] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-09 08:52:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-09 08:52:55] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-09 08:52:55] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 47 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 278/278 transitions.
Applied a total of 0 rules in 12 ms. Remains 84 /84 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 84/84 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 278/278 transitions.
Applied a total of 0 rules in 22 ms. Remains 84 /84 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-09 08:52:55] [INFO ] Invariant cache hit.
[2023-03-09 08:52:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-09 08:52:55] [INFO ] Invariant cache hit.
[2023-03-09 08:52:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:52:55] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-09 08:52:55] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 08:52:55] [INFO ] Invariant cache hit.
[2023-03-09 08:52:55] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 84/84 places, 278/278 transitions.
Graph (complete) has 586 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 3 place count 82 transition count 278
Applied a total of 3 rules in 6 ms. Remains 82 /84 variables (removed 2) and now considering 278/278 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 278 rows 82 cols
[2023-03-09 08:52:55] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-09 08:52:55] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:52:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 28 ms returned sat
[2023-03-09 08:52:56] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:52:56] [INFO ] After 151ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:52:56] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-09 08:52:56] [INFO ] After 794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:52:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 16 ms.
[2023-03-09 08:52:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 84 places, 278 transitions and 2207 arcs took 6 ms.
[2023-03-09 08:52:56] [INFO ] Flatten gal took : 100 ms
Total runtime 25837 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-06b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability

FORMULA AutonomousCar-PT-06b-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678351977569

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 AutonomousCar-PT-06b-ReachabilityFireability-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 AutonomousCar-PT-06b-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 AutonomousCar-PT-06b-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 AutonomousCar-PT-06b-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for AutonomousCar-PT-06b-ReachabilityFireability-08
lola: result : true
lola: markings : 44031
lola: fired transitions : 79180
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for AutonomousCar-PT-06b-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 5 (type EQUN) for AutonomousCar-PT-06b-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 8 (type EXCL) for AutonomousCar-PT-06b-ReachabilityFireability-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-06b-ReachabilityFireability-08: AG false tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutonomousCar-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595800623"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;