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.r026-smll-171620167300252.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 itstools
Input is AutonomousCar-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167300252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 17:56 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 42K 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-03a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716320959001

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 19:49:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:49:21] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-21 19:49:21] [INFO ] Transformed 41 places.
[2024-05-21 19:49:21] [INFO ] Transformed 121 transitions.
[2024-05-21 19:49:21] [INFO ] Found NUPN structural information;
[2024-05-21 19:49:21] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Applied a total of 0 rules in 20 ms. Remains 41 /41 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-21 19:49:22] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 41 cols
[2024-05-21 19:49:22] [INFO ] Computed 8 invariants in 11 ms
[2024-05-21 19:49:22] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-21 19:49:22] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-21 19:49:22] [INFO ] Invariant cache hit.
[2024-05-21 19:49:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 19:49:22] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [36, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 594 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 39/41 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 39/41 places, 76/76 transitions.
Support contains 27 out of 39 places after structural reductions.
[2024-05-21 19:49:23] [INFO ] Flatten gal took : 70 ms
[2024-05-21 19:49:23] [INFO ] Flatten gal took : 24 ms
[2024-05-21 19:49:23] [INFO ] Input system was already deterministic with 76 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 13413 steps (782 resets) in 891 ms. (15 steps per ms) remains 0/23 properties
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(!(p0 U p1))||G(X(!p1)))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 12 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-21 19:49:24] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:49:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 19:49:24] [INFO ] Invariant cache hit.
[2024-05-21 19:49:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:49:24] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 19:49:24] [INFO ] Invariant cache hit.
[2024-05-21 19:49:24] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-21 19:49:25] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 27 ms to minimize.
[2024-05-21 19:49:25] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
[2024-05-21 19:49:26] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
After SMT, in 6013ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 6037ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6268 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 422 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-00 finished in 6781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(p1)))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 4 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-21 19:49:30] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 19:49:31] [INFO ] Invariant cache hit.
[2024-05-21 19:49:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:49:31] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 19:49:31] [INFO ] Invariant cache hit.
[2024-05-21 19:49:31] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-21 19:49:32] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:49:32] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:49:32] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:49:32] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2761 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2993 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
After SMT, in 5871ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5875ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6082 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-03 finished in 6311 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)||(p1 U p2))))'
Support contains 5 out of 39 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 : 39/39 places, 76/76 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 0 with 5 rules applied. Total rules applied 5 place count 39 transition count 71
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 34 transition count 70
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 12 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 31 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 31 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 29 transition count 60
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 2 with 2 rules applied. Total rules applied 22 place count 28 transition count 60
Applied a total of 22 rules in 53 ms. Remains 28 /39 variables (removed 11) and now considering 60/76 (removed 16) transitions.
[2024-05-21 19:49:37] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 28 cols
[2024-05-21 19:49:37] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:49:37] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 19:49:37] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-21 19:49:37] [INFO ] Invariant cache hit.
[2024-05-21 19:49:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:49:37] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-21 19:49:37] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 19:49:37] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-21 19:49:37] [INFO ] Invariant cache hit.
[2024-05-21 19:49:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 19:49:38] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:49:38] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 71 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2147 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 130 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
After SMT, in 4844ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4849ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/39 places, 60/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5083 ms. Remains : 28/39 places, 60/76 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 344 ms.
Product exploration explored 100000 steps with 4 reset in 275 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/28 stabilizing places and 6/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 241 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 1060 steps (84 resets) in 41 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 498 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2))]
Support contains 5 out of 28 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 : 28/28 places, 60/60 transitions.
Applied a total of 0 rules in 8 ms. Remains 28 /28 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-21 19:49:44] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-21 19:49:44] [INFO ] Invariant cache hit.
[2024-05-21 19:49:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 19:49:44] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-21 19:49:44] [INFO ] Invariant cache hit.
[2024-05-21 19:49:44] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:49:44] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 19:49:44] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 19:49:44] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2024-05-21 19:49:44] [INFO ] Invariant cache hit.
[2024-05-21 19:49:44] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 19:49:44] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:49:44] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 71 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/86 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 130 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2467 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
After SMT, in 4669ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4672ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4849 ms. Remains : 28/28 places, 60/60 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/28 stabilizing places and 6/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 457 steps (35 resets) in 9 ms. (45 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 10 factoid took 333 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 31 reset in 211 ms.
Product exploration explored 100000 steps with 1 reset in 166 ms.
Built C files in :
/tmp/ltsmin11473659129459860375
[2024-05-21 19:49:50] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-21 19:49:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:50] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-21 19:49:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:50] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-21 19:49:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:49:50] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11473659129459860375
Running compilation step : cd /tmp/ltsmin11473659129459860375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 566 ms.
Running link step : cd /tmp/ltsmin11473659129459860375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11473659129459860375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased630135668564704265.hoa' '--buchi-type=spotba'
LTSmin run took 235 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-04 finished in 13726 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))) U (p2||X(F(p3))||G(!p0))))'
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 2 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-21 19:49:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:49:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:49:51] [INFO ] Invariant cache hit.
[2024-05-21 19:49:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:49:51] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 19:49:51] [INFO ] Invariant cache hit.
[2024-05-21 19:49:51] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-21 19:49:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:49:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 19:49:51] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:49:52] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3219 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
After SMT, in 5289ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5291ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5398 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p3) (NOT p1)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 414 ms.
Product exploration explored 100000 steps with 33333 reset in 418 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/36 stabilizing places and 2/67 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 225 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-05 finished in 6769 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 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 35 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 35 transition count 63
Applied a total of 8 rules in 2 ms. Remains 35 /39 variables (removed 4) and now considering 63/76 (removed 13) transitions.
// Phase 1: matrix 63 rows 35 cols
[2024-05-21 19:49:57] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:49:57] [INFO ] Implicit Places using invariants in 79 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/39 places, 63/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 34/39 places, 63/76 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-06
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-06 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p1||X(X(F(p1)))))||p0)))'
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 3 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-21 19:49:58] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:49:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 19:49:58] [INFO ] Invariant cache hit.
[2024-05-21 19:49:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:49:58] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 19:49:58] [INFO ] Invariant cache hit.
[2024-05-21 19:49:58] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-21 19:49:59] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:49:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:49:59] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 143 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2795 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
After SMT, in 5720ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5722ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5898 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-07
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-07 finished in 6104 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(p1)))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 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 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 35 transition count 71
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 34 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 31 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 31 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 29 transition count 60
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 2 with 2 rules applied. Total rules applied 22 place count 28 transition count 60
Applied a total of 22 rules in 19 ms. Remains 28 /39 variables (removed 11) and now considering 60/76 (removed 16) transitions.
// Phase 1: matrix 60 rows 28 cols
[2024-05-21 19:50:04] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:50:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 19:50:04] [INFO ] Invariant cache hit.
[2024-05-21 19:50:04] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:50:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-21 19:50:04] [INFO ] Redundant transitions in 17 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 19:50:04] [INFO ] Invariant cache hit.
[2024-05-21 19:50:04] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 19:50:05] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/88 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 69 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2388 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 59/87 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2839 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 5292ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 5293ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/39 places, 60/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5489 ms. Remains : 28/39 places, 60/76 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-08
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-08 finished in 5603 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((G(F(p0)) U p1))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 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 0 with 5 rules applied. Total rules applied 5 place count 39 transition count 71
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 34 transition count 70
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 12 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 31 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 31 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 30 transition count 64
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 2 with 2 rules applied. Total rules applied 20 place count 29 transition count 64
Applied a total of 20 rules in 22 ms. Remains 29 /39 variables (removed 10) and now considering 64/76 (removed 12) transitions.
// Phase 1: matrix 64 rows 29 cols
[2024-05-21 19:50:09] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:50:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 19:50:09] [INFO ] Invariant cache hit.
[2024-05-21 19:50:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 19:50:09] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-21 19:50:09] [INFO ] Redundant transitions in 17 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-21 19:50:09] [INFO ] Invariant cache hit.
[2024-05-21 19:50:09] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 72 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 135 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3197 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 5255ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 5256ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/39 places, 64/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5452 ms. Remains : 29/39 places, 64/76 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-09 finished in 5683 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)))'
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 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 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 35 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 34 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 31 transition count 65
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 31 transition count 65
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 3 with 2 rules applied. Total rules applied 18 place count 30 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 29 transition count 64
Applied a total of 20 rules in 26 ms. Remains 29 /39 variables (removed 10) and now considering 64/76 (removed 12) transitions.
// Phase 1: matrix 64 rows 29 cols
[2024-05-21 19:50:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:50:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 19:50:15] [INFO ] Invariant cache hit.
[2024-05-21 19:50:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 19:50:15] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-21 19:50:15] [INFO ] Redundant transitions in 20 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-21 19:50:15] [INFO ] Invariant cache hit.
[2024-05-21 19:50:15] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/93 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 72 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 63/92 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 37/71 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 135 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 5180ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 5182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/39 places, 64/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5389 ms. Remains : 29/39 places, 64/76 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-10
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-10 finished in 5510 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(G(!p0)) U (p0 U p1))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 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 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 35 transition count 71
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 10 place count 34 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 31 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 31 transition count 62
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 18 place count 30 transition count 61
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 2 with 2 rules applied. Total rules applied 20 place count 29 transition count 61
Applied a total of 20 rules in 20 ms. Remains 29 /39 variables (removed 10) and now considering 61/76 (removed 15) transitions.
// Phase 1: matrix 61 rows 29 cols
[2024-05-21 19:50:20] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:50:20] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:50:20] [INFO ] Invariant cache hit.
[2024-05-21 19:50:21] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:50:21] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-21 19:50:21] [INFO ] Redundant transitions in 19 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 19:50:21] [INFO ] Invariant cache hit.
[2024-05-21 19:50:21] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/90 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 69 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 60/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/90 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 129 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2522 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 4149ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4150ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/39 places, 61/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4363 ms. Remains : 29/39 places, 61/76 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-11
Product exploration explored 100000 steps with 2 reset in 140 ms.
Product exploration explored 100000 steps with 3 reset in 149 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), p0, (NOT p1)]
RANDOM walk for 3984 steps (283 resets) in 23 ms. (166 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), p0, (NOT p1)]
[2024-05-21 19:50:26] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-03a-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-11 finished in 5898 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)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 0 with 5 rules applied. Total rules applied 5 place count 37 transition count 71
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 33 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 32 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 32 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 31 transition count 69
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 17 place count 27 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 27 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 25 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 24 transition count 54
Applied a total of 27 rules in 19 ms. Remains 24 /39 variables (removed 15) and now considering 54/76 (removed 22) transitions.
// Phase 1: matrix 54 rows 24 cols
[2024-05-21 19:50:26] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:50:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 19:50:26] [INFO ] Invariant cache hit.
[2024-05-21 19:50:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:50:26] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-21 19:50:26] [INFO ] Redundant transitions in 18 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-21 19:50:26] [INFO ] Invariant cache hit.
[2024-05-21 19:50:26] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 53/77 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-21 19:50:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/78 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 31 constraints, problems are : Problem set: 0 solved, 53 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 53/77 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 53/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/78 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 84 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1433 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
After SMT, in 2484ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2485ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/39 places, 54/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2660 ms. Remains : 24/39 places, 54/76 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-12 finished in 2756 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((F(p0)&&X(G(p1)))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 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 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 35 transition count 71
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 10 place count 34 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 31 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 31 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 29 transition count 60
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 2 with 2 rules applied. Total rules applied 22 place count 28 transition count 60
Applied a total of 22 rules in 13 ms. Remains 28 /39 variables (removed 11) and now considering 60/76 (removed 16) transitions.
// Phase 1: matrix 60 rows 28 cols
[2024-05-21 19:50:29] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 19:50:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 19:50:29] [INFO ] Invariant cache hit.
[2024-05-21 19:50:29] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:50:29] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-21 19:50:29] [INFO ] Redundant transitions in 13 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 19:50:29] [INFO ] Invariant cache hit.
[2024-05-21 19:50:29] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 19:50:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/88 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 69 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1707 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 59/87 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2515 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 4269ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4269ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/39 places, 60/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4401 ms. Remains : 28/39 places, 60/76 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-14
Product exploration explored 100000 steps with 53 reset in 85 ms.
Product exploration explored 100000 steps with 3 reset in 230 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (3107 resets) in 181 ms. (219 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (601 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
[2024-05-21 19:50:34] [INFO ] Invariant cache hit.
[2024-05-21 19:50:34] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/24 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/81 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 34/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/87 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/88 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 14/88 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/28 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Support contains 4 out of 28 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 : 28/28 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 28 /28 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-21 19:50:35] [INFO ] Invariant cache hit.
[2024-05-21 19:50:35] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:50:35] [INFO ] Invariant cache hit.
[2024-05-21 19:50:35] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 19:50:35] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-21 19:50:35] [INFO ] Redundant transitions in 18 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 19:50:35] [INFO ] Invariant cache hit.
[2024-05-21 19:50:35] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 19:50:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/88 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/88 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 69 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 59/87 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 59/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints]
After SMT, in 4998ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 5000ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5186 ms. Remains : 28/28 places, 60/60 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 40 ms :[(NOT p1)]
RANDOM walk for 963 steps (80 resets) in 11 ms. (80 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 119 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 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 69 ms.
Built C files in :
/tmp/ltsmin2519700945204189308
[2024-05-21 19:50:41] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-05-21 19:50:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:50:41] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-05-21 19:50:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:50:41] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-05-21 19:50:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:50:41] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2519700945204189308
Running compilation step : cd /tmp/ltsmin2519700945204189308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin2519700945204189308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2519700945204189308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7276543506429717012.hoa' '--buchi-type=spotba'
LTSmin run took 469 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-14 finished in 12292 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)) U p1))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 67
Applied a total of 6 rules in 2 ms. Remains 36 /39 variables (removed 3) and now considering 67/76 (removed 9) transitions.
// Phase 1: matrix 67 rows 36 cols
[2024-05-21 19:50:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:50:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:50:41] [INFO ] Invariant cache hit.
[2024-05-21 19:50:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 19:50:41] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-21 19:50:41] [INFO ] Invariant cache hit.
[2024-05-21 19:50:42] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-21 19:50:42] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:50:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:50:42] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:50:43] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2820 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3274 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints]
After SMT, in 6147ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 6149ms
Starting structural reductions in LTL mode, iteration 1 : 36/39 places, 67/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6290 ms. Remains : 36/39 places, 67/76 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-15 finished in 6483 ms.
All properties solved by simple procedures.
Total runtime 86821 ms.

BK_STOP 1716321048393

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutonomousCar-PT-03a, 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 r026-smll-171620167300252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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