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.r025-smll-171620166200228.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 greatspnxred
Input is AutonomousCar-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166200228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 31K 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-01b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716342996211

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 01:56:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 01:56:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:56:38] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-22 01:56:38] [INFO ] Transformed 119 places.
[2024-05-22 01:56:38] [INFO ] Transformed 132 transitions.
[2024-05-22 01:56:38] [INFO ] Found NUPN structural information;
[2024-05-22 01:56:38] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-01b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 111 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 111 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 110 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 110 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 109 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 109 transition count 122
Applied a total of 20 rules in 71 ms. Remains 109 /119 variables (removed 10) and now considering 122/132 (removed 10) transitions.
// Phase 1: matrix 122 rows 109 cols
[2024-05-22 01:56:38] [INFO ] Computed 6 invariants in 19 ms
[2024-05-22 01:56:39] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-22 01:56:39] [INFO ] Invariant cache hit.
[2024-05-22 01:56:39] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-22 01:56:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 01:56:40] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 20 ms to minimize.
[2024-05-22 01:56:40] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 3 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-22 01:56:41] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:56:42] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 4 ms to minimize.
[2024-05-22 01:56:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 01:56:43] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:56:43] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-22 01:56:44] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 2 ms to minimize.
[2024-05-22 01:56:44] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 01:56:44] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:56:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 7 (OVERLAPS) 122/231 variables, 109/140 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 140 constraints, problems are : Problem set: 2 solved, 119 unsolved in 7984 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 2 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 2/109 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 25/31 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 122/231 variables, 109/140 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 119/259 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-22 01:56:49] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 1/260 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-22 01:56:50] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 1/261 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-22 01:56:52] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/231 variables, 1/262 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/231 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 262 constraints, problems are : Problem set: 2 solved, 119 unsolved in 8950 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 119/121 constraints, Known Traps: 28/28 constraints]
After SMT, in 17057ms problems are : Problem set: 2 solved, 119 unsolved
Search for dead transitions found 2 dead transitions in 17169ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/119 places, 120/132 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 120
Applied a total of 1 rules in 10 ms. Remains 108 /109 variables (removed 1) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 108 cols
[2024-05-22 01:56:56] [INFO ] Computed 6 invariants in 4 ms
[2024-05-22 01:56:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 01:56:56] [INFO ] Invariant cache hit.
[2024-05-22 01:56:56] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/119 places, 120/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18005 ms. Remains : 108/119 places, 120/132 transitions.
Support contains 36 out of 108 places after structural reductions.
[2024-05-22 01:56:56] [INFO ] Flatten gal took : 49 ms
[2024-05-22 01:56:56] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:56:57] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 35 out of 108 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (18 resets) in 2012 ms. (19 steps per ms) remains 4/32 properties
BEST_FIRST walk for 40000 steps (28 resets) in 357 ms. (111 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40000 steps (25 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (30 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
[2024-05-22 01:56:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 98/108 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 108/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/228 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 114 constraints, problems are : Problem set: 1 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 100/108 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/228 variables, 108/114 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 1/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/228 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 115 constraints, problems are : Problem set: 2 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 272ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 228 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 26 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-01b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 27 stabilizing places and 27 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' '!(G((G(F(p0)) U !p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 100 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 105 transition count 70
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 58 rules applied. Total rules applied 106 place count 58 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 113 place count 52 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 51 transition count 58
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 114 place count 51 transition count 52
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 126 place count 45 transition count 52
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 133 place count 38 transition count 45
Iterating global reduction 4 with 7 rules applied. Total rules applied 140 place count 38 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 144 place count 38 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 144 place count 38 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 37 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 36 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 36 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 36 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 151 place count 35 transition count 37
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 177 place count 22 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 178 place count 22 transition count 22
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 180 place count 20 transition count 19
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 20 transition count 19
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 8 with 4 rules applied. Total rules applied 186 place count 18 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 187 place count 17 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 188 place count 16 transition count 16
Applied a total of 188 rules in 73 ms. Remains 16 /108 variables (removed 92) and now considering 16/120 (removed 104) transitions.
// Phase 1: matrix 16 rows 16 cols
[2024-05-22 01:56:59] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 01:56:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 01:56:59] [INFO ] Invariant cache hit.
[2024-05-22 01:56:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:56:59] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [12, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 95 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/108 places, 16/120 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 12 transition count 14
Applied a total of 4 rules in 2 ms. Remains 12 /14 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-22 01:56:59] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 01:56:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 01:56:59] [INFO ] Invariant cache hit.
[2024-05-22 01:56:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:56:59] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/108 places, 14/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 12/108 places, 14/120 transitions.
Stuttering acceptance computed with spot in 444 ms :[p0, (NOT p0), p0, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 219 ms.
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-01 finished in 1010 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)&&G(F((!p0 U (p1||G(!p0)))))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 96 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 105 transition count 70
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 58 rules applied. Total rules applied 106 place count 58 transition count 59
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 112 place count 52 transition count 59
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 112 place count 52 transition count 52
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 126 place count 45 transition count 52
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 132 place count 39 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 39 transition count 46
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 164 place count 26 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 26 transition count 31
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 167 place count 24 transition count 27
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 24 transition count 27
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 4 with 4 rules applied. Total rules applied 173 place count 22 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 22 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 21 transition count 24
Applied a total of 175 rules in 17 ms. Remains 21 /108 variables (removed 87) and now considering 24/120 (removed 96) transitions.
// Phase 1: matrix 24 rows 21 cols
[2024-05-22 01:56:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 01:56:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 01:56:59] [INFO ] Invariant cache hit.
[2024-05-22 01:56:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:56:59] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [17, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 93 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/108 places, 24/120 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 22
Applied a total of 4 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-22 01:56:59] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 01:57:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 01:57:00] [INFO ] Invariant cache hit.
[2024-05-22 01:57:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:57:00] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/108 places, 22/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 17/108 places, 22/120 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-03
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-03 finished in 387 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(G(p0))&&G((G(p2)||p1))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 98 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 96 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 96 transition count 104
Applied a total of 28 rules in 23 ms. Remains 96 /108 variables (removed 12) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 96 cols
[2024-05-22 01:57:00] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 01:57:00] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 01:57:00] [INFO ] Invariant cache hit.
[2024-05-22 01:57:00] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-22 01:57:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 3 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 7 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:57:01] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-22 01:57:02] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:57:02] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:57:02] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
[2024-05-22 01:57:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 01:57:02] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-22 01:57:02] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:57:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 120 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4373 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 01:57:05] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 103/224 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 01:57:06] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 225 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4094 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 20/20 constraints]
After SMT, in 8489ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 8493ms
Starting structural reductions in LTL mode, iteration 1 : 96/108 places, 104/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8680 ms. Remains : 96/108 places, 104/120 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-04 finished in 8843 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(G(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 99 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 105 transition count 71
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 57 rules applied. Total rules applied 104 place count 59 transition count 60
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 110 place count 53 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 110 place count 53 transition count 54
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 122 place count 47 transition count 54
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 40 transition count 47
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 40 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 140 place count 40 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 140 place count 40 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 39 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 38 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 38 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 146 place count 38 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 37 transition count 39
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 175 place count 23 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 176 place count 23 transition count 24
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 178 place count 21 transition count 21
Iterating global reduction 7 with 2 rules applied. Total rules applied 180 place count 21 transition count 21
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 7 with 4 rules applied. Total rules applied 184 place count 19 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 17 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 187 place count 16 transition count 17
Applied a total of 187 rules in 23 ms. Remains 16 /108 variables (removed 92) and now considering 17/120 (removed 103) transitions.
// Phase 1: matrix 17 rows 16 cols
[2024-05-22 01:57:09] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 01:57:09] [INFO ] Invariant cache hit.
[2024-05-22 01:57:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [10, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 100 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/108 places, 17/120 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 12 transition count 15
Applied a total of 4 rules in 3 ms. Remains 12 /14 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-22 01:57:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 01:57:09] [INFO ] Invariant cache hit.
[2024-05-22 01:57:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/108 places, 15/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 12/108 places, 15/120 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 124 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-05 finished in 385 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(p0) U p1)||(F(p2)&&F(!p0))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 97 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 105 transition count 73
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 54 rules applied. Total rules applied 99 place count 61 transition count 63
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 106 place count 55 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 54 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 107 place count 54 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 117 place count 49 transition count 57
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 123 place count 43 transition count 51
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 43 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 133 place count 43 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 133 place count 43 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 42 transition count 46
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 41 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 41 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 139 place count 41 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 140 place count 40 transition count 43
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 168 place count 26 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 169 place count 26 transition count 27
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 171 place count 24 transition count 24
Iterating global reduction 8 with 2 rules applied. Total rules applied 173 place count 24 transition count 24
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 8 with 4 rules applied. Total rules applied 177 place count 22 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 179 place count 20 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 180 place count 19 transition count 20
Applied a total of 180 rules in 20 ms. Remains 19 /108 variables (removed 89) and now considering 20/120 (removed 100) transitions.
// Phase 1: matrix 20 rows 19 cols
[2024-05-22 01:57:09] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 01:57:09] [INFO ] Invariant cache hit.
[2024-05-22 01:57:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/108 places, 20/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 18/108 places, 20/120 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-07
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-07 finished in 334 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 G((!p1 U ((F(p2)&&p3) U p2)))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 90 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 105 transition count 75
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 53 rules applied. Total rules applied 96 place count 63 transition count 64
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 57 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 56 transition count 63
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 104 place count 56 transition count 56
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 118 place count 49 transition count 56
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 124 place count 43 transition count 50
Iterating global reduction 4 with 6 rules applied. Total rules applied 130 place count 43 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 134 place count 43 transition count 46
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 160 place count 30 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 161 place count 30 transition count 31
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 29 transition count 30
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 29 transition count 30
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 6 with 4 rules applied. Total rules applied 167 place count 27 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 168 place count 26 transition count 27
Applied a total of 168 rules in 19 ms. Remains 26 /108 variables (removed 82) and now considering 27/120 (removed 93) transitions.
// Phase 1: matrix 27 rows 26 cols
[2024-05-22 01:57:09] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 01:57:09] [INFO ] Invariant cache hit.
[2024-05-22 01:57:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [20, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 88 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/108 places, 27/120 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 25
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 22 cols
[2024-05-22 01:57:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 01:57:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 01:57:09] [INFO ] Invariant cache hit.
[2024-05-22 01:57:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:57:10] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/108 places, 25/120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 22/108 places, 25/120 transitions.
Stuttering acceptance computed with spot in 240 ms :[p2, p2, p2]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-08
Product exploration explored 100000 steps with 1 reset in 85 ms.
Stack based approach found an accepted trace after 96 steps with 10 reset with depth 13 and stack size 13 in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-08 finished in 556 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 (p1 U p2)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 97 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 106 transition count 74
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 55 rules applied. Total rules applied 100 place count 62 transition count 63
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 56 transition count 63
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 106 place count 56 transition count 57
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 50 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 125 place count 43 transition count 50
Iterating global reduction 3 with 7 rules applied. Total rules applied 132 place count 43 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 136 place count 43 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 136 place count 43 transition count 45
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 42 transition count 45
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 41 transition count 44
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 41 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 142 place count 41 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 40 transition count 42
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 175 place count 24 transition count 25
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 177 place count 22 transition count 22
Iterating global reduction 6 with 2 rules applied. Total rules applied 179 place count 22 transition count 22
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 6 with 2 rules applied. Total rules applied 181 place count 21 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 20 transition count 21
Applied a total of 183 rules in 19 ms. Remains 20 /108 variables (removed 88) and now considering 21/120 (removed 99) transitions.
// Phase 1: matrix 21 rows 20 cols
[2024-05-22 01:57:10] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 01:57:10] [INFO ] Implicit Places using invariants in 98 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/108 places, 21/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 19/108 places, 21/120 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 57 ms.
Product exploration explored 100000 steps with 1 reset in 282 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/19 stabilizing places and 1/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p0), (NOT p0)]
RANDOM walk for 87 steps (12 resets) in 7 ms. (10 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F p2), (F (NOT (OR p1 p2 p0)))]
Knowledge based reduction with 12 factoid took 433 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (NOT p0), (NOT p0)]
// Phase 1: matrix 21 rows 19 cols
[2024-05-22 01:57:12] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 01:57:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 01:57:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-22 01:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:57:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 01:57:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-22 01:57:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:57:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-22 01:57:12] [INFO ] Computed and/alt/rep : 18/89/18 causal constraints (skipped 2 transitions) in 4 ms.
[2024-05-22 01:57:12] [INFO ] Added : 4 causal constraints over 2 iterations in 36 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2024-05-22 01:57:12] [INFO ] Invariant cache hit.
[2024-05-22 01:57:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 01:57:12] [INFO ] Invariant cache hit.
[2024-05-22 01:57:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:57:12] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [15, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 103 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/19 places, 21/21 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 15 transition count 19
Applied a total of 4 rules in 4 ms. Remains 15 /17 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 15 cols
[2024-05-22 01:57:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 01:57:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 01:57:12] [INFO ] Invariant cache hit.
[2024-05-22 01:57:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:57:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/19 places, 19/21 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 15/19 places, 19/21 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/15 stabilizing places and 6/19 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 347 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p0), (NOT p0)]
RANDOM walk for 198 steps (30 resets) in 10 ms. (18 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F p2), (F (NOT (OR p1 p2 p0)))]
Knowledge based reduction with 13 factoid took 862 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p0), (NOT p0)]
[2024-05-22 01:57:13] [INFO ] Invariant cache hit.
[2024-05-22 01:57:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 01:57:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-22 01:57:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:57:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 01:57:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 01:57:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 01:57:14] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-22 01:57:14] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-22 01:57:14] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:57:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-05-22 01:57:14] [INFO ] Computed and/alt/rep : 10/45/10 causal constraints (skipped 8 transitions) in 2 ms.
[2024-05-22 01:57:14] [INFO ] Added : 4 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 49 ms.
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-09 finished in 3955 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((p0&&X(F((p1||X(p1))))))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 99 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 99 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 99 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 97 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 97 transition count 105
Applied a total of 26 rules in 5 ms. Remains 97 /108 variables (removed 11) and now considering 105/120 (removed 15) transitions.
// Phase 1: matrix 105 rows 97 cols
[2024-05-22 01:57:14] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 01:57:14] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 01:57:14] [INFO ] Invariant cache hit.
[2024-05-22 01:57:14] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-22 01:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 15 ms to minimize.
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 17 ms to minimize.
[2024-05-22 01:57:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:16] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 01:57:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 105/202 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 01:57:18] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:57:18] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 123 constraints, problems are : Problem set: 0 solved, 104 unsolved in 5610 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 01:57:20] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:57:20] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 2 ms to minimize.
[2024-05-22 01:57:20] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/202 variables, 97/126 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 104/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 01:57:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/202 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 231 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4879 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 24/24 constraints]
After SMT, in 10528ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 10530ms
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 105/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10711 ms. Remains : 97/108 places, 105/120 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-10
Stuttering criterion allowed to conclude after 102 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-10 finished in 10899 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(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 98 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 95 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 95 transition count 103
Applied a total of 30 rules in 6 ms. Remains 95 /108 variables (removed 13) and now considering 103/120 (removed 17) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-22 01:57:25] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 01:57:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 01:57:25] [INFO ] Invariant cache hit.
[2024-05-22 01:57:25] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-22 01:57:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:57:26] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:57:27] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:57:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:57:27] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:57:27] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:57:27] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-05-22 01:57:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/198 variables, 95/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 123 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 225 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2658 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 22/22 constraints]
After SMT, in 6963ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6966ms
Starting structural reductions in LTL mode, iteration 1 : 95/108 places, 103/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7116 ms. Remains : 95/108 places, 103/120 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-11 finished in 7202 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(p1)))&&X(p2)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 97 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 97 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 97 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 94 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 94 transition count 102
Applied a total of 32 rules in 6 ms. Remains 94 /108 variables (removed 14) and now considering 102/120 (removed 18) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-22 01:57:32] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 01:57:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 01:57:32] [INFO ] Invariant cache hit.
[2024-05-22 01:57:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 01:57:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-22 01:57:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:34] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:57:34] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 2 ms to minimize.
[2024-05-22 01:57:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:57:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:57:34] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:57:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:34] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4069 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:37] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:38] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3749 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 7835ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7838ms
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 102/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8024 ms. Remains : 94/108 places, 102/120 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-12 finished in 8219 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) U X((G(p1)||F(G(!p1))))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 97 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 97 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 97 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 94 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 94 transition count 102
Applied a total of 32 rules in 4 ms. Remains 94 /108 variables (removed 14) and now considering 102/120 (removed 18) transitions.
[2024-05-22 01:57:40] [INFO ] Invariant cache hit.
[2024-05-22 01:57:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 01:57:40] [INFO ] Invariant cache hit.
[2024-05-22 01:57:40] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 01:57:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 2 ms to minimize.
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:42] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4154 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:46] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3879 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 8052ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 8054ms
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 102/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8218 ms. Remains : 94/108 places, 102/120 transitions.
Stuttering acceptance computed with spot in 112 ms :[false, false, (AND (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-13
Product exploration explored 100000 steps with 5 reset in 84 ms.
Product exploration explored 100000 steps with 13 reset in 95 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/94 stabilizing places and 23/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[false, false, (AND (NOT p0) p1)]
RANDOM walk for 33433 steps (16 resets) in 41 ms. (796 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 316 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[false, false, (AND (NOT p0) p1)]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-22 01:57:50] [INFO ] Invariant cache hit.
[2024-05-22 01:57:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 01:57:50] [INFO ] Invariant cache hit.
[2024-05-22 01:57:50] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 01:57:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:50] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-22 01:57:50] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-22 01:57:50] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 2 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:57:51] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:52] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4157 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:54] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:57:55] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3736 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 7910ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7913ms
Finished structural reductions in LTL mode , in 1 iterations and 8070 ms. Remains : 94/94 places, 102/102 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/94 stabilizing places and 23/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[false, false, (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (10 resets) in 65 ms. (606 steps per ms) remains 1/4 properties
BEST_FIRST walk for 15502 steps (13 resets) in 45 ms. (337 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 107 ms :[false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[false, false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 21 reset in 89 ms.
Product exploration explored 100000 steps with 6 reset in 93 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[false, false, (AND (NOT p0) p1)]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Graph (trivial) has 82 edges and 94 vertex of which 4 / 94 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 92 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 92 transition count 95
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 40 place count 92 transition count 96
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 49 place count 92 transition count 96
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 74 place count 67 transition count 71
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 99 place count 67 transition count 71
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 120 place count 67 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 67 transition count 71
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 139 place count 50 transition count 53
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 156 place count 50 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 49 transition count 52
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 49 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 49 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 47 transition count 50
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 47 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 47 transition count 62
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 166 rules in 26 ms. Remains 47 /94 variables (removed 47) and now considering 62/102 (removed 40) transitions.
[2024-05-22 01:57:59] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
// Phase 1: matrix 62 rows 47 cols
[2024-05-22 01:57:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 01:57:59] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:58:00] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 10/15 constraints. Problems are: Problem set: 25 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 25 solved, 36 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 61/108 variables, 47/62 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 11/73 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/73 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/109 variables, 1/74 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/74 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/74 constraints. Problems are: Problem set: 42 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 74 constraints, problems are : Problem set: 42 solved, 19 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 42 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 28/47 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 10/15 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 61/108 variables, 47/62 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 11/73 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 19/92 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/92 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/109 variables, 1/93 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/93 constraints. Problems are: Problem set: 42 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/93 constraints. Problems are: Problem set: 42 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 93 constraints, problems are : Problem set: 42 solved, 19 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 19/61 constraints, Known Traps: 10/10 constraints]
After SMT, in 1917ms problems are : Problem set: 42 solved, 19 unsolved
Search for dead transitions found 42 dead transitions in 1918ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 47/94 places, 20/102 transitions.
Graph (complete) has 76 edges and 47 vertex of which 20 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 20 /47 variables (removed 27) and now considering 20/20 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/94 places, 20/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1957 ms. Remains : 20/94 places, 20/102 transitions.
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-22 01:58:01] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 01:58:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 01:58:01] [INFO ] Invariant cache hit.
[2024-05-22 01:58:01] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 01:58:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:58:02] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:58:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:58:04] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4280 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:58:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 01:58:07] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3803 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 8098ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 8100ms
Finished structural reductions in LTL mode , in 1 iterations and 8281 ms. Remains : 94/94 places, 102/102 transitions.
Treatment of property AutonomousCar-PT-01b-LTLFireability-13 finished in 29323 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(F((p0&&F(G(p1)))))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 98 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 95 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 95 transition count 103
Applied a total of 30 rules in 4 ms. Remains 95 /108 variables (removed 13) and now considering 103/120 (removed 17) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-22 01:58:10] [INFO ] Computed 6 invariants in 4 ms
[2024-05-22 01:58:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 01:58:10] [INFO ] Invariant cache hit.
[2024-05-22 01:58:10] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-22 01:58:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:58:10] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 2 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 2 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:58:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/198 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 117 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/117 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/219 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 219 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 16/16 constraints]
After SMT, in 6256ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6257ms
Starting structural reductions in LTL mode, iteration 1 : 95/108 places, 103/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6446 ms. Remains : 95/108 places, 103/120 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 1 reset in 81 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
RANDOM walk for 40000 steps (11 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31524 steps (12 resets) in 33 ms. (927 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 1 out of 95 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Graph (trivial) has 84 edges and 95 vertex of which 4 / 95 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 92 transition count 67
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 44 rules applied. Total rules applied 78 place count 59 transition count 56
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 85 place count 53 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 52 transition count 55
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 86 place count 52 transition count 48
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 100 place count 45 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 44 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 44 transition count 47
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 138 place count 26 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 26 transition count 28
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 142 place count 23 transition count 24
Iterating global reduction 5 with 3 rules applied. Total rules applied 145 place count 23 transition count 24
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 5 with 4 rules applied. Total rules applied 149 place count 21 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 152 place count 18 transition count 20
Applied a total of 152 rules in 15 ms. Remains 18 /95 variables (removed 77) and now considering 20/103 (removed 83) transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-05-22 01:58:17] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 01:58:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 01:58:17] [INFO ] Invariant cache hit.
[2024-05-22 01:58:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [12, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 89 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/95 places, 20/103 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 18
Applied a total of 4 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-22 01:58:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 01:58:17] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 01:58:17] [INFO ] Invariant cache hit.
[2024-05-22 01:58:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:58:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/95 places, 18/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 189 ms. Remains : 14/95 places, 18/103 transitions.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
RANDOM walk for 162 steps (23 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 51 ms.
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 17
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 4 place count 12 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 15
Applied a total of 5 rules in 3 ms. Remains 12 /14 variables (removed 2) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-22 01:58:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 01:58:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 01:58:17] [INFO ] Invariant cache hit.
[2024-05-22 01:58:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:58:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-22 01:58:17] [INFO ] Redundant transitions in 14 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-22 01:58:17] [INFO ] Invariant cache hit.
[2024-05-22 01:58:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 14/26 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 15 constraints, problems are : Problem set: 0 solved, 12 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 14/26 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 27 constraints, problems are : Problem set: 0 solved, 12 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/14 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 12/14 places, 15/18 transitions.
Treatment of property AutonomousCar-PT-01b-LTLFireability-14 finished in 8465 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(p0)||G(p1))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 98 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 95 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 95 transition count 103
Applied a total of 30 rules in 4 ms. Remains 95 /108 variables (removed 13) and now considering 103/120 (removed 17) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-22 01:58:18] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 01:58:18] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 01:58:18] [INFO ] Invariant cache hit.
[2024-05-22 01:58:18] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-22 01:58:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 01:58:19] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:58:20] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:58:21] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:58:21] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:58:21] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/198 variables, 95/125 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4606 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:58:24] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:58:24] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-22 01:58:24] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:58:24] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/198 variables, 95/129 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 102/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 231 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4375 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 28/28 constraints]
After SMT, in 8995ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 8996ms
Starting structural reductions in LTL mode, iteration 1 : 95/108 places, 103/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9292 ms. Remains : 95/108 places, 103/120 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLFireability-15 finished in 9471 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) U X((G(p1)||F(G(!p1))))))'
Found a Lengthening insensitive property : AutonomousCar-PT-01b-LTLFireability-13
Stuttering acceptance computed with spot in 106 ms :[false, false, (AND (NOT p0) p1)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 96 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 105 transition count 73
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 97 place count 61 transition count 65
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 57 transition count 63
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 107 place count 55 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 54 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 108 place count 54 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 118 place count 49 transition count 56
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 125 place count 42 transition count 49
Iterating global reduction 5 with 7 rules applied. Total rules applied 132 place count 42 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 136 place count 42 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 136 place count 42 transition count 44
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 138 place count 41 transition count 44
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 139 place count 40 transition count 43
Iterating global reduction 6 with 1 rules applied. Total rules applied 140 place count 40 transition count 43
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 170 place count 25 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 171 place count 25 transition count 26
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 173 place count 23 transition count 23
Iterating global reduction 7 with 2 rules applied. Total rules applied 175 place count 23 transition count 23
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 7 with 4 rules applied. Total rules applied 179 place count 21 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 181 place count 19 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 182 place count 18 transition count 19
Applied a total of 182 rules in 30 ms. Remains 18 /108 variables (removed 90) and now considering 19/120 (removed 101) transitions.
// Phase 1: matrix 19 rows 18 cols
[2024-05-22 01:58:28] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 01:58:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 01:58:28] [INFO ] Invariant cache hit.
[2024-05-22 01:58:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 94 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/108 places, 19/120 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 17
Applied a total of 4 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 17/19 (removed 2) transitions.
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 01:58:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 01:58:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 01:58:28] [INFO ] Invariant cache hit.
[2024-05-22 01:58:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/108 places, 17/120 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 214 ms. Remains : 14/108 places, 17/120 transitions.
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-13
Product exploration explored 100000 steps with 28 reset in 50 ms.
Product exploration explored 100000 steps with 2 reset in 64 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/14 stabilizing places and 5/17 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 368 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[false, false, (AND (NOT p0) p1)]
RANDOM walk for 118 steps (14 resets) in 4 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 502 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[false, false, (AND (NOT p0) p1)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-05-22 01:58:29] [INFO ] Invariant cache hit.
[2024-05-22 01:58:29] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 01:58:29] [INFO ] Invariant cache hit.
[2024-05-22 01:58:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2024-05-22 01:58:29] [INFO ] Invariant cache hit.
[2024-05-22 01:58:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 16/29 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 01:58:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/31 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 19 constraints, problems are : Problem set: 0 solved, 12 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 16/29 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/31 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 31 constraints, problems are : Problem set: 0 solved, 12 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 531ms
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 14/14 places, 17/17 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/14 stabilizing places and 5/17 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[false, false, (AND (NOT p0) p1)]
RANDOM walk for 81 steps (12 resets) in 4 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 483 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 107 ms :[false, false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 7 reset in 53 ms.
Product exploration explored 100000 steps with 5 reset in 59 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[false, false, (AND (NOT p0) p1)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-05-22 01:58:31] [INFO ] Redundant transitions in 14 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-22 01:58:31] [INFO ] Invariant cache hit.
[2024-05-22 01:58:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 16/29 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 01:58:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/31 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 19 constraints, problems are : Problem set: 0 solved, 12 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 16/29 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/31 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 31 constraints, problems are : Problem set: 0 solved, 12 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 593ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 593ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 614 ms. Remains : 14/14 places, 17/17 transitions.
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-05-22 01:58:32] [INFO ] Invariant cache hit.
[2024-05-22 01:58:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 01:58:32] [INFO ] Invariant cache hit.
[2024-05-22 01:58:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:32] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2024-05-22 01:58:32] [INFO ] Invariant cache hit.
[2024-05-22 01:58:32] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 16/29 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 01:58:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/31 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/31 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 19 constraints, problems are : Problem set: 0 solved, 12 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 16/29 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/31 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 31 constraints, problems are : Problem set: 0 solved, 12 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 596ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 597ms
Finished structural reductions in LTL mode , in 1 iterations and 664 ms. Remains : 14/14 places, 17/17 transitions.
Treatment of property AutonomousCar-PT-01b-LTLFireability-13 finished in 5340 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(F((p0&&F(G(p1)))))))'
Found a Shortening insensitive property : AutonomousCar-PT-01b-LTLFireability-14
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 120/120 transitions.
Graph (trivial) has 96 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 105 transition count 74
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 52 rules applied. Total rules applied 96 place count 62 transition count 65
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 57 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 56 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 103 place count 56 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 115 place count 50 transition count 58
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 123 place count 42 transition count 50
Iterating global reduction 4 with 8 rules applied. Total rules applied 131 place count 42 transition count 50
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 136 place count 42 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 136 place count 42 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 41 transition count 44
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 40 transition count 43
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 40 transition count 43
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 170 place count 25 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 25 transition count 27
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 173 place count 23 transition count 24
Iterating global reduction 6 with 2 rules applied. Total rules applied 175 place count 23 transition count 24
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 6 with 4 rules applied. Total rules applied 179 place count 21 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 182 place count 18 transition count 20
Applied a total of 182 rules in 15 ms. Remains 18 /108 variables (removed 90) and now considering 20/120 (removed 100) transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-05-22 01:58:33] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 01:58:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 01:58:33] [INFO ] Invariant cache hit.
[2024-05-22 01:58:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:58:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [12, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 83 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/108 places, 20/120 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 18
Applied a total of 4 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-22 01:58:33] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 01:58:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 01:58:33] [INFO ] Invariant cache hit.
[2024-05-22 01:58:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:58:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/108 places, 18/120 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 165 ms. Remains : 14/108 places, 18/120 transitions.
Running random walk in product with property : AutonomousCar-PT-01b-LTLFireability-14
Product exploration explored 100000 steps with 3 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 50 ms.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 205 steps (31 resets) in 4 ms. (41 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-22 01:58:34] [INFO ] Invariant cache hit.
[2024-05-22 01:58:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 01:58:34] [INFO ] Invariant cache hit.
[2024-05-22 01:58:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:58:34] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 14 sub problems to find dead transitions.
[2024-05-22 01:58:34] [INFO ] Invariant cache hit.
[2024-05-22 01:58:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 17/31 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 01:58:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/32 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 18 constraints, problems are : Problem set: 0 solved, 14 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 17/31 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 505ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 505ms
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 14/14 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 2 stable transitions
Computed a total of 0 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 324 steps (56 resets) in 6 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 5 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 48 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-22 01:58:36] [INFO ] Redundant transitions in 13 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-22 01:58:36] [INFO ] Invariant cache hit.
[2024-05-22 01:58:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 17/31 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 01:58:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/32 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 18 constraints, problems are : Problem set: 0 solved, 14 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 17/31 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 14/14 places, 18/18 transitions.
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-22 01:58:37] [INFO ] Invariant cache hit.
[2024-05-22 01:58:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 01:58:37] [INFO ] Invariant cache hit.
[2024-05-22 01:58:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:58:37] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 14 sub problems to find dead transitions.
[2024-05-22 01:58:37] [INFO ] Invariant cache hit.
[2024-05-22 01:58:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 17/31 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 01:58:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/32 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 18 constraints, problems are : Problem set: 0 solved, 14 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 17/31 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/32 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 508ms
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 14/14 places, 18/18 transitions.
Treatment of property AutonomousCar-PT-01b-LTLFireability-14 finished in 4738 ms.
[2024-05-22 01:58:37] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:58:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 01:58:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 120 transitions and 313 arcs took 4 ms.
Total runtime 120032 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-01b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 108
TRANSITIONS: 120
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2710
MODEL NAME: /home/mcc/execution/413/model
108 places, 120 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-01b-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-01b-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716343122935

--------------------
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

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-01b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AutonomousCar-PT-01b, 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 r025-smll-171620166200228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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