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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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 517K 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-08b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678639573879

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:46:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:46:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:46:17] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-12 16:46:17] [INFO ] Transformed 357 places.
[2023-03-12 16:46:17] [INFO ] Transformed 1128 transitions.
[2023-03-12 16:46:17] [INFO ] Found NUPN structural information;
[2023-03-12 16:46:17] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 90 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1128 rows 357 cols
[2023-03-12 16:46:19] [INFO ] Computed 13 place invariants in 19 ms
[2023-03-12 16:46:21] [INFO ] [Real]Absence check using 13 positive place invariants in 35 ms returned sat
[2023-03-12 16:46:21] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 16:46:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-12 16:46:25] [INFO ] After 3651ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 16:46:27] [INFO ] Deduced a trap composed of 35 places in 2031 ms of which 10 ms to minimize.
[2023-03-12 16:46:31] [INFO ] Deduced a trap composed of 35 places in 4087 ms of which 40 ms to minimize.
[2023-03-12 16:46:34] [INFO ] Deduced a trap composed of 35 places in 2771 ms of which 38 ms to minimize.
[2023-03-12 16:46:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 9131 ms
[2023-03-12 16:46:35] [INFO ] Deduced a trap composed of 38 places in 945 ms of which 23 ms to minimize.
[2023-03-12 16:46:36] [INFO ] Deduced a trap composed of 35 places in 705 ms of which 16 ms to minimize.
[2023-03-12 16:46:37] [INFO ] Deduced a trap composed of 36 places in 628 ms of which 4 ms to minimize.
[2023-03-12 16:46:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2592 ms
[2023-03-12 16:46:39] [INFO ] Deduced a trap composed of 33 places in 422 ms of which 1 ms to minimize.
[2023-03-12 16:46:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2023-03-12 16:46:40] [INFO ] After 18783ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 2568 ms.
[2023-03-12 16:46:42] [INFO ] After 21727ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 84 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 202 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.13 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 348 transition count 1027
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 104 rules applied. Total rules applied 198 place count 257 transition count 1014
Reduce places removed 6 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 21 rules applied. Total rules applied 219 place count 251 transition count 999
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 237 place count 236 transition count 996
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 235 transition count 996
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 26 Pre rules applied. Total rules applied 238 place count 235 transition count 970
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 290 place count 209 transition count 970
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 318 place count 181 transition count 942
Iterating global reduction 5 with 28 rules applied. Total rules applied 346 place count 181 transition count 942
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 349 place count 181 transition count 939
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 389 place count 161 transition count 919
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 394 place count 161 transition count 914
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 413 place count 161 transition count 895
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 432 place count 142 transition count 895
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 434 place count 142 transition count 893
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 438 place count 142 transition count 893
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 439 place count 141 transition count 892
Applied a total of 439 rules in 693 ms. Remains 141 /357 variables (removed 216) and now considering 892/1128 (removed 236) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 694 ms. Remains : 141/357 places, 892/1128 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 892 rows 141 cols
[2023-03-12 16:46:44] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-12 16:46:45] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:46:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:46:47] [INFO ] After 2349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:46:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:46:49] [INFO ] After 2031ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:46:52] [INFO ] Deduced a trap composed of 13 places in 2022 ms of which 1 ms to minimize.
[2023-03-12 16:46:52] [INFO ] Deduced a trap composed of 16 places in 396 ms of which 10 ms to minimize.
[2023-03-12 16:46:53] [INFO ] Deduced a trap composed of 16 places in 689 ms of which 35 ms to minimize.
[2023-03-12 16:46:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3348 ms
[2023-03-12 16:46:54] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 0 ms to minimize.
[2023-03-12 16:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-12 16:46:57] [INFO ] Deduced a trap composed of 17 places in 1854 ms of which 0 ms to minimize.
[2023-03-12 16:47:00] [INFO ] Deduced a trap composed of 15 places in 2749 ms of which 42 ms to minimize.
[2023-03-12 16:47:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4738 ms
[2023-03-12 16:47:00] [INFO ] After 12606ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2095 ms.
[2023-03-12 16:47:02] [INFO ] After 17322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 79 ms.
Support contains 83 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 892/892 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 141 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 891
Applied a total of 2 rules in 140 ms. Remains 140 /141 variables (removed 1) and now considering 891/892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 140/141 places, 891/892 transitions.
Incomplete random walk after 10000 steps, including 232 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 891 rows 140 cols
[2023-03-12 16:47:03] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 16:47:04] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:47:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 79 ms returned sat
[2023-03-12 16:47:07] [INFO ] After 2976ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:47:09] [INFO ] After 2313ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:10] [INFO ] Deduced a trap composed of 15 places in 535 ms of which 3 ms to minimize.
[2023-03-12 16:47:11] [INFO ] Deduced a trap composed of 16 places in 947 ms of which 0 ms to minimize.
[2023-03-12 16:47:13] [INFO ] Deduced a trap composed of 16 places in 1477 ms of which 1 ms to minimize.
[2023-03-12 16:47:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3134 ms
[2023-03-12 16:47:16] [INFO ] Deduced a trap composed of 14 places in 1685 ms of which 33 ms to minimize.
[2023-03-12 16:47:17] [INFO ] Deduced a trap composed of 13 places in 1082 ms of which 0 ms to minimize.
[2023-03-12 16:47:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2887 ms
[2023-03-12 16:47:17] [INFO ] After 10371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2094 ms.
[2023-03-12 16:47:19] [INFO ] After 15844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 130 ms.
Support contains 83 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 891/891 transitions.
Applied a total of 0 rules in 30 ms. Remains 140 /140 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 140/140 places, 891/891 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:47:20] [INFO ] Invariant cache hit.
[2023-03-12 16:47:21] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:47:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-12 16:47:24] [INFO ] After 2655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:47:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:47:25] [INFO ] After 1843ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:47:27] [INFO ] Deduced a trap composed of 25 places in 867 ms of which 36 ms to minimize.
[2023-03-12 16:47:27] [INFO ] Deduced a trap composed of 17 places in 702 ms of which 0 ms to minimize.
[2023-03-12 16:47:29] [INFO ] Deduced a trap composed of 15 places in 2032 ms of which 1 ms to minimize.
[2023-03-12 16:47:30] [INFO ] Deduced a trap composed of 16 places in 428 ms of which 1 ms to minimize.
[2023-03-12 16:47:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4268 ms
[2023-03-12 16:47:31] [INFO ] Deduced a trap composed of 15 places in 628 ms of which 0 ms to minimize.
[2023-03-12 16:47:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 715 ms
[2023-03-12 16:47:33] [INFO ] Deduced a trap composed of 13 places in 494 ms of which 1 ms to minimize.
[2023-03-12 16:47:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 592 ms
[2023-03-12 16:47:33] [INFO ] After 9199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1619 ms.
[2023-03-12 16:47:34] [INFO ] After 13864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 189 ms.
Support contains 83 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 891/891 transitions.
Applied a total of 0 rules in 46 ms. Remains 140 /140 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 140/140 places, 891/891 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 362504 steps, run timeout after 3010 ms. (steps per millisecond=120 ) properties seen :{3=1}
Probabilistic random walk after 362504 steps, saw 59767 distinct states, run finished after 3012 ms. (steps per millisecond=120 ) properties seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-12 16:47:38] [INFO ] Invariant cache hit.
[2023-03-12 16:47:38] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:47:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-12 16:47:40] [INFO ] After 1575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:47:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:47:41] [INFO ] After 1079ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:47:42] [INFO ] Deduced a trap composed of 16 places in 356 ms of which 0 ms to minimize.
[2023-03-12 16:47:43] [INFO ] Deduced a trap composed of 15 places in 941 ms of which 1 ms to minimize.
[2023-03-12 16:47:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1471 ms
[2023-03-12 16:47:44] [INFO ] Deduced a trap composed of 17 places in 519 ms of which 1 ms to minimize.
[2023-03-12 16:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2023-03-12 16:47:44] [INFO ] After 4297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1306 ms.
[2023-03-12 16:47:46] [INFO ] After 7271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 45 ms.
Support contains 56 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 891/891 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 140 transition count 879
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 129 transition count 877
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 127 transition count 876
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 127 transition count 875
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 126 transition count 875
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 123 transition count 872
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 123 transition count 872
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 292 place count 123 transition count 616
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 306 place count 116 transition count 609
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 307 place count 115 transition count 608
Iterating global reduction 4 with 1 rules applied. Total rules applied 308 place count 115 transition count 608
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 318 place count 115 transition count 598
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 328 place count 105 transition count 598
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 329 place count 105 transition count 597
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 334 place count 105 transition count 597
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 335 place count 104 transition count 596
Applied a total of 335 rules in 184 ms. Remains 104 /140 variables (removed 36) and now considering 596/891 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 104/140 places, 596/891 transitions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 219 ms. (steps per millisecond=45 ) 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 28 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 28 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 596 rows 104 cols
[2023-03-12 16:47:46] [INFO ] Computed 13 place invariants in 17 ms
[2023-03-12 16:47:46] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:47:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 98 ms returned sat
[2023-03-12 16:47:47] [INFO ] After 615ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:47:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:47:48] [INFO ] After 509ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:47:48] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 0 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 27 ms to minimize.
[2023-03-12 16:47:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 653 ms
[2023-03-12 16:47:49] [INFO ] After 1672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 446 ms.
[2023-03-12 16:47:49] [INFO ] After 3003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 42 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 596/596 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 589
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 97 transition count 587
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 95 transition count 587
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 20 place count 93 transition count 570
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 93 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 93 transition count 569
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 92 transition count 568
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 29 place count 92 transition count 564
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 41 place count 88 transition count 556
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 43 place count 88 transition count 556
Applied a total of 43 rules in 126 ms. Remains 88 /104 variables (removed 16) and now considering 556/596 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 88/104 places, 556/596 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 678543 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 678543 steps, saw 110378 distinct states, run finished after 3011 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 556 rows 88 cols
[2023-03-12 16:47:53] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 16:47:53] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:47:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 104 ms returned sat
[2023-03-12 16:47:54] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:47:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:47:54] [INFO ] After 284ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:47:55] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-12 16:47:55] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 0 ms to minimize.
[2023-03-12 16:47:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 647 ms
[2023-03-12 16:47:55] [INFO ] After 1320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-12 16:47:56] [INFO ] After 2599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 42 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 556/556 transitions.
Applied a total of 0 rules in 17 ms. Remains 88 /88 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 88/88 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 556/556 transitions.
Applied a total of 0 rules in 30 ms. Remains 88 /88 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2023-03-12 16:47:56] [INFO ] Invariant cache hit.
[2023-03-12 16:47:56] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:47:56] [INFO ] Invariant cache hit.
[2023-03-12 16:47:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:47:57] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned [82, 87]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1230 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 86/88 places, 556/556 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 86 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 85 transition count 555
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 85 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 84 transition count 554
Applied a total of 4 rules in 61 ms. Remains 84 /86 variables (removed 2) and now considering 554/556 (removed 2) transitions.
// Phase 1: matrix 554 rows 84 cols
[2023-03-12 16:47:57] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-12 16:47:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 16:47:57] [INFO ] Invariant cache hit.
[2023-03-12 16:47:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:47:58] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/88 places, 554/556 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1838 ms. Remains : 84/88 places, 554/556 transitions.
Incomplete random walk after 10000 steps, including 284 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 695566 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 695566 steps, saw 113658 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 16:48:01] [INFO ] Invariant cache hit.
[2023-03-12 16:48:01] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:48:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-12 16:48:02] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:48:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:48:02] [INFO ] After 559ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:48:03] [INFO ] After 1015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 486 ms.
[2023-03-12 16:48:03] [INFO ] After 2216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 42 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 554/554 transitions.
Applied a total of 0 rules in 16 ms. Remains 84 /84 variables (removed 0) and now considering 554/554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 84/84 places, 554/554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 554/554 transitions.
Applied a total of 0 rules in 16 ms. Remains 84 /84 variables (removed 0) and now considering 554/554 (removed 0) transitions.
[2023-03-12 16:48:03] [INFO ] Invariant cache hit.
[2023-03-12 16:48:04] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-12 16:48:04] [INFO ] Invariant cache hit.
[2023-03-12 16:48:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 16:48:05] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2023-03-12 16:48:05] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 16:48:05] [INFO ] Invariant cache hit.
[2023-03-12 16:48:06] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2293 ms. Remains : 84/84 places, 554/554 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 553
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 84 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 83 transition count 552
Applied a total of 3 rules in 30 ms. Remains 83 /84 variables (removed 1) and now considering 552/554 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 552 rows 83 cols
[2023-03-12 16:48:06] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 16:48:06] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 16:48:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 79 ms returned sat
[2023-03-12 16:48:06] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 16:48:07] [INFO ] After 775ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 490 ms.
[2023-03-12 16:48:07] [INFO ] After 1494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 16:48:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-12 16:48:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 84 places, 554 transitions and 6615 arcs took 5 ms.
[2023-03-12 16:48:08] [INFO ] Flatten gal took : 168 ms
Total runtime 110984 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/672/inv_0_ --invariant=/tmp/672/inv_1_ --inv-par
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678639934760

--------------------
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
mcc2023
rfs formula name AutonomousCar-PT-08b-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/672/inv_0_
rfs formula name AutonomousCar-PT-08b-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/672/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 84 places, 554 transitions and 6615 arcs
pnml2lts-sym: Petri net AutonomousCar_PT_08b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 554->535 groups
pnml2lts-sym: Regrouping took 0.200 real 0.200 user 0.000 sys
pnml2lts-sym: state vector length is 84; there are 535 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/672/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 12553675 group checks and 0 next state calls
pnml2lts-sym: reachability took 243.700 real 973.580 user 0.420 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 361088256 states, 62761 nodes
pnml2lts-sym: group_next: 14759 nodes total
pnml2lts-sym: group_explored: 21414 nodes, 5051167 short vectors total
pnml2lts-sym: max token count: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-08b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-08b, 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 r009-oct2-167813598200655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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