About the Execution of ITS-Tools for AutonomousCar-PT-02b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 123302.00 | 0.00 | 0.00 | FFFTFFFTFFFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729700627.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is AutonomousCar-PT-02b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729700627
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 49K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-02b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748647820962
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 23:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 23:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:30:22] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-05-30 23:30:22] [INFO ] Transformed 155 places.
[2025-05-30 23:30:22] [INFO ] Transformed 194 transitions.
[2025-05-30 23:30:22] [INFO ] Found NUPN structural information;
[2025-05-30 23:30:22] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-02b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 134 transition count 173
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 134 transition count 173
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 58 place count 134 transition count 157
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 130 transition count 153
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 130 transition count 153
Applied a total of 66 rules in 36 ms. Remains 130 /155 variables (removed 25) and now considering 153/194 (removed 41) transitions.
// Phase 1: matrix 153 rows 130 cols
[2025-05-30 23:30:22] [INFO ] Computed 7 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:30:22] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-30 23:30:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:30:22] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-30 23:30:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:24] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:24] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:24] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:24] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:24] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:25] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:26] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:26] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:26] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:26] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:26] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD143 is UNSAT
At refinement iteration 5 (OVERLAPS) 153/283 variables, 130/158 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:28] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:28] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 2/160 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/160 constraints. Problems are: Problem set: 2 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 160 constraints, problems are : Problem set: 2 solved, 150 unsolved in 10002 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 2/130 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 21/28 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:33] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/29 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:33] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 153/283 variables, 130/160 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 150/310 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:34] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/311 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:36] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 1/312 constraints. Problems are: Problem set: 2 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 2/314 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:41] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:42] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 2/316 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:30:49] [INFO ] Deduced a trap along path composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/317 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:00] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 1/318 constraints. Problems are: Problem set: 2 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 318 constraints, problems are : Problem set: 2 solved, 150 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 150/152 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 40086ms problems are : Problem set: 2 solved, 150 unsolved
Search for dead transitions found 2 dead transitions in 40096ms
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 : 130/155 places, 151/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 151
Applied a total of 1 rules in 7 ms. Remains 129 /130 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 129 cols
[2025-05-30 23:31:02] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 23:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:03] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/155 places, 151/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40669 ms. Remains : 129/155 places, 151/194 transitions.
Support contains 16 out of 129 places after structural reductions.
[2025-05-30 23:31:03] [INFO ] Flatten gal took : 30 ms
[2025-05-30 23:31:03] [INFO ] Flatten gal took : 13 ms
[2025-05-30 23:31:03] [INFO ] Input system was already deterministic with 151 transitions.
RANDOM walk for 40000 steps (23 resets) in 692 ms. (57 steps per ms) remains 0/8 properties
FORMULA AutonomousCar-PT-02b-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutonomousCar-PT-02b-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 30 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(p1))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 151/151 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 147
Applied a total of 8 rules in 8 ms. Remains 125 /129 variables (removed 4) and now considering 147/151 (removed 4) transitions.
// Phase 1: matrix 147 rows 125 cols
[2025-05-30 23:31:03] [INFO ] Computed 7 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 23:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-05-30 23:31:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:04] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:05] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/272 variables, 125/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:08] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:09] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 158 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8929 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/272 variables, 125/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 146/302 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:16] [INFO ] Deduced a trap along path composed of 2 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:16] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:16] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:16] [INFO ] Deduced a trap along path composed of 7 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:17] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 309 constraints, problems are : Problem set: 0 solved, 146 unsolved in 26114 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 35064ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 35068ms
Starting structural reductions in LTL mode, iteration 1 : 125/129 places, 147/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35209 ms. Remains : 125/129 places, 147/151 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 221 ms.
Stuttering criterion allowed to conclude after 163 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-00 finished in 35816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 151/151 transitions.
Graph (trivial) has 118 edges and 129 vertex of which 4 / 129 are part of one of the 2 SCC in 3 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 126 transition count 97
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 65 rules applied. Total rules applied 117 place count 75 transition count 83
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 125 place count 67 transition count 83
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 125 place count 67 transition count 75
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 141 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 56 transition count 72
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 56 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 147 place count 56 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 55 transition count 71
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 189 place count 35 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 35 transition count 49
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 195 place count 30 transition count 38
Iterating global reduction 4 with 5 rules applied. Total rules applied 200 place count 30 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 30 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 205 place count 28 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 26 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 213 place count 26 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 24 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 23 transition count 38
Applied a total of 216 rules in 31 ms. Remains 23 /129 variables (removed 106) and now considering 38/151 (removed 113) transitions.
// Phase 1: matrix 38 rows 23 cols
[2025-05-30 23:31:39] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-30 23:31:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-30 23:31:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [19, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 118 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/129 places, 38/151 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 19 transition count 36
Applied a total of 4 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 36/38 (removed 2) transitions.
// Phase 1: matrix 36 rows 19 cols
[2025-05-30 23:31:39] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:39] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 23:31:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 23:31:39] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/129 places, 36/151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 19/129 places, 36/151 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-04
Product exploration explored 100000 steps with 8 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 132 steps (10 resets) in 13 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2025-05-30 23:31:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-30 23:31:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 23:31:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:31:40] [INFO ] Redundant transitions in 12 ms returned []
Running 35 sub problems to find dead transitions.
[2025-05-30 23:31:40] [INFO ] Invariant cache hit.
[2025-05-30 23:31:40] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 35/54 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:40] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:40] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 1/55 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:41] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/55 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 34 constraints, problems are : Problem set: 0 solved, 35 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 1/19 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 35/54 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 1/55 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/55 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 69 constraints, problems are : Problem set: 0 solved, 35 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1681ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1682ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1777 ms. Remains : 19/19 places, 36/36 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 258 steps (28 resets) in 8 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11 reset in 49 ms.
Product exploration explored 100000 steps with 9 reset in 150 ms.
Built C files in :
/tmp/ltsmin16578075098506479490
[2025-05-30 23:31:42] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2025-05-30 23:31:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:31:42] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2025-05-30 23:31:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:31:42] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2025-05-30 23:31:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:31:42] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16578075098506479490
Running compilation step : cd /tmp/ltsmin16578075098506479490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 238 ms.
Running link step : cd /tmp/ltsmin16578075098506479490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16578075098506479490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14539106396270519700.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLCardinality-04 finished in 3595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 151/151 transitions.
Graph (trivial) has 117 edges and 129 vertex of which 4 / 129 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 126 transition count 98
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 67 rules applied. Total rules applied 118 place count 76 transition count 81
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 129 place count 66 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 65 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 130 place count 65 transition count 74
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 142 place count 59 transition count 74
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 145 place count 56 transition count 71
Iterating global reduction 4 with 3 rules applied. Total rules applied 148 place count 56 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 148 place count 56 transition count 70
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 55 transition count 70
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 194 place count 33 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 33 transition count 46
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 199 place count 29 transition count 38
Iterating global reduction 5 with 4 rules applied. Total rules applied 203 place count 29 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 205 place count 29 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 209 place count 27 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 211 place count 26 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 24 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 214 place count 23 transition count 33
Applied a total of 214 rules in 26 ms. Remains 23 /129 variables (removed 106) and now considering 33/151 (removed 118) transitions.
// Phase 1: matrix 33 rows 23 cols
[2025-05-30 23:31:43] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-30 23:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 23:31:43] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [19, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 66 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/129 places, 33/151 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 19 transition count 31
Applied a total of 4 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 31/33 (removed 2) transitions.
// Phase 1: matrix 31 rows 19 cols
[2025-05-30 23:31:43] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 23:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:31:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/129 places, 31/151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 146 ms. Remains : 19/129 places, 31/151 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-08
Product exploration explored 100000 steps with 1 reset in 33 ms.
Product exploration explored 100000 steps with 3 reset in 86 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 20 steps (1 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 31/31 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2025-05-30 23:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-30 23:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 23:31:43] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 23:31:43] [INFO ] Redundant transitions in 15 ms returned []
Running 28 sub problems to find dead transitions.
[2025-05-30 23:31:43] [INFO ] Invariant cache hit.
[2025-05-30 23:31:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 30/49 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:44] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/50 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:44] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:44] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/50 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/50 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 26 constraints, problems are : Problem set: 0 solved, 28 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 30/49 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/50 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 54 constraints, problems are : Problem set: 0 solved, 28 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1348ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1348ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1439 ms. Remains : 19/19 places, 31/31 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 23 steps (1 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5 reset in 47 ms.
Product exploration explored 100000 steps with 3 reset in 148 ms.
Built C files in :
/tmp/ltsmin11598094398413889100
[2025-05-30 23:31:45] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2025-05-30 23:31:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:31:45] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2025-05-30 23:31:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:31:45] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2025-05-30 23:31:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 23:31:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11598094398413889100
Running compilation step : cd /tmp/ltsmin11598094398413889100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 108 ms.
Running link step : cd /tmp/ltsmin11598094398413889100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11598094398413889100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1282084007542696568.hoa' '--buchi-type=spotba'
LTSmin run took 79 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-02b-LTLCardinality-08 finished in 3011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 151/151 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 147
Applied a total of 8 rules in 6 ms. Remains 125 /129 variables (removed 4) and now considering 147/151 (removed 4) transitions.
// Phase 1: matrix 147 rows 125 cols
[2025-05-30 23:31:46] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 23:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 23:31:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-05-30 23:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:47] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:48] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:49] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/272 variables, 125/156 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:51] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:53] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 158 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10557 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:57] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:57] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/272 variables, 125/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 146/304 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:58] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:31:58] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:32:02] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:32:02] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:32:03] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 23:32:03] [INFO ] Deduced a trap along path composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/272 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 312 constraints, problems are : Problem set: 0 solved, 146 unsolved in 27209 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 37787ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 37788ms
Starting structural reductions in LTL mode, iteration 1 : 125/129 places, 147/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37924 ms. Remains : 125/129 places, 147/151 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 318 steps with 4 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLCardinality-10 finished in 38112 ms.
All properties solved by simple procedures.
Total runtime 122085 ms.
BK_STOP 1748647944264
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-02b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-02b, 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 r002-tall-174853729700627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-02b.tgz
mv AutonomousCar-PT-02b 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.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 '
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 ;