Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167400300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K May 18 16:42 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-06a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717213042940

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:37:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 03:37:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:37:25] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-06-01 03:37:25] [INFO ] Transformed 65 places.
[2024-06-01 03:37:26] [INFO ] Transformed 417 transitions.
[2024-06-01 03:37:26] [INFO ] Found NUPN structural information;
[2024-06-01 03:37:26] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 595 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 244
Applied a total of 4 rules in 52 ms. Remains 63 /65 variables (removed 2) and now considering 244/258 (removed 14) transitions.
[2024-06-01 03:37:26] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 63 cols
[2024-06-01 03:37:26] [INFO ] Computed 11 invariants in 49 ms
[2024-06-01 03:37:26] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-06-01 03:37:26] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
[2024-06-01 03:37:26] [INFO ] Invariant cache hit.
[2024-06-01 03:37:27] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-06-01 03:37:27] [INFO ] Implicit Places using invariants and state equation in 355 ms returned [58, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 829 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 244/258 transitions.
Applied a total of 0 rules in 12 ms. Remains 61 /61 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 956 ms. Remains : 61/65 places, 244/258 transitions.
Support contains 32 out of 61 places after structural reductions.
[2024-06-01 03:37:27] [INFO ] Flatten gal took : 164 ms
[2024-06-01 03:37:27] [INFO ] Flatten gal took : 78 ms
[2024-06-01 03:37:28] [INFO ] Input system was already deterministic with 244 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (2282 resets) in 3631 ms. (11 steps per ms) remains 6/23 properties
BEST_FIRST walk for 40004 steps (223 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (202 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (211 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (211 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (208 resets) in 94 ms. (421 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (218 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
[2024-06-01 03:37:29] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 61 cols
[2024-06-01 03:37:29] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 03:37:29] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/37 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/57 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 239/296 variables, 57/66 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 134/200 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/302 variables, 3/203 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/303 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/304 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/304 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 205 constraints, problems are : Problem set: 2 solved, 3 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/57 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 239/296 variables, 57/66 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 134/200 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/302 variables, 3/203 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 3/206 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/206 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/303 variables, 1/207 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/304 variables, 1/208 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/304 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 208 constraints, problems are : Problem set: 2 solved, 3 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1706ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 715 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 244/244 transitions.
Graph (complete) has 502 edges and 61 vertex of which 59 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 232
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 52 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 52 transition count 231
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 51 transition count 231
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 48 transition count 216
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 48 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 45 transition count 213
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 45 transition count 207
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 74 place count 39 transition count 177
Applied a total of 74 rules in 136 ms. Remains 39 /61 variables (removed 22) and now considering 177/244 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 39/61 places, 177/244 transitions.
RANDOM walk for 40000 steps (116 resets) in 454 ms. (87 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (252 resets) in 107 ms. (370 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (351 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
// Phase 1: matrix 177 rows 39 cols
[2024-06-01 03:37:32] [INFO ] Computed 10 invariants in 12 ms
[2024-06-01 03:37:32] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 177/216 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 91/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 39/39 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 177/216 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 91/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 39/39 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 655ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 177/177 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 176
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 170
Applied a total of 8 rules in 28 ms. Remains 38 /39 variables (removed 1) and now considering 170/177 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 38/39 places, 170/177 transitions.
RANDOM walk for 40000 steps (55 resets) in 355 ms. (112 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (354 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
// Phase 1: matrix 170 rows 38 cols
[2024-06-01 03:37:33] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 03:37:33] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/38 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 170/208 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 85/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/38 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 170/208 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 85/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 38/38 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 170/170 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 37 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 163
Applied a total of 2 rules in 16 ms. Remains 37 /38 variables (removed 1) and now considering 163/170 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 37/38 places, 163/170 transitions.
RANDOM walk for 40000 steps (75 resets) in 303 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (355 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 240 steps, run visited all 1 properties in 10 ms. (steps per millisecond=24 )
Probabilistic random walk after 240 steps, saw 200 distinct states, run finished after 17 ms. (steps per millisecond=14 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 8 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-06-01 03:37:34] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:37:34] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 03:37:34] [INFO ] Invariant cache hit.
[2024-06-01 03:37:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 03:37:34] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-01 03:37:34] [INFO ] Invariant cache hit.
[2024-06-01 03:37:34] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-01 03:37:39] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 17 ms to minimize.
[2024-06-01 03:37:40] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 3 ms to minimize.
[2024-06-01 03:37:40] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 13362 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 22327 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 36895ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 36904ms
Starting structural reductions in LTL mode, iteration 1 : 56/61 places, 215/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37308 ms. Remains : 56/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 371 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 110 reset in 384 ms.
Product exploration explored 100000 steps with 59 reset in 270 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 35484 steps (1995 resets) in 439 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-06-01 03:38:13] [INFO ] Invariant cache hit.
[2024-06-01 03:38:14] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 03:38:14] [INFO ] Invariant cache hit.
[2024-06-01 03:38:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 03:38:14] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-01 03:38:14] [INFO ] Invariant cache hit.
[2024-06-01 03:38:14] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-01 03:38:18] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-06-01 03:38:19] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 2 ms to minimize.
[2024-06-01 03:38:19] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12799 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21707 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 35421ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 35427ms
Finished structural reductions in LTL mode , in 1 iterations and 35834 ms. Remains : 56/56 places, 215/215 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2307 resets) in 346 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (207 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10406 steps, run visited all 1 properties in 65 ms. (steps per millisecond=160 )
Probabilistic random walk after 10406 steps, saw 2283 distinct states, run finished after 66 ms. (steps per millisecond=157 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 126 ms.
Product exploration explored 100000 steps with 34 reset in 236 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 56 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 56 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 56 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 56 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 55 transition count 216
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 55 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 219
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 14 rules in 54 ms. Remains 55 /56 variables (removed 1) and now considering 219/215 (removed -4) transitions.
[2024-06-01 03:38:52] [INFO ] Redundant transitions in 43 ms returned []
Running 218 sub problems to find dead transitions.
// Phase 1: matrix 219 rows 55 cols
[2024-06-01 03:38:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:38:52] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 03:38:54] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 03:38:54] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 03:38:55] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-01 03:38:55] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 03:38:55] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 03:38:55] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 03:38:55] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/15 constraints. Problems are: Problem set: 7 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 211 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 4 (OVERLAPS) 218/273 variables, 55/70 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 114/184 constraints. Problems are: Problem set: 15 solved, 203 unsolved
[2024-06-01 03:38:59] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/185 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/185 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/274 variables, 1/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 186 constraints, problems are : Problem set: 15 solved, 203 unsolved in 16364 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 8/51 variables, 8/8 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/16 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 217/268 variables, 51/67 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 114/181 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 203/384 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/384 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 5/273 variables, 4/388 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/388 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 1/274 variables, 1/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 389 constraints, problems are : Problem set: 15 solved, 203 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 203/218 constraints, Known Traps: 8/8 constraints]
After SMT, in 47377ms problems are : Problem set: 15 solved, 203 unsolved
Search for dead transitions found 15 dead transitions in 47382ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/56 places, 204/215 transitions.
Graph (complete) has 493 edges and 55 vertex of which 44 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 44 /55 variables (removed 11) and now considering 204/204 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/56 places, 204/215 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47507 ms. Remains : 44/56 places, 204/215 transitions.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-06-01 03:39:39] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 03:39:39] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 03:39:39] [INFO ] Invariant cache hit.
[2024-06-01 03:39:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 03:39:40] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-01 03:39:40] [INFO ] Invariant cache hit.
[2024-06-01 03:39:40] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-01 03:39:45] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 2 ms to minimize.
[2024-06-01 03:39:45] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-06-01 03:39:45] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15292 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 21913 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 38095ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 38099ms
Finished structural reductions in LTL mode , in 1 iterations and 38431 ms. Remains : 56/56 places, 215/215 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 163899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 4 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
[2024-06-01 03:40:18] [INFO ] Invariant cache hit.
[2024-06-01 03:40:18] [INFO ] Implicit Places using invariants in 484 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 493 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(!p2)&&p1)))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 55 transition count 237
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 54 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 49 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 49 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 47 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 46 transition count 206
Applied a total of 30 rules in 33 ms. Remains 46 /61 variables (removed 15) and now considering 206/244 (removed 38) transitions.
// Phase 1: matrix 206 rows 46 cols
[2024-06-01 03:40:18] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:40:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 03:40:19] [INFO ] Invariant cache hit.
[2024-06-01 03:40:19] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-01 03:40:19] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-01 03:40:19] [INFO ] Redundant transitions in 25 ms returned []
Running 205 sub problems to find dead transitions.
[2024-06-01 03:40:19] [INFO ] Invariant cache hit.
[2024-06-01 03:40:19] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 205/251 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 112/166 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-01 03:40:23] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 168 constraints, problems are : Problem set: 0 solved, 205 unsolved in 9550 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 205/251 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 112/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 205/372 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 373 constraints, problems are : Problem set: 0 solved, 205 unsolved in 21826 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 1/1 constraints]
After SMT, in 32109ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 32112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32470 ms. Remains : 46/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p0), p2]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 32667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||(F(p3)&&p2)||p0)))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 4 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-06-01 03:40:51] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 03:40:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 03:40:51] [INFO ] Invariant cache hit.
[2024-06-01 03:40:51] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-06-01 03:40:51] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 03:40:51] [INFO ] Invariant cache hit.
[2024-06-01 03:40:51] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 03:40:55] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-06-01 03:40:55] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-06-01 03:40:55] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 03:40:56] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 11048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 21990 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 33652ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 33656ms
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33943 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05
Product exploration explored 100000 steps with 11 reset in 258 ms.
Product exploration explored 100000 steps with 33 reset in 192 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT p3)), (X (NOT p1)), (X (AND (NOT p3) (NOT p1))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
RANDOM walk for 14601 steps (806 resets) in 203 ms. (71 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT p3)), (X (NOT p1)), (X (AND (NOT p3) (NOT p1))), (X (X (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (OR p3 p0 (NOT p2)))), (F p2), (F p1), (F p3)]
Knowledge based reduction with 5 factoid took 332 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-06-01 03:41:27] [INFO ] Invariant cache hit.
[2024-06-01 03:41:27] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 03:41:27] [INFO ] Invariant cache hit.
[2024-06-01 03:41:27] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-06-01 03:41:27] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 03:41:27] [INFO ] Invariant cache hit.
[2024-06-01 03:41:27] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 03:41:32] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2024-06-01 03:41:33] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 3 ms to minimize.
[2024-06-01 03:41:33] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2024-06-01 03:41:34] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16556 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 25197 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 42573ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 42578ms
Finished structural reductions in LTL mode , in 1 iterations and 42953 ms. Remains : 57/57 places, 222/222 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT p3)), (X (NOT p1)), (X (AND (NOT p1) (NOT p3))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
RANDOM walk for 18262 steps (1010 resets) in 164 ms. (110 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT p3)), (X (NOT p1)), (X (AND (NOT p1) (NOT p3))), (X (X (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (OR p0 p2))), (F (NOT p0)), (F (NOT (OR p3 p0 (NOT p2)))), (F p2), (F p1), (F p3)]
Knowledge based reduction with 5 factoid took 354 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Entered a terminal (fully accepting) state of product in 58 steps with 3 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 80237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0&&(p1 U p2)))&&G(p0))))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 5 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-06-01 03:42:11] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:42:11] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 03:42:11] [INFO ] Invariant cache hit.
[2024-06-01 03:42:12] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-06-01 03:42:12] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 03:42:12] [INFO ] Invariant cache hit.
[2024-06-01 03:42:12] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 03:42:17] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
[2024-06-01 03:42:17] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-06-01 03:42:17] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2024-06-01 03:42:19] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 17006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 29112 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 47000ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 47005ms
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47394 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06
Product exploration explored 100000 steps with 24 reset in 124 ms.
Product exploration explored 100000 steps with 39 reset in 466 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 161 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (2296 resets) in 240 ms. (165 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (202 resets) in 429 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (205 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (202 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2024-06-01 03:43:00] [INFO ] Invariant cache hit.
[2024-06-01 03:43:00] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/278 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/278 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 3 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2170 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 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 (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 56 transition count 212
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 50 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 48 transition count 209
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 22 place count 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 43 transition count 205
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 43 transition count 201
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 62 place count 39 transition count 177
Applied a total of 62 rules in 34 ms. Remains 39 /57 variables (removed 18) and now considering 177/222 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 39/57 places, 177/222 transitions.
RANDOM walk for 33671 steps (253 resets) in 229 ms. (146 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 542 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-06-01 03:43:05] [INFO ] Invariant cache hit.
[2024-06-01 03:43:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 03:43:05] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-06-01 03:43:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:43:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-01 03:43:05] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-06-01 03:43:05] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-06-01 03:43:05] [INFO ] [Nat]Added 117 Read/Feed constraints in 23 ms returned sat
[2024-06-01 03:43:05] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 87 ms.
[2024-06-01 03:43:06] [INFO ] Added : 1 causal constraints over 1 iterations in 148 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-06-01 03:43:06] [INFO ] Invariant cache hit.
[2024-06-01 03:43:06] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 03:43:06] [INFO ] Invariant cache hit.
[2024-06-01 03:43:06] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-06-01 03:43:06] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 03:43:06] [INFO ] Invariant cache hit.
[2024-06-01 03:43:06] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 03:43:11] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-01 03:43:11] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2024-06-01 03:43:11] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2024-06-01 03:43:13] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15470 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 26872 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 43367ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 43373ms
Finished structural reductions in LTL mode , in 1 iterations and 43749 ms. Remains : 57/57 places, 222/222 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 285 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (2271 resets) in 436 ms. (91 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (209 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (201 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (203 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
[2024-06-01 03:43:50] [INFO ] Invariant cache hit.
[2024-06-01 03:43:50] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/278 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/278 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 3 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1251ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1815 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 56 transition count 212
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 50 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 48 transition count 209
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 22 place count 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 43 transition count 205
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 43 transition count 201
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 62 place count 39 transition count 177
Applied a total of 62 rules in 26 ms. Remains 39 /57 variables (removed 18) and now considering 177/222 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 39/57 places, 177/222 transitions.
RANDOM walk for 40000 steps (292 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (264 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (254 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (254 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 29885 steps, run visited all 3 properties in 141 ms. (steps per millisecond=211 )
Probabilistic random walk after 29885 steps, saw 5521 distinct states, run finished after 141 ms. (steps per millisecond=211 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 658 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-06-01 03:43:55] [INFO ] Invariant cache hit.
[2024-06-01 03:43:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 03:43:55] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-01 03:43:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:43:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 03:43:55] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 03:43:55] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-06-01 03:43:55] [INFO ] [Nat]Added 117 Read/Feed constraints in 18 ms returned sat
[2024-06-01 03:43:55] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 71 ms.
[2024-06-01 03:43:55] [INFO ] Added : 1 causal constraints over 1 iterations in 124 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 34 reset in 120 ms.
Product exploration explored 100000 steps with 108 reset in 134 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-06-01 03:43:56] [INFO ] Invariant cache hit.
[2024-06-01 03:43:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 03:43:56] [INFO ] Invariant cache hit.
[2024-06-01 03:43:56] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-06-01 03:43:56] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 03:43:56] [INFO ] Invariant cache hit.
[2024-06-01 03:43:56] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 03:44:02] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2024-06-01 03:44:02] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-06-01 03:44:02] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2024-06-01 03:44:03] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14643 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 28458 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 44042ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 44046ms
Finished structural reductions in LTL mode , in 1 iterations and 44441 ms. Remains : 57/57 places, 222/222 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 149208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p0) U p1)&&F(p2)))))'
Support contains 11 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 2 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-06-01 03:44:41] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:44:41] [INFO ] Implicit Places using invariants in 116 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X((F(p1)||G((!p0||X(!p2))))))))'
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 229
Applied a total of 6 rules in 3 ms. Remains 58 /61 variables (removed 3) and now considering 229/244 (removed 15) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-06-01 03:44:41] [INFO ] Computed 8 invariants in 9 ms
[2024-06-01 03:44:41] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 03:44:41] [INFO ] Invariant cache hit.
[2024-06-01 03:44:41] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-06-01 03:44:41] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-01 03:44:41] [INFO ] Invariant cache hit.
[2024-06-01 03:44:41] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 03:44:47] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2024-06-01 03:44:47] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2024-06-01 03:44:47] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 2 ms to minimize.
[2024-06-01 03:44:49] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 18692 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 29204 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 48816ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 48821ms
Starting structural reductions in LTL mode, iteration 1 : 58/61 places, 229/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49163 ms. Remains : 58/61 places, 229/244 transitions.
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p0 p2), (AND (NOT p1) p2 p0), (NOT p1), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-12
Product exploration explored 100000 steps with 14 reset in 121 ms.
Product exploration explored 100000 steps with 50 reset in 133 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
RANDOM walk for 40000 steps (2289 resets) in 369 ms. (108 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (206 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (197 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
[2024-06-01 03:45:31] [INFO ] Invariant cache hit.
[2024-06-01 03:45:31] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/286 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/287 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/286 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/287 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 229/229 transitions.
Graph (complete) has 486 edges and 58 vertex of which 57 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 (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 57 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 51 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 51 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 48 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 46 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 46 transition count 208
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 2 with 2 rules applied. Total rules applied 28 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 76 place count 39 transition count 165
Applied a total of 76 rules in 54 ms. Remains 39 /58 variables (removed 19) and now considering 165/229 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 39/58 places, 165/229 transitions.
RANDOM walk for 38353 steps (70 resets) in 289 ms. (132 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p2), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 385 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 373 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-06-01 03:45:34] [INFO ] Invariant cache hit.
[2024-06-01 03:45:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 03:45:34] [INFO ] Invariant cache hit.
[2024-06-01 03:45:34] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-06-01 03:45:34] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-01 03:45:34] [INFO ] Invariant cache hit.
[2024-06-01 03:45:34] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 03:45:39] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-06-01 03:45:40] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2024-06-01 03:45:40] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2024-06-01 03:45:41] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 14512 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 27824 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 43165ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 43170ms
Finished structural reductions in LTL mode , in 1 iterations and 43509 ms. Remains : 58/58 places, 229/229 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
RANDOM walk for 40000 steps (2188 resets) in 563 ms. (70 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (206 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (202 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2024-06-01 03:46:18] [INFO ] Invariant cache hit.
[2024-06-01 03:46:18] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/286 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/287 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/286 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/287 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 373 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 229/229 transitions.
Graph (complete) has 486 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 57 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 51 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 51 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 48 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 46 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 46 transition count 208
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 2 with 2 rules applied. Total rules applied 28 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 76 place count 39 transition count 165
Applied a total of 76 rules in 37 ms. Remains 39 /58 variables (removed 19) and now considering 165/229 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 39/58 places, 165/229 transitions.
RANDOM walk for 36484 steps (73 resets) in 375 ms. (97 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 452 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 363 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 375 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 53 reset in 170 ms.
Product exploration explored 100000 steps with 112 reset in 274 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 343 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 58 transition count 231
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 58 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 20 ms. Remains 58 /58 variables (removed 0) and now considering 234/229 (removed -5) transitions.
[2024-06-01 03:46:22] [INFO ] Redundant transitions in 44 ms returned []
Running 233 sub problems to find dead transitions.
// Phase 1: matrix 234 rows 58 cols
[2024-06-01 03:46:22] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:46:22] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-06-01 03:46:25] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 03:46:25] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 03:46:25] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 03:46:25] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 03:46:26] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 03:46:26] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-06-01 03:46:26] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 7/15 constraints. Problems are: Problem set: 7 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 226 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 4 (OVERLAPS) 233/291 variables, 58/73 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 126/199 constraints. Problems are: Problem set: 14 solved, 219 unsolved
[2024-06-01 03:46:30] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-06-01 03:46:30] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 2/201 constraints. Problems are: Problem set: 14 solved, 219 unsolved
[2024-06-01 03:46:32] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/202 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/202 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/292 variables, 1/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/292 variables, 0/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 203 constraints, problems are : Problem set: 14 solved, 219 unsolved in 17124 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 14 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 8/55 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 10/18 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 232/287 variables, 55/73 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 126/199 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 219/418 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/418 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 4/291 variables, 3/421 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/421 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 1/292 variables, 1/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 422 constraints, problems are : Problem set: 14 solved, 219 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 219/233 constraints, Known Traps: 10/10 constraints]
After SMT, in 47936ms problems are : Problem set: 14 solved, 219 unsolved
Search for dead transitions found 14 dead transitions in 47940ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/58 places, 220/229 transitions.
Graph (complete) has 511 edges and 58 vertex of which 48 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 48 /58 variables (removed 10) and now considering 220/220 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/58 places, 220/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48024 ms. Remains : 48/58 places, 220/229 transitions.
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-06-01 03:47:10] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 03:47:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 03:47:10] [INFO ] Invariant cache hit.
[2024-06-01 03:47:11] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-06-01 03:47:11] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-01 03:47:11] [INFO ] Invariant cache hit.
[2024-06-01 03:47:11] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 03:47:15] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 2 ms to minimize.
[2024-06-01 03:47:16] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 03:47:16] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-06-01 03:47:18] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 17692 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 48562ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 48565ms
Finished structural reductions in LTL mode , in 1 iterations and 48810 ms. Remains : 58/58 places, 229/229 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-12 finished in 198321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(G(p1))))&&G(F(p0))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 61 transition count 237
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 54 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 54 transition count 236
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 53 transition count 236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 49 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 49 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 28 place count 47 transition count 206
Applied a total of 28 rules in 28 ms. Remains 47 /61 variables (removed 14) and now considering 206/244 (removed 38) transitions.
[2024-06-01 03:47:59] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
// Phase 1: matrix 205 rows 47 cols
[2024-06-01 03:47:59] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 03:47:59] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 03:47:59] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-06-01 03:47:59] [INFO ] Invariant cache hit.
[2024-06-01 03:47:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-06-01 03:48:00] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-06-01 03:48:00] [INFO ] Redundant transitions in 2 ms returned []
Running 205 sub problems to find dead transitions.
[2024-06-01 03:48:00] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-06-01 03:48:00] [INFO ] Invariant cache hit.
[2024-06-01 03:48:00] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-01 03:48:01] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-06-01 03:48:02] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 204/251 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 110/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 169 constraints, problems are : Problem set: 0 solved, 205 unsolved in 10358 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 204/251 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 110/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 205/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 374 constraints, problems are : Problem set: 0 solved, 205 unsolved in 20907 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 2/2 constraints]
After SMT, in 31889ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 31892ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32214 ms. Remains : 47/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 32431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-06a-LTLFireability-00
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 61 transition count 237
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 54 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 53 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 53 transition count 235
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 52 transition count 235
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 47 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 47 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 45 transition count 204
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 3 with 2 rules applied. Total rules applied 34 place count 44 transition count 204
Applied a total of 34 rules in 47 ms. Remains 44 /61 variables (removed 17) and now considering 204/244 (removed 40) transitions.
// Phase 1: matrix 204 rows 44 cols
[2024-06-01 03:48:32] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:48:32] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-06-01 03:48:32] [INFO ] Invariant cache hit.
[2024-06-01 03:48:32] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-01 03:48:33] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-01 03:48:33] [INFO ] Invariant cache hit.
[2024-06-01 03:48:33] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-01 03:48:38] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13163 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 25012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 39097ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 39103ms
Starting structural reductions in LI_LTL mode, iteration 1 : 44/61 places, 204/244 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 39675 ms. Remains : 44/61 places, 204/244 transitions.
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 47 reset in 126 ms.
Product exploration explored 100000 steps with 59 reset in 141 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2866 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34112 steps (200 resets) in 37 ms. (897 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 03:49:13] [INFO ] Invariant cache hit.
[2024-06-01 03:49:13] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 03:49:13] [INFO ] Invariant cache hit.
[2024-06-01 03:49:13] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-01 03:49:13] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-01 03:49:13] [INFO ] Invariant cache hit.
[2024-06-01 03:49:13] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-01 03:49:18] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 12572 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 25292 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 38662ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 38665ms
Finished structural reductions in LTL mode , in 1 iterations and 38910 ms. Remains : 44/44 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 20340 steps (1539 resets) in 102 ms. (197 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 114 ms.
Product exploration explored 100000 steps with 41 reset in 128 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Applied a total of 0 rules in 13 ms. Remains 44 /44 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 03:49:54] [INFO ] Redundant transitions in 22 ms returned []
Running 203 sub problems to find dead transitions.
[2024-06-01 03:49:54] [INFO ] Invariant cache hit.
[2024-06-01 03:49:54] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-01 03:49:58] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 11871 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 24731 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 37531ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 37536ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37593 ms. Remains : 44/44 places, 204/204 transitions.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-06-01 03:50:31] [INFO ] Invariant cache hit.
[2024-06-01 03:50:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 03:50:31] [INFO ] Invariant cache hit.
[2024-06-01 03:50:31] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-01 03:50:31] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-01 03:50:31] [INFO ] Invariant cache hit.
[2024-06-01 03:50:31] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-01 03:50:36] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13771 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 25295 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 39672ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 39674ms
Finished structural reductions in LTL mode , in 1 iterations and 39904 ms. Remains : 44/44 places, 204/204 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 159367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0&&(p1 U p2)))&&G(p0))))'
Found a Shortening insensitive property : AutonomousCar-PT-06a-LTLFireability-06
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 238
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 55 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 53 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 53 transition count 235
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 18 place count 52 transition count 235
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 48 transition count 213
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 48 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 46 transition count 211
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 3 with 2 rules applied. Total rules applied 32 place count 45 transition count 211
Applied a total of 32 rules in 22 ms. Remains 45 /61 variables (removed 16) and now considering 211/244 (removed 33) transitions.
// Phase 1: matrix 211 rows 45 cols
[2024-06-01 03:51:11] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 03:51:12] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 03:51:12] [INFO ] Invariant cache hit.
[2024-06-01 03:51:12] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-01 03:51:12] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 03:51:12] [INFO ] Invariant cache hit.
[2024-06-01 03:51:12] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 03:51:17] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 15116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 383 constraints, problems are : Problem set: 0 solved, 210 unsolved in 27721 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
After SMT, in 43711ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 43715ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/61 places, 211/244 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 44133 ms. Remains : 45/61 places, 211/244 transitions.
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06
Product exploration explored 100000 steps with 9 reset in 113 ms.
Product exploration explored 100000 steps with 28 reset in 133 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 238 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (2962 resets) in 319 ms. (125 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (233 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (220 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (227 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
[2024-06-01 03:51:56] [INFO ] Invariant cache hit.
[2024-06-01 03:51:56] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/256 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/256 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 211/211 transitions.
Graph (complete) has 470 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 44 transition count 208
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 44 transition count 204
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 35 place count 40 transition count 180
Applied a total of 35 rules in 36 ms. Remains 40 /45 variables (removed 5) and now considering 180/211 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 40/45 places, 180/211 transitions.
RANDOM walk for 39689 steps (998 resets) in 661 ms. (59 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 725 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-06-01 03:51:59] [INFO ] Invariant cache hit.
[2024-06-01 03:51:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 03:52:00] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-01 03:52:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 03:52:00] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-01 03:52:00] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-01 03:52:00] [INFO ] [Nat]Added 119 Read/Feed constraints in 23 ms returned sat
[2024-06-01 03:52:00] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 206 transitions) in 54 ms.
[2024-06-01 03:52:00] [INFO ] Added : 0 causal constraints over 0 iterations in 85 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 211/211 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-06-01 03:52:00] [INFO ] Invariant cache hit.
[2024-06-01 03:52:00] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 03:52:00] [INFO ] Invariant cache hit.
[2024-06-01 03:52:00] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-01 03:52:00] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 03:52:00] [INFO ] Invariant cache hit.
[2024-06-01 03:52:00] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 03:52:06] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 14253 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 383 constraints, problems are : Problem set: 0 solved, 210 unsolved in 26149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
After SMT, in 41489ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 41494ms
Finished structural reductions in LTL mode , in 1 iterations and 41849 ms. Remains : 45/45 places, 211/211 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 181 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (2946 resets) in 2059 ms. (19 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (226 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (233 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (230 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
[2024-06-01 03:52:43] [INFO ] Invariant cache hit.
[2024-06-01 03:52:43] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/256 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/256 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1103ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 437 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 211/211 transitions.
Graph (complete) has 470 edges and 45 vertex of which 44 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 (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 44 transition count 208
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 44 transition count 204
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 35 place count 40 transition count 180
Applied a total of 35 rules in 24 ms. Remains 40 /45 variables (removed 5) and now considering 180/211 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 40/45 places, 180/211 transitions.
RANDOM walk for 40000 steps (1136 resets) in 914 ms. (43 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (267 resets) in 348 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (266 resets) in 317 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (263 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 51155 steps, run visited all 3 properties in 394 ms. (steps per millisecond=129 )
Probabilistic random walk after 51155 steps, saw 9280 distinct states, run finished after 394 ms. (steps per millisecond=129 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 697 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-06-01 03:52:47] [INFO ] Invariant cache hit.
[2024-06-01 03:52:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-01 03:52:47] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-01 03:52:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 03:52:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-01 03:52:47] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-01 03:52:47] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-01 03:52:47] [INFO ] [Nat]Added 119 Read/Feed constraints in 23 ms returned sat
[2024-06-01 03:52:48] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 206 transitions) in 45 ms.
[2024-06-01 03:52:48] [INFO ] Added : 0 causal constraints over 0 iterations in 79 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 185 reset in 128 ms.
Product exploration explored 100000 steps with 8 reset in 131 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 211/211 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-06-01 03:52:48] [INFO ] Invariant cache hit.
[2024-06-01 03:52:48] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 03:52:48] [INFO ] Invariant cache hit.
[2024-06-01 03:52:49] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-01 03:52:49] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 03:52:49] [INFO ] Invariant cache hit.
[2024-06-01 03:52:49] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 03:52:54] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 14872 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 383 constraints, problems are : Problem set: 0 solved, 210 unsolved in 26779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
After SMT, in 42363ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42366ms
Finished structural reductions in LTL mode , in 1 iterations and 42731 ms. Remains : 45/45 places, 211/211 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 139932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X((F(p1)||G((!p0||X(!p2))))))))'
[2024-06-01 03:53:31] [INFO ] Flatten gal took : 43 ms
[2024-06-01 03:53:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 03:53:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 244 transitions and 2067 arcs took 9 ms.
Total runtime 966411 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-06a-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717214262242

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-06a-LTLFireability-00
ltl formula formula --ltl=/tmp/2588/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 61 places, 244 transitions and 2067 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2588/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2588/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2588/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2588/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 63 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 62, there are 257 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~60!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 615
pnml2lts-mc( 0/ 4): unique states count: 733
pnml2lts-mc( 0/ 4): unique transitions count: 6598
pnml2lts-mc( 0/ 4): - self-loop count: 60
pnml2lts-mc( 0/ 4): - claim dead count: 4434
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 743
pnml2lts-mc( 0/ 4): - cum. max stack depth: 140
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 743 states 6702 transitions, fanout: 9.020
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37150, Transitions per second: 335100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 11.7 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-06a-LTLFireability-06
ltl formula formula --ltl=/tmp/2588/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 61 places, 244 transitions and 2067 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2588/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2588/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2588/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2588/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 62 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 62, there are 964 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~14!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 37
pnml2lts-mc( 0/ 4): unique transitions count: 2714
pnml2lts-mc( 0/ 4): - self-loop count: 9
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 46
pnml2lts-mc( 0/ 4): - cum. max stack depth: 46
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 46 states 3120 transitions, fanout: 67.826
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4600, Transitions per second: 312000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.1 B/state, compr.: 5.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-06a-LTLFireability-12
ltl formula formula --ltl=/tmp/2588/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 61 places, 244 transitions and 2067 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2588/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2588/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2588/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2588/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 63 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 62, there are 893 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~146 levels ~10000 states ~576480 transitions
pnml2lts-mc( 0/ 4): ~146 levels ~20000 states ~1161468 transitions
pnml2lts-mc( 3/ 4): ~268 levels ~40000 states ~2149536 transitions
pnml2lts-mc( 3/ 4): ~345 levels ~80000 states ~4553336 transitions
pnml2lts-mc( 3/ 4): ~345 levels ~160000 states ~9328856 transitions
pnml2lts-mc( 3/ 4): ~345 levels ~320000 states ~18642936 transitions
pnml2lts-mc( 3/ 4): ~345 levels ~640000 states ~41128664 transitions
pnml2lts-mc( 3/ 4): ~345 levels ~1280000 states ~89139640 transitions
pnml2lts-mc( 3/ 4): ~345 levels ~2560000 states ~190574676 transitions
pnml2lts-mc( 3/ 4): ~378 levels ~5120000 states ~393680236 transitions
pnml2lts-mc( 3/ 4): ~378 levels ~10240000 states ~834696220 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13940527
pnml2lts-mc( 0/ 4): unique states count: 14359148
pnml2lts-mc( 0/ 4): unique transitions count: 1339257730
pnml2lts-mc( 0/ 4): - self-loop count: 41492131
pnml2lts-mc( 0/ 4): - claim dead count: 1262012583
pnml2lts-mc( 0/ 4): - claim found count: 21642032
pnml2lts-mc( 0/ 4): - claim success count: 14365933
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1463
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14367188 states 1340310607 transitions, fanout: 93.290
pnml2lts-mc( 0/ 4): Total exploration time 249.420 sec (249.420 sec minimum, 249.420 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57602, Transitions per second: 5373710
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 109.7MB, 8.0 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 42.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 247 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 109.7MB (~256.0MB paged-in)

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-06a"
export BK_EXAMINATION="LTLFireability"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-06a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167400300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;