Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 31K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717209457223

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:37:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:37:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:37:39] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-06-01 02:37:39] [INFO ] Transformed 119 places.
[2024-06-01 02:37:39] [INFO ] Transformed 132 transitions.
[2024-06-01 02:37:39] [INFO ] Found NUPN structural information;
[2024-06-01 02:37:39] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 115 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-01b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 109 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 109 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 106 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 105 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 105 transition count 118
Applied a total of 28 rules in 56 ms. Remains 105 /119 variables (removed 14) and now considering 118/132 (removed 14) transitions.
// Phase 1: matrix 118 rows 105 cols
[2024-06-01 02:37:39] [INFO ] Computed 6 invariants in 18 ms
[2024-06-01 02:37:40] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-06-01 02:37:40] [INFO ] Invariant cache hit.
[2024-06-01 02:37:40] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-06-01 02:37:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 02:37:41] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 19 ms to minimize.
[2024-06-01 02:37:41] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 02:37:41] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
[2024-06-01 02:37:41] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 02:37:41] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:37:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 02:37:43] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
[2024-06-01 02:37:43] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:37:43] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:37:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 02:37:43] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-01 02:37:44] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-06-01 02:37:44] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 6 (OVERLAPS) 118/223 variables, 105/134 constraints. Problems are: Problem set: 2 solved, 115 unsolved
[2024-06-01 02:37:45] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 135 constraints, problems are : Problem set: 2 solved, 115 unsolved in 7013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 2 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 2/105 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 24/30 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 118/223 variables, 105/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 115/250 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 115 unsolved
[2024-06-01 02:37:49] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/223 variables, 1/251 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 251 constraints, problems are : Problem set: 2 solved, 115 unsolved in 5381 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 115/117 constraints, Known Traps: 25/25 constraints]
After SMT, in 12514ms problems are : Problem set: 2 solved, 115 unsolved
Search for dead transitions found 2 dead transitions in 12541ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/119 places, 116/132 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 116
Applied a total of 1 rules in 10 ms. Remains 104 /105 variables (removed 1) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 104 cols
[2024-06-01 02:37:52] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 02:37:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 02:37:52] [INFO ] Invariant cache hit.
[2024-06-01 02:37:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/119 places, 116/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13354 ms. Remains : 104/119 places, 116/132 transitions.
Support contains 28 out of 104 places after structural reductions.
[2024-06-01 02:37:53] [INFO ] Flatten gal took : 44 ms
[2024-06-01 02:37:53] [INFO ] Flatten gal took : 19 ms
[2024-06-01 02:37:53] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 24 out of 104 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (16 resets) in 1291 ms. (30 steps per ms) remains 1/16 properties
BEST_FIRST walk for 14635 steps (6 resets) in 83 ms. (174 steps per ms) remains 0/1 properties
Computed a total of 27 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 95 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 95 transition count 103
Applied a total of 22 rules in 21 ms. Remains 95 /104 variables (removed 9) and now considering 103/116 (removed 13) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-06-01 02:37:54] [INFO ] Computed 6 invariants in 3 ms
[2024-06-01 02:37:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 02:37:54] [INFO ] Invariant cache hit.
[2024-06-01 02:37:54] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-06-01 02:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 7 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:37:55] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:37:56] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-06-01 02:37:56] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-06-01 02:37:56] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 02:37:56] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:37:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:37:56] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:37:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4876 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:01] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/198 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 224 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4298 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 21/21 constraints]
After SMT, in 9197ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 9199ms
Starting structural reductions in LTL mode, iteration 1 : 95/104 places, 103/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9377 ms. Remains : 95/104 places, 103/116 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-00
Product exploration explored 100000 steps with 17 reset in 278 ms.
Product exploration explored 100000 steps with 5 reset in 197 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 215 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 10235 steps (4 resets) in 24 ms. (409 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 181 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 02:38:05] [INFO ] Invariant cache hit.
[2024-06-01 02:38:05] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 02:38:05] [INFO ] Invariant cache hit.
[2024-06-01 02:38:05] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-06-01 02:38:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:06] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 3 ms to minimize.
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:08] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/198 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 224 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 21/21 constraints]
After SMT, in 9357ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 9359ms
Finished structural reductions in LTL mode , in 1 iterations and 9515 ms. Remains : 95/95 places, 103/103 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 16984 steps (8 resets) in 32 ms. (514 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 185 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Graph (trivial) has 85 edges and 95 vertex of which 4 / 95 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 93 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 93 transition count 96
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 42 place count 93 transition count 96
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 93 transition count 96
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 83 place count 62 transition count 65
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 114 place count 62 transition count 65
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 136 place count 62 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 62 transition count 69
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 155 place count 44 transition count 50
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 173 place count 44 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 176 place count 44 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 43 transition count 46
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 43 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 43 transition count 52
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 180 rules in 53 ms. Remains 43 /95 variables (removed 52) and now considering 52/103 (removed 51) transitions.
[2024-06-01 02:38:16] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
// Phase 1: matrix 52 rows 43 cols
[2024-06-01 02:38:16] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:38:16] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 02:38:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:38:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:38:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 02:38:16] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 5 ms to minimize.
[2024-06-01 02:38:16] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:38:16] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 02:38:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-01 02:38:17] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-06-01 02:38:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 9/14 constraints. Problems are: Problem set: 20 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 31 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (OVERLAPS) 51/94 variables, 43/57 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 10/67 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/67 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/95 variables, 1/68 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/68 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/68 constraints. Problems are: Problem set: 33 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 68 constraints, problems are : Problem set: 33 solved, 18 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 33 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 5/5 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 9/14 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 51/94 variables, 43/57 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 10/67 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 18/85 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/85 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/95 variables, 1/86 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/86 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/86 constraints. Problems are: Problem set: 33 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 86 constraints, problems are : Problem set: 33 solved, 18 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/51 constraints, Known Traps: 9/9 constraints]
After SMT, in 1527ms problems are : Problem set: 33 solved, 18 unsolved
Search for dead transitions found 33 dead transitions in 1528ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/95 places, 19/103 transitions.
Graph (complete) has 74 edges and 43 vertex of which 19 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 19 /43 variables (removed 24) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/95 places, 19/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1611 ms. Remains : 19/95 places, 19/103 transitions.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-06-01 02:38:17] [INFO ] Computed 6 invariants in 4 ms
[2024-06-01 02:38:18] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 02:38:18] [INFO ] Invariant cache hit.
[2024-06-01 02:38:18] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-06-01 02:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:18] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-01 02:38:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:38:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:20] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:38:20] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:20] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:20] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:21] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4863 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 02:38:24] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/198 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 224 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4159 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 21/21 constraints]
After SMT, in 9041ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 9044ms
Finished structural reductions in LTL mode , in 1 iterations and 9213 ms. Remains : 95/95 places, 103/103 transitions.
Treatment of property AutonomousCar-PT-01b-LTLCardinality-00 finished in 33150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 94 transition count 102
Applied a total of 24 rules in 8 ms. Remains 94 /104 variables (removed 10) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-06-01 02:38:27] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 02:38:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 02:38:27] [INFO ] Invariant cache hit.
[2024-06-01 02:38:27] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 02:38:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:28] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
[2024-06-01 02:38:29] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
[2024-06-01 02:38:29] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:29] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3865 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:31] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:32] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 7476ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7478ms
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 102/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7618 ms. Remains : 94/104 places, 102/116 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-01
Product exploration explored 100000 steps with 5 reset in 77 ms.
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-01 finished in 7911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((X(G(p2))||p1))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 97 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 97 transition count 109
Applied a total of 14 rules in 7 ms. Remains 97 /104 variables (removed 7) and now considering 109/116 (removed 7) transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-06-01 02:38:35] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 02:38:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 02:38:35] [INFO ] Invariant cache hit.
[2024-06-01 02:38:35] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 02:38:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:38:36] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:38:37] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 02:38:38] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 02:38:38] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 109/206 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 128 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5590 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 108/236 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 02:38:42] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 237 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3992 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 26/26 constraints]
After SMT, in 9598ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 9599ms
Starting structural reductions in LTL mode, iteration 1 : 97/104 places, 109/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9757 ms. Remains : 97/104 places, 109/116 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 87 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-02 finished in 9955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 94 transition count 102
Applied a total of 24 rules in 6 ms. Remains 94 /104 variables (removed 10) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-06-01 02:38:45] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 02:38:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 02:38:45] [INFO ] Invariant cache hit.
[2024-06-01 02:38:45] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 02:38:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:45] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:46] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:47] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:47] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3832 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:49] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:50] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3496 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 7341ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7343ms
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 102/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7506 ms. Remains : 94/104 places, 102/116 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-03
Product exploration explored 100000 steps with 20000 reset in 166 ms.
Product exploration explored 100000 steps with 20000 reset in 194 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (25 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30254 steps (7 resets) in 41 ms. (720 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 02:38:54] [INFO ] Invariant cache hit.
[2024-06-01 02:38:54] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 02:38:54] [INFO ] Invariant cache hit.
[2024-06-01 02:38:54] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 02:38:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:54] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:38:54] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:38:54] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 02:38:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:56] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3831 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:38:59] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3577 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 7422ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7424ms
Finished structural reductions in LTL mode , in 1 iterations and 7579 ms. Remains : 94/94 places, 102/102 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (17 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33687 steps (16 resets) in 49 ms. (673 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 70 ms.
Product exploration explored 100000 steps with 20000 reset in 85 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Graph (trivial) has 86 edges and 94 vertex of which 4 / 94 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 92 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 92 transition count 95
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 42 place count 92 transition count 96
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 53 place count 92 transition count 96
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 84 place count 61 transition count 65
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 115 place count 61 transition count 65
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 135 place count 61 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 61 transition count 65
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 152 place count 46 transition count 49
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 167 place count 46 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 45 transition count 46
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 45 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 45 transition count 46
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 43 transition count 44
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 43 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 43 transition count 56
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 179 rules in 40 ms. Remains 43 /94 variables (removed 51) and now considering 56/102 (removed 46) transitions.
[2024-06-01 02:39:03] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 43 cols
[2024-06-01 02:39:03] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:39:03] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
[2024-06-01 02:39:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/15 constraints. Problems are: Problem set: 22 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 22 solved, 33 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 4 (OVERLAPS) 55/98 variables, 43/58 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 15/73 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/73 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/74 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/74 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/74 constraints. Problems are: Problem set: 38 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 74 constraints, problems are : Problem set: 38 solved, 17 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 38 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/43 variables, 5/5 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/15 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 55/98 variables, 43/58 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 15/73 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 17/90 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/90 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/99 variables, 1/91 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/91 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/91 constraints. Problems are: Problem set: 38 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 91 constraints, problems are : Problem set: 38 solved, 17 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 17/55 constraints, Known Traps: 10/10 constraints]
After SMT, in 1484ms problems are : Problem set: 38 solved, 17 unsolved
Search for dead transitions found 38 dead transitions in 1484ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/94 places, 18/102 transitions.
Graph (complete) has 79 edges and 43 vertex of which 18 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 18 /43 variables (removed 25) and now considering 18/18 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/94 places, 18/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1535 ms. Remains : 18/94 places, 18/102 transitions.
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-06-01 02:39:04] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:39:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 02:39:04] [INFO ] Invariant cache hit.
[2024-06-01 02:39:04] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 02:39:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:39:05] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:39:06] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:39:06] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:39:06] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 02:39:06] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:39:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:06] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3789 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:10] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3575 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 7375ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7377ms
Finished structural reductions in LTL mode , in 1 iterations and 7548 ms. Remains : 94/94 places, 102/102 transitions.
Treatment of property AutonomousCar-PT-01b-LTLCardinality-03 finished in 26960 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))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 93 edges and 104 vertex of which 4 / 104 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 101 transition count 72
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 49 rules applied. Total rules applied 91 place count 60 transition count 64
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 96 place count 56 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 55 transition count 63
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 97 place count 55 transition count 56
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 111 place count 48 transition count 56
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 119 place count 40 transition count 48
Iterating global reduction 4 with 8 rules applied. Total rules applied 127 place count 40 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 131 place count 40 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 131 place count 40 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 39 transition count 43
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 37 transition count 41
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 37 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 139 place count 37 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 140 place count 36 transition count 39
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 168 place count 22 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 21 transition count 22
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 21 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 21 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 173 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 174 place count 18 transition count 20
Applied a total of 174 rules in 34 ms. Remains 18 /104 variables (removed 86) and now considering 20/116 (removed 96) transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-06-01 02:39:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 02:39:12] [INFO ] Invariant cache hit.
[2024-06-01 02:39:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [14, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 133 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/104 places, 20/116 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 19
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 0 with 2 rules applied. Total rules applied 4 place count 14 transition count 20
Applied a total of 4 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 14 cols
[2024-06-01 02:39:12] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 02:39:12] [INFO ] Invariant cache hit.
[2024-06-01 02:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/104 places, 20/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 14/104 places, 20/116 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-04 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 95 edges and 104 vertex of which 4 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 101 transition count 70
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 98 place count 58 transition count 59
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 104 place count 52 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 104 place count 52 transition count 53
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 46 transition count 53
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 39 transition count 46
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 39 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 134 place count 39 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 134 place count 39 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 38 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 37 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 37 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 37 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 36 transition count 38
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 167 place count 23 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 168 place count 23 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 22 transition count 21
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 22 transition count 21
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 7 with 2 rules applied. Total rules applied 172 place count 21 transition count 20
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 7 with 2 rules applied. Total rules applied 174 place count 20 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 176 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 177 place count 17 transition count 18
Applied a total of 177 rules in 26 ms. Remains 17 /104 variables (removed 87) and now considering 18/116 (removed 98) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-06-01 02:39:12] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 02:39:12] [INFO ] Invariant cache hit.
[2024-06-01 02:39:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/104 places, 18/116 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 17
Applied a total of 2 rules in 4 ms. Remains 15 /16 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-06-01 02:39:12] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 02:39:12] [INFO ] Invariant cache hit.
[2024-06-01 02:39:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/104 places, 17/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 15/104 places, 17/116 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-06
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-06 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&X(X(G(!p0))))))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 97 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 96 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 96 transition count 104
Applied a total of 20 rules in 5 ms. Remains 96 /104 variables (removed 8) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 96 cols
[2024-06-01 02:39:12] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 02:39:12] [INFO ] Invariant cache hit.
[2024-06-01 02:39:12] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 02:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:39:13] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 3 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:14] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:17] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-06-01 02:39:17] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 103/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:19] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/200 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:20] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 228 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5805 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
After SMT, in 9871ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 9872ms
Starting structural reductions in LTL mode, iteration 1 : 96/104 places, 104/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10027 ms. Remains : 96/104 places, 104/116 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), false, false, false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-07
Product exploration explored 100000 steps with 1 reset in 97 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 144 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (24 resets) in 144 ms. (275 steps per ms) remains 1/6 properties
BEST_FIRST walk for 24194 steps (10 resets) in 48 ms. (493 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 356 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-06-01 02:39:24] [INFO ] Invariant cache hit.
[2024-06-01 02:39:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 02:39:24] [INFO ] Invariant cache hit.
[2024-06-01 02:39:24] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 02:39:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:39:25] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
[2024-06-01 02:39:26] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-06-01 02:39:26] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-06-01 02:39:26] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:39:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-01 02:39:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:26] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4222 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:29] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:39:29] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 103/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:31] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/200 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:32] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 228 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5923 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
After SMT, in 10159ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 10160ms
Finished structural reductions in LTL mode , in 1 iterations and 10308 ms. Remains : 96/96 places, 104/104 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 158 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (21 resets) in 85 ms. (465 steps per ms) remains 1/6 properties
BEST_FIRST walk for 34062 steps (17 resets) in 37 ms. (896 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 463 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 5 reset in 344 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-06-01 02:39:36] [INFO ] Invariant cache hit.
[2024-06-01 02:39:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 02:39:36] [INFO ] Invariant cache hit.
[2024-06-01 02:39:36] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 02:39:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-06-01 02:39:37] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:38] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4147 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:41] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:39:41] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 103/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:43] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/200 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:43] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 228 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5478 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
After SMT, in 9639ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 9640ms
Finished structural reductions in LTL mode , in 1 iterations and 9799 ms. Remains : 96/96 places, 104/104 transitions.
Treatment of property AutonomousCar-PT-01b-LTLCardinality-07 finished in 33890 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 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 94 transition count 102
Applied a total of 24 rules in 6 ms. Remains 94 /104 variables (removed 10) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-06-01 02:39:46] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:39:46] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 02:39:46] [INFO ] Invariant cache hit.
[2024-06-01 02:39:46] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-06-01 02:39:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 2 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-01 02:39:47] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 02:39:48] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 02:39:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 02:39:48] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 02:39:48] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 02:39:48] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:48] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3775 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:50] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 02:39:51] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3527 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 7313ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7314ms
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 102/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7452 ms. Remains : 94/104 places, 102/116 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-09
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-09 finished in 7539 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)&&F(G(p1)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 87 edges and 104 vertex of which 4 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 101 transition count 75
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 63 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 61 transition count 68
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 91 place count 58 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 57 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 92 place count 57 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 106 place count 50 transition count 59
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 114 place count 42 transition count 51
Iterating global reduction 5 with 8 rules applied. Total rules applied 122 place count 42 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 126 place count 42 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 126 place count 42 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 41 transition count 46
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 130 place count 39 transition count 44
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 39 transition count 44
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 156 place count 27 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 157 place count 27 transition count 30
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 158 place count 26 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 26 transition count 28
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 7 with 2 rules applied. Total rules applied 161 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 162 place count 25 transition count 26
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 25 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 167 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 168 place count 22 transition count 24
Applied a total of 168 rules in 24 ms. Remains 22 /104 variables (removed 82) and now considering 24/116 (removed 92) transitions.
// Phase 1: matrix 24 rows 22 cols
[2024-06-01 02:39:54] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:39:54] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 02:39:54] [INFO ] Invariant cache hit.
[2024-06-01 02:39:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:39:54] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [18, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/104 places, 24/116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 22
Applied a total of 4 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-06-01 02:39:54] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:39:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 02:39:54] [INFO ] Invariant cache hit.
[2024-06-01 02:39:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:39:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/104 places, 22/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 166 ms. Remains : 18/104 places, 22/116 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-11
Product exploration explored 100000 steps with 11 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 76 steps (7 resets) in 6 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 02:39:55] [INFO ] Invariant cache hit.
[2024-06-01 02:39:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 02:39:55] [INFO ] Invariant cache hit.
[2024-06-01 02:39:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:39:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 02:39:55] [INFO ] Redundant transitions in 13 ms returned []
Running 19 sub problems to find dead transitions.
[2024-06-01 02:39:55] [INFO ] Invariant cache hit.
[2024-06-01 02:39:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 21/39 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 02:39:55] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 02:39:55] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 23 constraints, problems are : Problem set: 0 solved, 19 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 21/39 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 42 constraints, problems are : Problem set: 0 solved, 19 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 827 ms. Remains : 18/18 places, 22/22 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 95 steps (18 resets) in 5 ms. (15 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 2 reset in 57 ms.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 02:39:56] [INFO ] Invariant cache hit.
[2024-06-01 02:39:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 02:39:56] [INFO ] Invariant cache hit.
[2024-06-01 02:39:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:39:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-01 02:39:56] [INFO ] Redundant transitions in 15 ms returned []
Running 19 sub problems to find dead transitions.
[2024-06-01 02:39:56] [INFO ] Invariant cache hit.
[2024-06-01 02:39:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 21/39 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 02:39:57] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 02:39:57] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/40 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 23 constraints, problems are : Problem set: 0 solved, 19 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 21/39 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/40 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 42 constraints, problems are : Problem set: 0 solved, 19 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 787 ms. Remains : 18/18 places, 22/22 transitions.
Treatment of property AutonomousCar-PT-01b-LTLCardinality-11 finished in 3683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(F(p0)) U !p1)))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 96 transition count 104
Applied a total of 20 rules in 2 ms. Remains 96 /104 variables (removed 8) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 96 cols
[2024-06-01 02:39:57] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 02:39:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 02:39:57] [INFO ] Invariant cache hit.
[2024-06-01 02:39:57] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 02:39:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 02:39:58] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 02:39:59] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:40:00] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4447 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 103/224 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 02:40:03] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 225 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3315 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 20/20 constraints]
After SMT, in 7772ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 7773ms
Starting structural reductions in LTL mode, iteration 1 : 96/104 places, 104/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7927 ms. Remains : 96/104 places, 104/116 transitions.
Stuttering acceptance computed with spot in 219 ms :[p1, p1, p1, (NOT p0), (NOT p0), p1]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 68 ms.
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-13 finished in 8231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(p1)))))'
Found a Shortening insensitive property : AutonomousCar-PT-01b-LTLCardinality-00
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 93 edges and 104 vertex of which 4 / 104 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 101 transition count 71
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 96 place count 59 transition count 60
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 53 transition count 60
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 102 place count 53 transition count 53
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 116 place count 46 transition count 53
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 124 place count 38 transition count 45
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 38 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 136 place count 38 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 136 place count 38 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 37 transition count 40
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 35 transition count 38
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 35 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 35 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 145 place count 34 transition count 36
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 171 place count 21 transition count 22
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 20 transition count 20
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 20 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 175 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 176 place count 17 transition count 18
Applied a total of 176 rules in 16 ms. Remains 17 /104 variables (removed 87) and now considering 18/116 (removed 98) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-06-01 02:40:06] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 02:40:06] [INFO ] Invariant cache hit.
[2024-06-01 02:40:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [13, 16]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 71 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/104 places, 18/116 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 16
Applied a total of 4 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-06-01 02:40:06] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 02:40:06] [INFO ] Invariant cache hit.
[2024-06-01 02:40:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 13/104 places, 16/116 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 147 ms. Remains : 13/104 places, 16/116 transitions.
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 51 ms.
Stuttering criterion allowed to conclude after 22 steps with 3 reset in 0 ms.
Treatment of property AutonomousCar-PT-01b-LTLCardinality-00 finished in 491 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : AutonomousCar-PT-01b-LTLCardinality-03
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 96 edges and 104 vertex of which 4 / 104 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 101 transition count 70
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 98 place count 58 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 105 place count 52 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 51 transition count 58
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 106 place count 51 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 118 place count 45 transition count 52
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 125 place count 38 transition count 45
Iterating global reduction 4 with 7 rules applied. Total rules applied 132 place count 38 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 136 place count 38 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 136 place count 38 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 37 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 36 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 36 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 142 place count 36 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 143 place count 35 transition count 37
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 169 place count 22 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 170 place count 22 transition count 22
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 171 place count 21 transition count 20
Iterating global reduction 8 with 1 rules applied. Total rules applied 172 place count 21 transition count 20
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 8 with 2 rules applied. Total rules applied 174 place count 20 transition count 19
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 8 with 2 rules applied. Total rules applied 176 place count 19 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 178 place count 17 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 179 place count 16 transition count 17
Applied a total of 179 rules in 8 ms. Remains 16 /104 variables (removed 88) and now considering 17/116 (removed 99) transitions.
// Phase 1: matrix 17 rows 16 cols
[2024-06-01 02:40:06] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 02:40:06] [INFO ] Invariant cache hit.
[2024-06-01 02:40:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 72 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/104 places, 17/116 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 16
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 14 cols
[2024-06-01 02:40:06] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 02:40:06] [INFO ] Invariant cache hit.
[2024-06-01 02:40:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:40:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/104 places, 16/116 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 139 ms. Remains : 14/104 places, 16/116 transitions.
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-03
Product exploration explored 100000 steps with 27307 reset in 73 ms.
Product exploration explored 100000 steps with 27278 reset in 84 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1056 steps (217 resets) in 7 ms. (132 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 02:40:07] [INFO ] Invariant cache hit.
[2024-06-01 02:40:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 02:40:07] [INFO ] Invariant cache hit.
[2024-06-01 02:40:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:40:07] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-06-01 02:40:07] [INFO ] Invariant cache hit.
[2024-06-01 02:40:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 02:40:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 13 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 494ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 494ms
Finished structural reductions in LTL mode , in 1 iterations and 558 ms. Remains : 14/14 places, 16/16 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 657 steps (130 resets) in 6 ms. (93 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27260 reset in 72 ms.
Product exploration explored 100000 steps with 27165 reset in 81 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 02:40:09] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 02:40:09] [INFO ] Invariant cache hit.
[2024-06-01 02:40:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 02:40:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 13 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 14/14 places, 16/16 transitions.
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-06-01 02:40:10] [INFO ] Invariant cache hit.
[2024-06-01 02:40:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 02:40:10] [INFO ] Invariant cache hit.
[2024-06-01 02:40:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 02:40:10] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-06-01 02:40:10] [INFO ] Invariant cache hit.
[2024-06-01 02:40:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 02:40:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 13 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/30 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 33 constraints, problems are : Problem set: 0 solved, 13 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 455ms
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 14/14 places, 16/16 transitions.
Treatment of property AutonomousCar-PT-01b-LTLCardinality-03 finished in 4229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&X(X(G(!p0))))))))'
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)&&F(G(p1)))))'
[2024-06-01 02:40:10] [INFO ] Flatten gal took : 11 ms
[2024-06-01 02:40:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 02:40:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 116 transitions and 305 arcs took 3 ms.
Total runtime 151975 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-01b-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717209611749

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-01b-LTLCardinality-00
ltl formula formula --ltl=/tmp/3006/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 116 transitions and 305 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3006/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3006/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3006/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3006/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 105, there are 125 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~85!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 99
pnml2lts-mc( 0/ 4): unique states count: 471
pnml2lts-mc( 0/ 4): unique transitions count: 1192
pnml2lts-mc( 0/ 4): - self-loop count: 5
pnml2lts-mc( 0/ 4): - claim dead count: 147
pnml2lts-mc( 0/ 4): - claim found count: 43
pnml2lts-mc( 0/ 4): - claim success count: 494
pnml2lts-mc( 0/ 4): - cum. max stack depth: 366
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 494 states 1243 transitions, fanout: 2.516
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 49400, Transitions per second: 124300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.5 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 116 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-01b-LTLCardinality-03
ltl formula formula --ltl=/tmp/3006/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 116 transitions and 305 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3006/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3006/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3006/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3006/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 105, there are 122 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16
pnml2lts-mc( 0/ 4): unique states count: 16
pnml2lts-mc( 0/ 4): unique transitions count: 20
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 60 transitions, fanout: 1.875
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 52.5 B/state, compr.: 12.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 116 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-01b-LTLCardinality-07
ltl formula formula --ltl=/tmp/3006/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 116 transitions and 305 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3006/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3006/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3006/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3006/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 105, there are 198 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~90 levels ~10000 states ~40784 transitions
pnml2lts-mc( 3/ 4): ~90 levels ~20000 states ~85264 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~40000 states ~171456 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~84!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26478
pnml2lts-mc( 0/ 4): unique states count: 35025
pnml2lts-mc( 0/ 4): unique transitions count: 153202
pnml2lts-mc( 0/ 4): - self-loop count: 8
pnml2lts-mc( 0/ 4): - claim dead count: 100872
pnml2lts-mc( 0/ 4): - claim found count: 19723
pnml2lts-mc( 0/ 4): - claim success count: 36904
pnml2lts-mc( 0/ 4): - cum. max stack depth: 520
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 36905 states 163258 transitions, fanout: 4.424
pnml2lts-mc( 0/ 4): Total exploration time 0.290 sec (0.290 sec minimum, 0.290 sec on average)
pnml2lts-mc( 0/ 4): States per second: 127259, Transitions per second: 562959
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 8.7 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 116 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-01b-LTLCardinality-11
ltl formula formula --ltl=/tmp/3006/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 104 places, 116 transitions and 305 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3006/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3006/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3006/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3006/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 105, there are 141 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~77!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 67
pnml2lts-mc( 0/ 4): unique states count: 422
pnml2lts-mc( 0/ 4): unique transitions count: 1133
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 85
pnml2lts-mc( 0/ 4): - claim found count: 41
pnml2lts-mc( 0/ 4): - claim success count: 457
pnml2lts-mc( 0/ 4): - cum. max stack depth: 366
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 457 states 1215 transitions, fanout: 2.659
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45700, Transitions per second: 121500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.5 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 116 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-01b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-01b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167300227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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