Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 228K 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-06b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716331919868

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:52:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:52:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:52:02] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2024-05-21 22:52:02] [INFO ] Transformed 289 places.
[2024-05-21 22:52:02] [INFO ] Transformed 644 transitions.
[2024-05-21 22:52:02] [INFO ] Found NUPN structural information;
[2024-05-21 22:52:02] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 578 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-06b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 248 transition count 603
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 248 transition count 603
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 226 place count 248 transition count 459
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 234 place count 240 transition count 451
Iterating global reduction 1 with 8 rules applied. Total rules applied 242 place count 240 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 239 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 239 transition count 450
Applied a total of 244 rules in 193 ms. Remains 239 /289 variables (removed 50) and now considering 450/644 (removed 194) transitions.
// Phase 1: matrix 450 rows 239 cols
[2024-05-21 22:52:03] [INFO ] Computed 11 invariants in 38 ms
[2024-05-21 22:52:04] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-21 22:52:04] [INFO ] Invariant cache hit.
[2024-05-21 22:52:04] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2024-05-21 22:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:52:14] [INFO ] Deduced a trap composed of 18 places in 439 ms of which 50 ms to minimize.
[2024-05-21 22:52:14] [INFO ] Deduced a trap composed of 14 places in 364 ms of which 6 ms to minimize.
[2024-05-21 22:52:15] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 4 ms to minimize.
[2024-05-21 22:52:15] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 3 ms to minimize.
[2024-05-21 22:52:15] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 2 ms to minimize.
[2024-05-21 22:52:15] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 2 ms to minimize.
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2024-05-21 22:52:16] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 2 ms to minimize.
[2024-05-21 22:52:17] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-05-21 22:52:17] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 2 ms to minimize.
[2024-05-21 22:52:17] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 2 ms to minimize.
[2024-05-21 22:52:17] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-05-21 22:52:17] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-05-21 22:52:18] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 2 ms to minimize.
[2024-05-21 22:52:18] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 3 ms to minimize.
[2024-05-21 22:52:18] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-05-21 22:52:18] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:52:19] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-21 22:52:19] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 3 ms to minimize.
[2024-05-21 22:52:19] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
[2024-05-21 22:52:19] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-05-21 22:52:19] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 3 ms to minimize.
[2024-05-21 22:52:20] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2024-05-21 22:52:20] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-21 22:52:20] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-21 22:52:20] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 4 ms to minimize.
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 3 ms to minimize.
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 4 ms to minimize.
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 3 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 3 ms to minimize.
[2024-05-21 22:52:22] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 4 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 4 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:52:27] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 4 ms to minimize.
[2024-05-21 22:52:27] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 4 ms to minimize.
[2024-05-21 22:52:28] [INFO ] Deduced a trap composed of 40 places in 274 ms of which 4 ms to minimize.
[2024-05-21 22:52:28] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 3 ms to minimize.
[2024-05-21 22:52:28] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 4 ms to minimize.
[2024-05-21 22:52:29] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 4 ms to minimize.
[2024-05-21 22:52:29] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 3 ms to minimize.
[2024-05-21 22:52:30] [INFO ] Deduced a trap composed of 60 places in 248 ms of which 4 ms to minimize.
[2024-05-21 22:52:30] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 4 ms to minimize.
[2024-05-21 22:52:30] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 4 ms to minimize.
[2024-05-21 22:52:31] [INFO ] Deduced a trap composed of 51 places in 264 ms of which 5 ms to minimize.
[2024-05-21 22:52:31] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 4 ms to minimize.
[2024-05-21 22:52:31] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 4 ms to minimize.
[2024-05-21 22:52:32] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 4 ms to minimize.
[2024-05-21 22:52:32] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 4 ms to minimize.
[2024-05-21 22:52:32] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-05-21 22:52:33] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-21 22:52:33] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-21 22:52:33] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
[2024-05-21 22:52:33] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-05-21 22:52:35] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 3 ms to minimize.
[2024-05-21 22:52:36] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 3 ms to minimize.
SMT process timed out in 31535ms, After SMT, problems are : Problem set: 0 solved, 449 unsolved
Search for dead transitions found 0 dead transitions in 31598ms
Starting structural reductions in LTL mode, iteration 1 : 239/289 places, 450/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32948 ms. Remains : 239/289 places, 450/644 transitions.
Support contains 41 out of 239 places after structural reductions.
[2024-05-21 22:52:36] [INFO ] Flatten gal took : 161 ms
[2024-05-21 22:52:36] [INFO ] Flatten gal took : 86 ms
[2024-05-21 22:52:37] [INFO ] Input system was already deterministic with 450 transitions.
Support contains 40 out of 239 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (176 resets) in 2601 ms. (15 steps per ms) remains 7/26 properties
BEST_FIRST walk for 40002 steps (83 resets) in 205 ms. (194 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (79 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (76 resets) in 94 ms. (421 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (63 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
[2024-05-21 22:52:38] [INFO ] Invariant cache hit.
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 199/206 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/239 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 450/689 variables, 239/250 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/250 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/689 variables, 0/250 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 250 constraints, problems are : Problem set: 1 solved, 2 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 135/239 variables, 6/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 450/689 variables, 239/250 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 2/252 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/252 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/689 variables, 0/252 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 689/689 variables, and 252 constraints, problems are : Problem set: 1 solved, 2 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1006ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 599 ms.
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 224 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 874 edges and 237 vertex of which 235 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 235 transition count 356
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 126 rules applied. Total rules applied 218 place count 147 transition count 318
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 240 place count 125 transition count 318
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 240 place count 125 transition count 312
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 252 place count 119 transition count 312
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 255 place count 116 transition count 309
Iterating global reduction 3 with 3 rules applied. Total rules applied 258 place count 116 transition count 309
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 362 place count 64 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 363 place count 64 transition count 256
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 374 place count 53 transition count 189
Iterating global reduction 4 with 11 rules applied. Total rules applied 385 place count 53 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 389 place count 53 transition count 185
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 5 with 2 rules applied. Total rules applied 391 place count 52 transition count 184
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 399 place count 52 transition count 176
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 407 place count 44 transition count 176
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 408 place count 44 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 409 place count 43 transition count 175
Applied a total of 409 rules in 143 ms. Remains 43 /239 variables (removed 196) and now considering 175/450 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 43/239 places, 175/450 transitions.
RANDOM walk for 27285 steps (603 resets) in 449 ms. (60 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 40 stabilizing places and 41 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U (p1||F((G(F(!p2))||(!p3&&F(!p2)))))))))'
Support contains 12 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 28 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 22:52:40] [INFO ] Computed 11 invariants in 7 ms
[2024-05-21 22:52:40] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 22:52:40] [INFO ] Invariant cache hit.
[2024-05-21 22:52:41] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 22:52:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:52:49] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 4 ms to minimize.
[2024-05-21 22:52:49] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 5 ms to minimize.
[2024-05-21 22:52:49] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 4 ms to minimize.
[2024-05-21 22:52:50] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 4 ms to minimize.
[2024-05-21 22:52:50] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:52:50] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-21 22:52:51] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 4 ms to minimize.
[2024-05-21 22:52:51] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 4 ms to minimize.
[2024-05-21 22:52:51] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 3 ms to minimize.
[2024-05-21 22:52:52] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 3 ms to minimize.
[2024-05-21 22:52:52] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-05-21 22:52:52] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 3 ms to minimize.
[2024-05-21 22:52:53] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:52:53] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 4 ms to minimize.
[2024-05-21 22:52:53] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 4 ms to minimize.
[2024-05-21 22:52:54] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 3 ms to minimize.
[2024-05-21 22:52:54] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:52:54] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 3 ms to minimize.
[2024-05-21 22:52:55] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 3 ms to minimize.
[2024-05-21 22:52:55] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:52:56] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 4 ms to minimize.
[2024-05-21 22:52:56] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 4 ms to minimize.
[2024-05-21 22:52:57] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 4 ms to minimize.
[2024-05-21 22:52:57] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 4 ms to minimize.
[2024-05-21 22:52:57] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 3 ms to minimize.
[2024-05-21 22:52:57] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 3 ms to minimize.
[2024-05-21 22:52:58] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 3 ms to minimize.
[2024-05-21 22:52:58] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-05-21 22:52:58] [INFO ] Deduced a trap composed of 57 places in 311 ms of which 5 ms to minimize.
[2024-05-21 22:52:59] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 3 ms to minimize.
[2024-05-21 22:52:59] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 3 ms to minimize.
[2024-05-21 22:52:59] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-05-21 22:53:00] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-05-21 22:53:00] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 3 ms to minimize.
[2024-05-21 22:53:00] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-05-21 22:53:00] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2024-05-21 22:53:01] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2024-05-21 22:53:01] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 3 ms to minimize.
[2024-05-21 22:53:01] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-21 22:53:01] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:53:06] [INFO ] Deduced a trap composed of 40 places in 309 ms of which 4 ms to minimize.
[2024-05-21 22:53:06] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 4 ms to minimize.
[2024-05-21 22:53:06] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 4 ms to minimize.
[2024-05-21 22:53:07] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-05-21 22:53:08] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-05-21 22:53:08] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-05-21 22:53:08] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-05-21 22:53:09] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2024-05-21 22:53:09] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-05-21 22:53:09] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 2 ms to minimize.
[2024-05-21 22:53:09] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-05-21 22:53:10] [INFO ] Deduced a trap composed of 15 places in 287 ms of which 3 ms to minimize.
[2024-05-21 22:53:10] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 4 ms to minimize.
[2024-05-21 22:53:10] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:53:18] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-05-21 22:53:18] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 3 ms to minimize.
[2024-05-21 22:53:18] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-21 22:53:19] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 4 ms to minimize.
[2024-05-21 22:53:19] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 4 ms to minimize.
[2024-05-21 22:53:19] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-05-21 22:53:20] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 4 ms to minimize.
[2024-05-21 22:53:20] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 3 ms to minimize.
[2024-05-21 22:53:20] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-05-21 22:53:20] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2024-05-21 22:53:21] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2024-05-21 22:53:21] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-05-21 22:53:21] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-21 22:53:21] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 3 ms to minimize.
[2024-05-21 22:53:22] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:53:25] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 3 ms to minimize.
[2024-05-21 22:53:25] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:53:26] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 3 ms to minimize.
[2024-05-21 22:53:26] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 3 ms to minimize.
[2024-05-21 22:53:26] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 3 ms to minimize.
[2024-05-21 22:53:27] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 3 ms to minimize.
[2024-05-21 22:53:29] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:53:33] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 3 ms to minimize.
[2024-05-21 22:53:33] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 3 ms to minimize.
[2024-05-21 22:53:33] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 3 ms to minimize.
[2024-05-21 22:53:34] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 3 ms to minimize.
[2024-05-21 22:53:34] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 6 ms to minimize.
[2024-05-21 22:53:34] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:53:39] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2024-05-21 22:53:40] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 2 ms to minimize.
[2024-05-21 22:53:40] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2024-05-21 22:53:41] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61258ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61270ms
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61903 ms. Remains : 235/239 places, 446/450 transitions.
Stuttering acceptance computed with spot in 788 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND p0 p2), (AND (NOT p1) p2), (AND p2 p0), p2]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 579 ms.
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p3 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 28 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-01 finished in 63695 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 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 225 edges and 239 vertex of which 4 / 239 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 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 236 transition count 362
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 118 rules applied. Total rules applied 204 place count 151 transition count 329
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 224 place count 132 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 131 transition count 328
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 225 place count 131 transition count 320
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 241 place count 123 transition count 320
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 245 place count 119 transition count 316
Iterating global reduction 4 with 4 rules applied. Total rules applied 249 place count 119 transition count 316
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 355 place count 66 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 356 place count 66 transition count 261
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 369 place count 53 transition count 182
Iterating global reduction 5 with 13 rules applied. Total rules applied 382 place count 53 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 388 place count 53 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 392 place count 51 transition count 174
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 394 place count 49 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 395 place count 48 transition count 172
Applied a total of 395 rules in 108 ms. Remains 48 /239 variables (removed 191) and now considering 172/450 (removed 278) transitions.
// Phase 1: matrix 172 rows 48 cols
[2024-05-21 22:53:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 22:53:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 22:53:44] [INFO ] Invariant cache hit.
[2024-05-21 22:53:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:53:44] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [43, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 307 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/239 places, 172/450 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 171
Applied a total of 2 rules in 17 ms. Remains 45 /46 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 45 cols
[2024-05-21 22:53:44] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 22:53:44] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 22:53:44] [INFO ] Invariant cache hit.
[2024-05-21 22:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:53:45] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/239 places, 171/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 726 ms. Remains : 45/239 places, 171/450 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-02
Product exploration explored 100000 steps with 88 reset in 358 ms.
Product exploration explored 100000 steps with 93 reset in 186 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
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 48 ms :[(NOT p0)]
RANDOM walk for 103 steps (5 resets) in 5 ms. (17 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 139 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 171/171 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-21 22:53:46] [INFO ] Invariant cache hit.
[2024-05-21 22:53:46] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 22:53:46] [INFO ] Invariant cache hit.
[2024-05-21 22:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:53:46] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-21 22:53:46] [INFO ] Redundant transitions in 20 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 168 sub problems to find dead transitions.
// Phase 1: matrix 170 rows 45 cols
[2024-05-21 22:53:46] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 22:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 169/213 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-21 22:53:48] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/214 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 1/215 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 54 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7802 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/213 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 168/220 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 1/214 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 1/215 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 222 constraints, problems are : Problem set: 0 solved, 168 unsolved in 18126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 1/1 constraints]
After SMT, in 26461ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 26463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 170/171 transitions.
Reduce places removed 1 places and 1 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 43 transition count 168
Applied a total of 2 rules in 9 ms. Remains 43 /45 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 43 cols
[2024-05-21 22:54:12] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 22:54:12] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 22:54:12] [INFO ] Invariant cache hit.
[2024-05-21 22:54:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:54:12] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/45 places, 168/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26983 ms. Remains : 43/45 places, 168/171 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 212 steps (15 resets) in 6 ms. (30 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 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23 reset in 70 ms.
Product exploration explored 100000 steps with 68 reset in 106 ms.
Built C files in :
/tmp/ltsmin6419237538952935448
[2024-05-21 22:54:13] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2024-05-21 22:54:13] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:54:13] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2024-05-21 22:54:13] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:54:13] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2024-05-21 22:54:13] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:54:13] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6419237538952935448
Running compilation step : cd /tmp/ltsmin6419237538952935448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1498 ms.
Running link step : cd /tmp/ltsmin6419237538952935448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6419237538952935448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16947420044535482017.hoa' '--buchi-type=spotba'
LTSmin run took 285 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLFireability-02 finished in 31262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1 U G(!p1)))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 236 transition count 447
Applied a total of 6 rules in 13 ms. Remains 236 /239 variables (removed 3) and now considering 447/450 (removed 3) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 22:54:15] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 22:54:15] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 22:54:15] [INFO ] Invariant cache hit.
[2024-05-21 22:54:16] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 22:54:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:54:23] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 5 ms to minimize.
[2024-05-21 22:54:24] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 4 ms to minimize.
[2024-05-21 22:54:24] [INFO ] Deduced a trap composed of 36 places in 301 ms of which 4 ms to minimize.
[2024-05-21 22:54:24] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 3 ms to minimize.
[2024-05-21 22:54:25] [INFO ] Deduced a trap composed of 27 places in 390 ms of which 3 ms to minimize.
[2024-05-21 22:54:25] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 3 ms to minimize.
[2024-05-21 22:54:25] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 3 ms to minimize.
[2024-05-21 22:54:26] [INFO ] Deduced a trap composed of 24 places in 335 ms of which 4 ms to minimize.
[2024-05-21 22:54:26] [INFO ] Deduced a trap composed of 42 places in 302 ms of which 3 ms to minimize.
[2024-05-21 22:54:27] [INFO ] Deduced a trap composed of 37 places in 324 ms of which 4 ms to minimize.
[2024-05-21 22:54:27] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 4 ms to minimize.
[2024-05-21 22:54:27] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 4 ms to minimize.
[2024-05-21 22:54:28] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-05-21 22:54:28] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 4 ms to minimize.
[2024-05-21 22:54:28] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 4 ms to minimize.
[2024-05-21 22:54:29] [INFO ] Deduced a trap composed of 42 places in 312 ms of which 4 ms to minimize.
[2024-05-21 22:54:29] [INFO ] Deduced a trap composed of 38 places in 309 ms of which 4 ms to minimize.
[2024-05-21 22:54:29] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 3 ms to minimize.
[2024-05-21 22:54:29] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:54:30] [INFO ] Deduced a trap composed of 37 places in 300 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:54:30] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:54:31] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 4 ms to minimize.
[2024-05-21 22:54:31] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 4 ms to minimize.
[2024-05-21 22:54:31] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 4 ms to minimize.
[2024-05-21 22:54:32] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 4 ms to minimize.
[2024-05-21 22:54:32] [INFO ] Deduced a trap composed of 53 places in 290 ms of which 4 ms to minimize.
[2024-05-21 22:54:32] [INFO ] Deduced a trap composed of 55 places in 277 ms of which 4 ms to minimize.
[2024-05-21 22:54:32] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 4 ms to minimize.
[2024-05-21 22:54:33] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 4 ms to minimize.
[2024-05-21 22:54:33] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 4 ms to minimize.
[2024-05-21 22:54:33] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 3 ms to minimize.
[2024-05-21 22:54:34] [INFO ] Deduced a trap composed of 56 places in 266 ms of which 3 ms to minimize.
[2024-05-21 22:54:34] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 4 ms to minimize.
[2024-05-21 22:54:34] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 3 ms to minimize.
[2024-05-21 22:54:34] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 4 ms to minimize.
[2024-05-21 22:54:35] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 3 ms to minimize.
[2024-05-21 22:54:36] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 4 ms to minimize.
[2024-05-21 22:54:36] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-05-21 22:54:36] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 2 ms to minimize.
[2024-05-21 22:54:36] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:54:41] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 4 ms to minimize.
[2024-05-21 22:54:41] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 3 ms to minimize.
[2024-05-21 22:54:41] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 3 ms to minimize.
[2024-05-21 22:54:42] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 3 ms to minimize.
[2024-05-21 22:54:42] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 3 ms to minimize.
[2024-05-21 22:54:42] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 3 ms to minimize.
[2024-05-21 22:54:42] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 3 ms to minimize.
[2024-05-21 22:54:43] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 4 ms to minimize.
[2024-05-21 22:54:43] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2024-05-21 22:54:43] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 3 ms to minimize.
[2024-05-21 22:54:44] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 3 ms to minimize.
[2024-05-21 22:54:44] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
[2024-05-21 22:54:44] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2024-05-21 22:54:44] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-05-21 22:54:45] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 3 ms to minimize.
[2024-05-21 22:54:46] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
[2024-05-21 22:54:46] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-21 22:54:46] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
SMT process timed out in 30866ms, After SMT, problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 30872ms
Starting structural reductions in LTL mode, iteration 1 : 236/239 places, 447/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31430 ms. Remains : 236/239 places, 447/450 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) p1), true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-03 finished in 31653 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 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 225 edges and 239 vertex of which 4 / 239 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 236 transition count 360
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 211 place count 149 transition count 324
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 232 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 232 place count 128 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 244 place count 122 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 118 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 118 transition count 314
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 356 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 357 place count 66 transition count 260
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 369 place count 54 transition count 187
Iterating global reduction 4 with 12 rules applied. Total rules applied 381 place count 54 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 386 place count 54 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 390 place count 52 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 392 place count 50 transition count 178
Applied a total of 392 rules in 102 ms. Remains 50 /239 variables (removed 189) and now considering 178/450 (removed 272) transitions.
// Phase 1: matrix 178 rows 50 cols
[2024-05-21 22:54:47] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 22:54:47] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 22:54:47] [INFO ] Invariant cache hit.
[2024-05-21 22:54:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 22:54:47] [INFO ] Implicit Places using invariants and state equation in 216 ms returned [45, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 342 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/239 places, 178/450 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 47 transition count 177
Applied a total of 2 rules in 13 ms. Remains 47 /48 variables (removed 1) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 47 cols
[2024-05-21 22:54:47] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 22:54:47] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 22:54:47] [INFO ] Invariant cache hit.
[2024-05-21 22:54:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:54:47] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/239 places, 177/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 756 ms. Remains : 47/239 places, 177/450 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-04
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-04 finished in 834 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(p0)||(p1 U p2)))))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 9 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 22:54:48] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 22:54:48] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 22:54:48] [INFO ] Invariant cache hit.
[2024-05-21 22:54:48] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 22:54:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:54:57] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 4 ms to minimize.
[2024-05-21 22:54:57] [INFO ] Deduced a trap composed of 55 places in 353 ms of which 4 ms to minimize.
[2024-05-21 22:54:58] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 4 ms to minimize.
[2024-05-21 22:54:58] [INFO ] Deduced a trap composed of 53 places in 293 ms of which 4 ms to minimize.
[2024-05-21 22:54:58] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 4 ms to minimize.
[2024-05-21 22:54:58] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 22:54:59] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 3 ms to minimize.
[2024-05-21 22:54:59] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:55:00] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 3 ms to minimize.
[2024-05-21 22:55:00] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 3 ms to minimize.
[2024-05-21 22:55:00] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 3 ms to minimize.
[2024-05-21 22:55:01] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 4 ms to minimize.
[2024-05-21 22:55:01] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 4 ms to minimize.
[2024-05-21 22:55:01] [INFO ] Deduced a trap composed of 42 places in 316 ms of which 4 ms to minimize.
[2024-05-21 22:55:01] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:55:02] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 3 ms to minimize.
[2024-05-21 22:55:02] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 3 ms to minimize.
[2024-05-21 22:55:02] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 3 ms to minimize.
[2024-05-21 22:55:03] [INFO ] Deduced a trap composed of 39 places in 288 ms of which 3 ms to minimize.
[2024-05-21 22:55:03] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:55:04] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 4 ms to minimize.
[2024-05-21 22:55:04] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 3 ms to minimize.
[2024-05-21 22:55:05] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 3 ms to minimize.
[2024-05-21 22:55:05] [INFO ] Deduced a trap composed of 32 places in 289 ms of which 4 ms to minimize.
[2024-05-21 22:55:05] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-05-21 22:55:05] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-21 22:55:05] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-05-21 22:55:06] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 4 ms to minimize.
[2024-05-21 22:55:06] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 2 ms to minimize.
[2024-05-21 22:55:06] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-21 22:55:06] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2024-05-21 22:55:07] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-21 22:55:07] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-21 22:55:07] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-21 22:55:07] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 3 ms to minimize.
[2024-05-21 22:55:07] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 4 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2024-05-21 22:55:08] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-21 22:55:09] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:55:13] [INFO ] Deduced a trap composed of 40 places in 307 ms of which 4 ms to minimize.
[2024-05-21 22:55:14] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 4 ms to minimize.
[2024-05-21 22:55:14] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 4 ms to minimize.
[2024-05-21 22:55:15] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 2 ms to minimize.
[2024-05-21 22:55:15] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 2 ms to minimize.
[2024-05-21 22:55:15] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
[2024-05-21 22:55:15] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-05-21 22:55:16] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 2 ms to minimize.
[2024-05-21 22:55:16] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 6 ms to minimize.
[2024-05-21 22:55:17] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 3 ms to minimize.
[2024-05-21 22:55:17] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2024-05-21 22:55:17] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 3 ms to minimize.
[2024-05-21 22:55:18] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-05-21 22:55:18] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:55:25] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 4 ms to minimize.
[2024-05-21 22:55:25] [INFO ] Deduced a trap composed of 31 places in 279 ms of which 3 ms to minimize.
[2024-05-21 22:55:26] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-05-21 22:55:26] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 3 ms to minimize.
[2024-05-21 22:55:26] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 3 ms to minimize.
[2024-05-21 22:55:27] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-21 22:55:27] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 4 ms to minimize.
[2024-05-21 22:55:27] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 4 ms to minimize.
[2024-05-21 22:55:27] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-21 22:55:28] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-05-21 22:55:28] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-05-21 22:55:28] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-21 22:55:28] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 2 ms to minimize.
[2024-05-21 22:55:29] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:55:29] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:55:33] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 3 ms to minimize.
[2024-05-21 22:55:33] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 3 ms to minimize.
[2024-05-21 22:55:33] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 3 ms to minimize.
[2024-05-21 22:55:33] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 3 ms to minimize.
[2024-05-21 22:55:34] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 3 ms to minimize.
[2024-05-21 22:55:34] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 3 ms to minimize.
[2024-05-21 22:55:36] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:55:40] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 3 ms to minimize.
[2024-05-21 22:55:40] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 4 ms to minimize.
[2024-05-21 22:55:41] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2024-05-21 22:55:41] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 4 ms to minimize.
[2024-05-21 22:55:42] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 3 ms to minimize.
[2024-05-21 22:55:42] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:55:47] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 3 ms to minimize.
[2024-05-21 22:55:47] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 2 ms to minimize.
[2024-05-21 22:55:48] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 2 ms to minimize.
[2024-05-21 22:55:49] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61061ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61071ms
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61723 ms. Remains : 235/239 places, 446/450 transitions.
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-06
Product exploration explored 100000 steps with 43 reset in 280 ms.
Product exploration explored 100000 steps with 58 reset in 202 ms.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (185 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24714 steps (44 resets) in 87 ms. (280 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 143 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 235 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 446/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2024-05-21 22:55:51] [INFO ] Invariant cache hit.
[2024-05-21 22:55:51] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-21 22:55:51] [INFO ] Invariant cache hit.
[2024-05-21 22:55:52] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 22:55:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:56:00] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 4 ms to minimize.
[2024-05-21 22:56:00] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 4 ms to minimize.
[2024-05-21 22:56:01] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 4 ms to minimize.
[2024-05-21 22:56:01] [INFO ] Deduced a trap composed of 53 places in 312 ms of which 4 ms to minimize.
[2024-05-21 22:56:01] [INFO ] Deduced a trap composed of 43 places in 307 ms of which 4 ms to minimize.
[2024-05-21 22:56:01] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-21 22:56:02] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 4 ms to minimize.
[2024-05-21 22:56:02] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 4 ms to minimize.
[2024-05-21 22:56:03] [INFO ] Deduced a trap composed of 30 places in 285 ms of which 4 ms to minimize.
[2024-05-21 22:56:03] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 3 ms to minimize.
[2024-05-21 22:56:03] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 3 ms to minimize.
[2024-05-21 22:56:03] [INFO ] Deduced a trap composed of 44 places in 289 ms of which 3 ms to minimize.
[2024-05-21 22:56:04] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 4 ms to minimize.
[2024-05-21 22:56:04] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 4 ms to minimize.
[2024-05-21 22:56:04] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 3 ms to minimize.
[2024-05-21 22:56:05] [INFO ] Deduced a trap composed of 34 places in 280 ms of which 4 ms to minimize.
[2024-05-21 22:56:05] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 3 ms to minimize.
[2024-05-21 22:56:05] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:56:06] [INFO ] Deduced a trap composed of 39 places in 291 ms of which 3 ms to minimize.
[2024-05-21 22:56:06] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:56:06] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 4 ms to minimize.
[2024-05-21 22:56:07] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 4 ms to minimize.
[2024-05-21 22:56:07] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 4 ms to minimize.
[2024-05-21 22:56:08] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 3 ms to minimize.
[2024-05-21 22:56:08] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 3 ms to minimize.
[2024-05-21 22:56:08] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 3 ms to minimize.
[2024-05-21 22:56:09] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 3 ms to minimize.
[2024-05-21 22:56:09] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 3 ms to minimize.
[2024-05-21 22:56:09] [INFO ] Deduced a trap composed of 57 places in 312 ms of which 4 ms to minimize.
[2024-05-21 22:56:10] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-05-21 22:56:10] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 3 ms to minimize.
[2024-05-21 22:56:10] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 4 ms to minimize.
[2024-05-21 22:56:11] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-05-21 22:56:11] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 4 ms to minimize.
[2024-05-21 22:56:11] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 3 ms to minimize.
[2024-05-21 22:56:11] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 3 ms to minimize.
[2024-05-21 22:56:12] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 3 ms to minimize.
[2024-05-21 22:56:12] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 4 ms to minimize.
[2024-05-21 22:56:12] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-05-21 22:56:12] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:56:17] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 3 ms to minimize.
[2024-05-21 22:56:17] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 4 ms to minimize.
[2024-05-21 22:56:18] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 3 ms to minimize.
[2024-05-21 22:56:18] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
[2024-05-21 22:56:19] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 3 ms to minimize.
[2024-05-21 22:56:19] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-21 22:56:19] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-21 22:56:20] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 2 ms to minimize.
[2024-05-21 22:56:20] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-21 22:56:20] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-21 22:56:20] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-21 22:56:21] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 3 ms to minimize.
[2024-05-21 22:56:21] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 3 ms to minimize.
[2024-05-21 22:56:21] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:56:28] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 3 ms to minimize.
[2024-05-21 22:56:29] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 4 ms to minimize.
[2024-05-21 22:56:29] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-21 22:56:29] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 4 ms to minimize.
[2024-05-21 22:56:30] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 3 ms to minimize.
[2024-05-21 22:56:30] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-05-21 22:56:30] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2024-05-21 22:56:30] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 3 ms to minimize.
[2024-05-21 22:56:31] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-05-21 22:56:31] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-05-21 22:56:31] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2024-05-21 22:56:31] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-05-21 22:56:31] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 2 ms to minimize.
[2024-05-21 22:56:32] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 4 ms to minimize.
[2024-05-21 22:56:32] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:56:36] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 3 ms to minimize.
[2024-05-21 22:56:36] [INFO ] Deduced a trap composed of 35 places in 276 ms of which 3 ms to minimize.
[2024-05-21 22:56:36] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
[2024-05-21 22:56:36] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 3 ms to minimize.
[2024-05-21 22:56:37] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 4 ms to minimize.
[2024-05-21 22:56:37] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 3 ms to minimize.
[2024-05-21 22:56:39] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:56:43] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 4 ms to minimize.
[2024-05-21 22:56:43] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 4 ms to minimize.
[2024-05-21 22:56:44] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-05-21 22:56:44] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-05-21 22:56:45] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 3 ms to minimize.
[2024-05-21 22:56:45] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:56:50] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2024-05-21 22:56:50] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 5 ms to minimize.
[2024-05-21 22:56:51] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 2 ms to minimize.
[2024-05-21 22:56:52] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61026ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61036ms
Finished structural reductions in LTL mode , in 1 iterations and 61663 ms. Remains : 235/235 places, 446/446 transitions.
Computed a total of 39 stabilizing places and 40 stable transitions
Computed a total of 39 stabilizing places and 40 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 34811 steps (250 resets) in 111 ms. (310 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 157 reset in 160 ms.
Product exploration explored 100000 steps with 11 reset in 179 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 446/446 transitions.
Graph (trivial) has 221 edges and 235 vertex of which 4 / 235 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 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 233 transition count 444
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 100 place count 233 transition count 429
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 100 place count 233 transition count 429
Deduced a syphon composed of 102 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 118 place count 233 transition count 429
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 190 place count 161 transition count 357
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 262 place count 161 transition count 357
Performed 65 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 2 with 65 rules applied. Total rules applied 327 place count 161 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 329 place count 161 transition count 364
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 382 place count 108 transition count 250
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 3 with 53 rules applied. Total rules applied 435 place count 108 transition count 250
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 445 place count 108 transition count 240
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 451 place count 102 transition count 234
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 457 place count 102 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 458 place count 102 transition count 234
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 460 place count 100 transition count 232
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 462 place count 100 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 463 place count 100 transition count 234
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 463 rules in 98 ms. Remains 100 /235 variables (removed 135) and now considering 234/446 (removed 212) transitions.
[2024-05-21 22:56:55] [INFO ] Redundant transitions in 18 ms returned []
Running 233 sub problems to find dead transitions.
// Phase 1: matrix 234 rows 100 cols
[2024-05-21 22:56:55] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 22:56:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 2 ms to minimize.
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 2 ms to minimize.
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-21 22:56:58] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-21 22:56:59] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
[2024-05-21 22:57:00] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 19/29 constraints. Problems are: Problem set: 42 solved, 191 unsolved
[2024-05-21 22:57:00] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2024-05-21 22:57:00] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 2/31 constraints. Problems are: Problem set: 42 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/31 constraints. Problems are: Problem set: 42 solved, 191 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 TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (OVERLAPS) 233/333 variables, 100/131 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 1/132 constraints. Problems are: Problem set: 56 solved, 177 unsolved
[2024-05-21 22:57:04] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/133 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/133 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 1/334 variables, 1/134 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/134 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/334 variables, 0/134 constraints. Problems are: Problem set: 56 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 134 constraints, problems are : Problem set: 56 solved, 177 unsolved in 15251 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 100/100 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 56 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 50/100 variables, 10/10 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 22/32 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/32 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 233/333 variables, 100/132 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/133 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 177/310 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 0/310 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 1/334 variables, 1/311 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/311 constraints. Problems are: Problem set: 56 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/311 constraints. Problems are: Problem set: 56 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 311 constraints, problems are : Problem set: 56 solved, 177 unsolved in 16656 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 100/100 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 177/233 constraints, Known Traps: 22/22 constraints]
After SMT, in 32636ms problems are : Problem set: 56 solved, 177 unsolved
Search for dead transitions found 56 dead transitions in 32641ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/235 places, 178/446 transitions.
Graph (complete) has 468 edges and 100 vertex of which 51 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 51 /100 variables (removed 49) and now considering 178/178 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/235 places, 178/446 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32782 ms. Remains : 51/235 places, 178/446 transitions.
Built C files in :
/tmp/ltsmin12537989933150718064
[2024-05-21 22:57:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12537989933150718064
Running compilation step : cd /tmp/ltsmin12537989933150718064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1478 ms.
Running link step : cd /tmp/ltsmin12537989933150718064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12537989933150718064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7595711981798445298.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 446/446 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 22:57:43] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 22:57:43] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-21 22:57:43] [INFO ] Invariant cache hit.
[2024-05-21 22:57:43] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 22:57:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:57:51] [INFO ] Deduced a trap composed of 21 places in 352 ms of which 4 ms to minimize.
[2024-05-21 22:57:52] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 4 ms to minimize.
[2024-05-21 22:57:52] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 4 ms to minimize.
[2024-05-21 22:57:52] [INFO ] Deduced a trap composed of 53 places in 298 ms of which 4 ms to minimize.
[2024-05-21 22:57:52] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 4 ms to minimize.
[2024-05-21 22:57:53] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2024-05-21 22:57:53] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 4 ms to minimize.
[2024-05-21 22:57:54] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 4 ms to minimize.
[2024-05-21 22:57:54] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 4 ms to minimize.
[2024-05-21 22:57:54] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 4 ms to minimize.
[2024-05-21 22:57:54] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:57:55] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 3 ms to minimize.
[2024-05-21 22:57:55] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 3 ms to minimize.
[2024-05-21 22:57:55] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 4 ms to minimize.
[2024-05-21 22:57:56] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2024-05-21 22:57:56] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 4 ms to minimize.
[2024-05-21 22:57:56] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 6 ms to minimize.
[2024-05-21 22:57:56] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 3 ms to minimize.
[2024-05-21 22:57:57] [INFO ] Deduced a trap composed of 39 places in 288 ms of which 4 ms to minimize.
[2024-05-21 22:57:57] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:57:58] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 3 ms to minimize.
[2024-05-21 22:57:58] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:57:59] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 3 ms to minimize.
[2024-05-21 22:57:59] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 3 ms to minimize.
[2024-05-21 22:57:59] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 4 ms to minimize.
[2024-05-21 22:57:59] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 2 ms to minimize.
[2024-05-21 22:58:00] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 2 ms to minimize.
[2024-05-21 22:58:00] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 2 ms to minimize.
[2024-05-21 22:58:00] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 2 ms to minimize.
[2024-05-21 22:58:00] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 2 ms to minimize.
[2024-05-21 22:58:00] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-21 22:58:01] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-05-21 22:58:01] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-21 22:58:01] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-21 22:58:01] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-21 22:58:01] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-05-21 22:58:02] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 3 ms to minimize.
[2024-05-21 22:58:02] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-21 22:58:02] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2024-05-21 22:58:02] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:58:06] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 4 ms to minimize.
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 21 places in 274 ms of which 4 ms to minimize.
[2024-05-21 22:58:07] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 2 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 3 ms to minimize.
[2024-05-21 22:58:08] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 2 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 2 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2024-05-21 22:58:09] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 3 ms to minimize.
[2024-05-21 22:58:10] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
[2024-05-21 22:58:10] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
[2024-05-21 22:58:10] [INFO ] Deduced a trap composed of 15 places in 283 ms of which 3 ms to minimize.
[2024-05-21 22:58:11] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 3 ms to minimize.
[2024-05-21 22:58:11] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:58:20] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2024-05-21 22:58:20] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 3 ms to minimize.
[2024-05-21 22:58:20] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 4 ms to minimize.
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 4 ms to minimize.
[2024-05-21 22:58:21] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-21 22:58:22] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 3 ms to minimize.
[2024-05-21 22:58:22] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 3 ms to minimize.
[2024-05-21 22:58:22] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-21 22:58:22] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-05-21 22:58:23] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-21 22:58:23] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-21 22:58:23] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-05-21 22:58:23] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 3 ms to minimize.
[2024-05-21 22:58:24] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:58:27] [INFO ] Deduced a trap composed of 41 places in 271 ms of which 3 ms to minimize.
[2024-05-21 22:58:27] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 3 ms to minimize.
[2024-05-21 22:58:28] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 3 ms to minimize.
[2024-05-21 22:58:28] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 4 ms to minimize.
[2024-05-21 22:58:28] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 3 ms to minimize.
[2024-05-21 22:58:29] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 4 ms to minimize.
[2024-05-21 22:58:31] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:58:35] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 3 ms to minimize.
[2024-05-21 22:58:35] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2024-05-21 22:58:35] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 3 ms to minimize.
[2024-05-21 22:58:36] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 3 ms to minimize.
[2024-05-21 22:58:36] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 3 ms to minimize.
[2024-05-21 22:58:36] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:58:41] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 2 ms to minimize.
[2024-05-21 22:58:42] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 2 ms to minimize.
[2024-05-21 22:58:42] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 2 ms to minimize.
[2024-05-21 22:58:43] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61017ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61025ms
Finished structural reductions in LTL mode , in 1 iterations and 61503 ms. Remains : 235/235 places, 446/446 transitions.
Built C files in :
/tmp/ltsmin5526146239040870589
[2024-05-21 22:58:44] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5526146239040870589
Running compilation step : cd /tmp/ltsmin5526146239040870589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1766 ms.
Running link step : cd /tmp/ltsmin5526146239040870589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5526146239040870589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14801152697144645349.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:58:59] [INFO ] Flatten gal took : 41 ms
[2024-05-21 22:58:59] [INFO ] Flatten gal took : 42 ms
[2024-05-21 22:58:59] [INFO ] Time to serialize gal into /tmp/LTL6092352033292517078.gal : 8 ms
[2024-05-21 22:58:59] [INFO ] Time to serialize properties into /tmp/LTL9640001986945883872.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6092352033292517078.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12124934393603216126.hoa' '-atoms' '/tmp/LTL9640001986945883872.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9640001986945883872.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12124934393603216126.hoa
Detected timeout of ITS tools.
[2024-05-21 22:59:15] [INFO ] Flatten gal took : 47 ms
[2024-05-21 22:59:15] [INFO ] Flatten gal took : 42 ms
[2024-05-21 22:59:15] [INFO ] Time to serialize gal into /tmp/LTL892739198926562439.gal : 13 ms
[2024-05-21 22:59:15] [INFO ] Time to serialize properties into /tmp/LTL2046153015408926703.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL892739198926562439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2046153015408926703.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((p6==0)||(p18==0))||((p163==0)||(p246==0)))"))||(("(((p6==1)&&(p18==1))&&((p163==1)&&(p246==1)))")U("(((p6==1)&&(p9==1))&...186
Formula 0 simplified : XX(F!"(((p6==0)||(p18==0))||((p163==0)||(p246==0)))" & (!"(((p6==1)&&(p18==1))&&((p163==1)&&(p246==1)))" R !"(((p6==1)&&(p9==1))&&((...179
Detected timeout of ITS tools.
[2024-05-21 22:59:30] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:59:30] [INFO ] Applying decomposition
[2024-05-21 22:59:30] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16461448362532847822.txt' '-o' '/tmp/graph16461448362532847822.bin' '-w' '/tmp/graph16461448362532847822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16461448362532847822.bin' '-l' '-1' '-v' '-w' '/tmp/graph16461448362532847822.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:59:30] [INFO ] Decomposing Gal with order
[2024-05-21 22:59:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:59:30] [INFO ] Removed a total of 843 redundant transitions.
[2024-05-21 22:59:30] [INFO ] Flatten gal took : 169 ms
[2024-05-21 22:59:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 35 ms.
[2024-05-21 22:59:30] [INFO ] Time to serialize gal into /tmp/LTL7948536640157108988.gal : 13 ms
[2024-05-21 22:59:30] [INFO ] Time to serialize properties into /tmp/LTL732517359518366685.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7948536640157108988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL732517359518366685.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(((u1.p6==0)||(u1.p18==0))||((i10.i0.u48.p163==0)||(u1.p246==0)))"))||(("(((u1.p6==1)&&(u1.p18==1))&&((i10.i0.u48.p163==1)&...243
Formula 0 simplified : XX(F!"(((u1.p6==0)||(u1.p18==0))||((i10.i0.u48.p163==0)||(u1.p246==0)))" & (!"(((u1.p6==1)&&(u1.p18==1))&&((i10.i0.u48.p163==1)&&(u1...236
Reverse transition relation is NOT exact ! Due to transitions t224, t226, t228, t252, t276, t306, t342, t366, t447, i1.i1.t217, i1.i1.u11.t197, i1.i1.u18.t...805
Computing Next relation with stutter on 84736 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
622 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.28993,205816,1,0,477595,4651,4297,349274,476,31469,885860
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutonomousCar-PT-06b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutonomousCar-PT-06b-LTLFireability-06 finished in 289922 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)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 6 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
[2024-05-21 22:59:37] [INFO ] Invariant cache hit.
[2024-05-21 22:59:38] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 22:59:38] [INFO ] Invariant cache hit.
[2024-05-21 22:59:38] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 22:59:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:59:46] [INFO ] Deduced a trap composed of 21 places in 347 ms of which 7 ms to minimize.
[2024-05-21 22:59:47] [INFO ] Deduced a trap composed of 55 places in 337 ms of which 4 ms to minimize.
[2024-05-21 22:59:47] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 4 ms to minimize.
[2024-05-21 22:59:47] [INFO ] Deduced a trap composed of 53 places in 297 ms of which 3 ms to minimize.
[2024-05-21 22:59:48] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 4 ms to minimize.
[2024-05-21 22:59:48] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-21 22:59:48] [INFO ] Deduced a trap composed of 38 places in 310 ms of which 4 ms to minimize.
[2024-05-21 22:59:49] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 4 ms to minimize.
[2024-05-21 22:59:49] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 3 ms to minimize.
[2024-05-21 22:59:49] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 3 ms to minimize.
[2024-05-21 22:59:49] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 3 ms to minimize.
[2024-05-21 22:59:50] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 3 ms to minimize.
[2024-05-21 22:59:50] [INFO ] Deduced a trap composed of 33 places in 305 ms of which 3 ms to minimize.
[2024-05-21 22:59:50] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 4 ms to minimize.
[2024-05-21 22:59:51] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 4 ms to minimize.
[2024-05-21 22:59:51] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 3 ms to minimize.
[2024-05-21 22:59:51] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 4 ms to minimize.
[2024-05-21 22:59:52] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 4 ms to minimize.
[2024-05-21 22:59:52] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 4 ms to minimize.
[2024-05-21 22:59:52] [INFO ] Deduced a trap composed of 44 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:59:53] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 3 ms to minimize.
[2024-05-21 22:59:53] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 3 ms to minimize.
[2024-05-21 22:59:54] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 3 ms to minimize.
[2024-05-21 22:59:54] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 3 ms to minimize.
[2024-05-21 22:59:54] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 3 ms to minimize.
[2024-05-21 22:59:55] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 4 ms to minimize.
[2024-05-21 22:59:55] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2024-05-21 22:59:55] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 57 places in 322 ms of which 4 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-05-21 22:59:56] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-21 22:59:57] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 3 ms to minimize.
[2024-05-21 22:59:57] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2024-05-21 22:59:57] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 3 ms to minimize.
[2024-05-21 22:59:57] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 2 ms to minimize.
[2024-05-21 22:59:57] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-21 22:59:58] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 4 ms to minimize.
[2024-05-21 22:59:58] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2024-05-21 22:59:58] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 3 ms to minimize.
[2024-05-21 22:59:58] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:00:03] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 2 ms to minimize.
[2024-05-21 23:00:03] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:00:03] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 2 ms to minimize.
[2024-05-21 23:00:04] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:00:04] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:00:04] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 10 ms to minimize.
[2024-05-21 23:00:04] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:00:05] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:00:05] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:00:05] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:00:05] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:00:06] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 3 ms to minimize.
[2024-05-21 23:00:06] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-05-21 23:00:06] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:00:15] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 3 ms to minimize.
[2024-05-21 23:00:15] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 4 ms to minimize.
[2024-05-21 23:00:15] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:00:16] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 3 ms to minimize.
[2024-05-21 23:00:16] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 4 ms to minimize.
[2024-05-21 23:00:16] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:00:17] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:00:17] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 3 ms to minimize.
[2024-05-21 23:00:17] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:00:17] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:00:18] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:00:18] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:00:18] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:00:18] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2024-05-21 23:00:19] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:00:21] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:00:21] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:00:21] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:00:21] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:00:22] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:00:22] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:00:24] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:00:28] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 3 ms to minimize.
[2024-05-21 23:00:28] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 3 ms to minimize.
[2024-05-21 23:00:28] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 3 ms to minimize.
[2024-05-21 23:00:29] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-05-21 23:00:29] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 3 ms to minimize.
[2024-05-21 23:00:29] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:00:35] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 3 ms to minimize.
[2024-05-21 23:00:35] [INFO ] Deduced a trap composed of 52 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:00:35] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:00:36] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61102ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61106ms
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61592 ms. Remains : 235/239 places, 446/450 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-08 finished in 61721 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((F(p1)||p0))||G(p2))))'
Support contains 13 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 208 edges and 239 vertex of which 4 / 239 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 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 236 transition count 360
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 123 rules applied. Total rules applied 211 place count 149 transition count 324
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 232 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 232 place count 128 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 244 place count 122 transition count 318
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 118 transition count 314
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 118 transition count 314
Performed 44 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 340 place count 74 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 341 place count 74 transition count 268
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 348 place count 67 transition count 230
Iterating global reduction 4 with 7 rules applied. Total rules applied 355 place count 67 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 360 place count 67 transition count 225
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 364 place count 65 transition count 223
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 365 place count 65 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 366 place count 64 transition count 222
Applied a total of 366 rules in 68 ms. Remains 64 /239 variables (removed 175) and now considering 222/450 (removed 228) transitions.
// Phase 1: matrix 222 rows 64 cols
[2024-05-21 23:00:39] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:00:39] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 23:00:39] [INFO ] Invariant cache hit.
[2024-05-21 23:00:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants and state equation in 212 ms returned [59, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 307 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/239 places, 222/450 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 221
Applied a total of 2 rules in 12 ms. Remains 61 /62 variables (removed 1) and now considering 221/222 (removed 1) transitions.
// Phase 1: matrix 221 rows 61 cols
[2024-05-21 23:00:40] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:00:40] [INFO ] Invariant cache hit.
[2024-05-21 23:00:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:00:40] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/239 places, 221/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 673 ms. Remains : 61/239 places, 221/450 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-09
Product exploration explored 100000 steps with 93 reset in 241 ms.
Product exploration explored 100000 steps with 258 reset in 323 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 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 131 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1631 resets) in 1134 ms. (35 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (217 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (207 resets) in 377 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (224 resets) in 643 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (225 resets) in 468 ms. (85 steps per ms) remains 4/4 properties
[2024-05-21 23:00:42] [INFO ] Invariant cache hit.
[2024-05-21 23:00:42] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 215/271 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/280 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/282 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/282 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 70 constraints, problems are : Problem set: 0 solved, 4 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 56/282 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/61 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR (NOT p2) p0 p1)), (G (OR p2 (NOT p0) p1)), (G (OR p0 p1)), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 27 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-09 finished in 3108 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 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 225 edges and 239 vertex of which 4 / 239 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 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 236 transition count 359
Reduce places removed 88 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 124 rules applied. Total rules applied 213 place count 148 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 234 place count 127 transition count 323
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 234 place count 127 transition count 317
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 246 place count 121 transition count 317
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 250 place count 117 transition count 313
Iterating global reduction 3 with 4 rules applied. Total rules applied 254 place count 117 transition count 313
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 358 place count 65 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 359 place count 65 transition count 259
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 371 place count 53 transition count 187
Iterating global reduction 4 with 12 rules applied. Total rules applied 383 place count 53 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 389 place count 53 transition count 181
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 393 place count 51 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 395 place count 49 transition count 177
Applied a total of 395 rules in 66 ms. Remains 49 /239 variables (removed 190) and now considering 177/450 (removed 273) transitions.
// Phase 1: matrix 177 rows 49 cols
[2024-05-21 23:00:42] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:00:42] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 23:00:42] [INFO ] Invariant cache hit.
[2024-05-21 23:00:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:00:43] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [44, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 337 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/239 places, 177/450 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 46 transition count 176
Applied a total of 2 rules in 11 ms. Remains 46 /47 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 46 cols
[2024-05-21 23:00:43] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 23:00:43] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:00:43] [INFO ] Invariant cache hit.
[2024-05-21 23:00:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:00:43] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/239 places, 176/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 722 ms. Remains : 46/239 places, 176/450 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-10
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-10 finished in 790 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((p0||F(p1))))'
Support contains 8 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 236 transition count 447
Applied a total of 6 rules in 10 ms. Remains 236 /239 variables (removed 3) and now considering 447/450 (removed 3) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 23:00:43] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 23:00:43] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:00:43] [INFO ] Invariant cache hit.
[2024-05-21 23:00:44] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 23:00:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:00:52] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 4 ms to minimize.
[2024-05-21 23:00:52] [INFO ] Deduced a trap composed of 55 places in 340 ms of which 4 ms to minimize.
[2024-05-21 23:00:53] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 3 ms to minimize.
[2024-05-21 23:00:53] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 4 ms to minimize.
[2024-05-21 23:00:53] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 3 ms to minimize.
[2024-05-21 23:00:53] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 3 ms to minimize.
[2024-05-21 23:00:54] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 3 ms to minimize.
[2024-05-21 23:00:54] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 4 ms to minimize.
[2024-05-21 23:00:54] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 3 ms to minimize.
[2024-05-21 23:00:55] [INFO ] Deduced a trap composed of 38 places in 350 ms of which 4 ms to minimize.
[2024-05-21 23:00:55] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:00:55] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 4 ms to minimize.
[2024-05-21 23:00:56] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 4 ms to minimize.
[2024-05-21 23:00:56] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 3 ms to minimize.
[2024-05-21 23:00:56] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 3 ms to minimize.
[2024-05-21 23:00:57] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 4 ms to minimize.
[2024-05-21 23:00:57] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 4 ms to minimize.
[2024-05-21 23:00:57] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-05-21 23:00:58] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 4 ms to minimize.
[2024-05-21 23:00:58] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:00:59] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 4 ms to minimize.
[2024-05-21 23:00:59] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 4 ms to minimize.
[2024-05-21 23:00:59] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 4 ms to minimize.
[2024-05-21 23:00:59] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 4 ms to minimize.
[2024-05-21 23:01:00] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 4 ms to minimize.
[2024-05-21 23:01:00] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 3 ms to minimize.
[2024-05-21 23:01:00] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 4 ms to minimize.
[2024-05-21 23:01:01] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 4 ms to minimize.
[2024-05-21 23:01:01] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:01:01] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 4 ms to minimize.
[2024-05-21 23:01:01] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 4 ms to minimize.
[2024-05-21 23:01:02] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 4 ms to minimize.
[2024-05-21 23:01:02] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 4 ms to minimize.
[2024-05-21 23:01:02] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 3 ms to minimize.
[2024-05-21 23:01:03] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 4 ms to minimize.
[2024-05-21 23:01:03] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-05-21 23:01:03] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-05-21 23:01:03] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 3 ms to minimize.
[2024-05-21 23:01:04] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 4 ms to minimize.
[2024-05-21 23:01:04] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:01:09] [INFO ] Deduced a trap composed of 36 places in 285 ms of which 4 ms to minimize.
[2024-05-21 23:01:09] [INFO ] Deduced a trap composed of 41 places in 311 ms of which 4 ms to minimize.
[2024-05-21 23:01:09] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 3 ms to minimize.
[2024-05-21 23:01:10] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:01:10] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:01:10] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:01:10] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:01:11] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 4 ms to minimize.
[2024-05-21 23:01:11] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:01:11] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:01:11] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:01:11] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 4 ms to minimize.
[2024-05-21 23:01:12] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 3 ms to minimize.
[2024-05-21 23:01:12] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 2 ms to minimize.
[2024-05-21 23:01:12] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2024-05-21 23:01:12] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:01:13] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:01:13] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:01:13] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 3 ms to minimize.
[2024-05-21 23:01:14] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/683 variables, and 71 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:01:18] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:01:19] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:01:19] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:01:19] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:01:19] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:01:19] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:01:20] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 2 ms to minimize.
[2024-05-21 23:01:21] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:01:22] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 2 ms to minimize.
[2024-05-21 23:01:22] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:01:23] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:01:23] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:01:23] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:01:23] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:01:23] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:01:24] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:01:24] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:01:24] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:01:24] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:01:24] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:01:28] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:01:28] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 7 (OVERLAPS) 447/683 variables, 236/329 constraints. Problems are: Problem set: 2 solved, 444 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 444/773 constraints. Problems are: Problem set: 2 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/683 variables, and 773 constraints, problems are : Problem set: 2 solved, 444 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 444/446 constraints, Known Traps: 82/82 constraints]
After SMT, in 60853ms problems are : Problem set: 2 solved, 444 unsolved
Search for dead transitions found 2 dead transitions in 60858ms
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 : 236/239 places, 445/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 445
Applied a total of 1 rules in 10 ms. Remains 235 /236 variables (removed 1) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 235 cols
[2024-05-21 23:01:44] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 23:01:45] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 23:01:45] [INFO ] Invariant cache hit.
[2024-05-21 23:01:45] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 235/239 places, 445/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62040 ms. Remains : 235/239 places, 445/450 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 388 ms.
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-06b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-06b-LTLFireability-11 finished in 63026 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&&F(((X(!p1)&&F(p2))||G(!p1)))))))'
Support contains 6 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 236 transition count 447
Applied a total of 6 rules in 6 ms. Remains 236 /239 variables (removed 3) and now considering 447/450 (removed 3) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 23:01:46] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 23:01:46] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 23:01:46] [INFO ] Invariant cache hit.
[2024-05-21 23:01:47] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 23:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:01:55] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 4 ms to minimize.
[2024-05-21 23:01:55] [INFO ] Deduced a trap composed of 51 places in 337 ms of which 4 ms to minimize.
[2024-05-21 23:01:56] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 4 ms to minimize.
[2024-05-21 23:01:56] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 4 ms to minimize.
[2024-05-21 23:01:56] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 4 ms to minimize.
[2024-05-21 23:01:57] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2024-05-21 23:01:57] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 3 ms to minimize.
[2024-05-21 23:01:57] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 4 ms to minimize.
[2024-05-21 23:01:58] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 4 ms to minimize.
[2024-05-21 23:01:58] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 3 ms to minimize.
[2024-05-21 23:01:58] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 4 ms to minimize.
[2024-05-21 23:01:58] [INFO ] Deduced a trap composed of 50 places in 270 ms of which 4 ms to minimize.
[2024-05-21 23:01:59] [INFO ] Deduced a trap composed of 61 places in 265 ms of which 4 ms to minimize.
[2024-05-21 23:01:59] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 3 ms to minimize.
[2024-05-21 23:01:59] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 3 ms to minimize.
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 3 ms to minimize.
[2024-05-21 23:02:00] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 3 ms to minimize.
[2024-05-21 23:02:01] [INFO ] Deduced a trap composed of 59 places in 302 ms of which 4 ms to minimize.
[2024-05-21 23:02:01] [INFO ] Deduced a trap composed of 63 places in 299 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:02:02] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 3 ms to minimize.
[2024-05-21 23:02:02] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 3 ms to minimize.
[2024-05-21 23:02:02] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 5 ms to minimize.
[2024-05-21 23:02:03] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 4 ms to minimize.
[2024-05-21 23:02:03] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 4 ms to minimize.
[2024-05-21 23:02:03] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 4 ms to minimize.
[2024-05-21 23:02:04] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 3 ms to minimize.
[2024-05-21 23:02:04] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 4 ms to minimize.
[2024-05-21 23:02:04] [INFO ] Deduced a trap composed of 43 places in 268 ms of which 3 ms to minimize.
[2024-05-21 23:02:04] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 4 ms to minimize.
[2024-05-21 23:02:05] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
[2024-05-21 23:02:05] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 3 ms to minimize.
[2024-05-21 23:02:05] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 4 ms to minimize.
[2024-05-21 23:02:06] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-05-21 23:02:06] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:02:06] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 2 ms to minimize.
[2024-05-21 23:02:06] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:02:07] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:02:10] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 3 ms to minimize.
[2024-05-21 23:02:11] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 4 ms to minimize.
[2024-05-21 23:02:11] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 4 ms to minimize.
[2024-05-21 23:02:12] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-05-21 23:02:12] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:02:12] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:02:12] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:02:13] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
[2024-05-21 23:02:13] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-05-21 23:02:13] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 4 ms to minimize.
[2024-05-21 23:02:13] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 2 ms to minimize.
[2024-05-21 23:02:14] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:02:14] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:02:14] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 4 ms to minimize.
[2024-05-21 23:02:14] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:02:15] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:02:15] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:02:15] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:02:15] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:02:16] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:02:17] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 4 ms to minimize.
[2024-05-21 23:02:17] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/683 variables, and 73 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:02:24] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-21 23:02:24] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:02:24] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:02:25] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:02:25] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:02:25] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 4 ms to minimize.
[2024-05-21 23:02:26] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 4 ms to minimize.
[2024-05-21 23:02:26] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 4 ms to minimize.
[2024-05-21 23:02:26] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:02:26] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 3 ms to minimize.
[2024-05-21 23:02:27] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 11/84 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:02:32] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 23:02:36] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 7 (OVERLAPS) 447/683 variables, 236/322 constraints. Problems are: Problem set: 2 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/683 variables, and 766 constraints, problems are : Problem set: 2 solved, 444 unsolved in 30135 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 444/446 constraints, Known Traps: 75/75 constraints]
After SMT, in 61213ms problems are : Problem set: 2 solved, 444 unsolved
Search for dead transitions found 2 dead transitions in 61222ms
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 : 236/239 places, 445/450 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 445
Applied a total of 1 rules in 7 ms. Remains 235 /236 variables (removed 1) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 235 cols
[2024-05-21 23:02:48] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 23:02:48] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-21 23:02:48] [INFO ] Invariant cache hit.
[2024-05-21 23:02:48] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 235/239 places, 445/450 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62380 ms. Remains : 235/239 places, 445/450 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-12 finished in 62661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 226 edges and 239 vertex of which 4 / 239 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 236 transition count 361
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 122 rules applied. Total rules applied 209 place count 150 transition count 325
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 231 place count 129 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 128 transition count 324
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 232 place count 128 transition count 316
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 248 place count 120 transition count 316
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 252 place count 116 transition count 312
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 place count 116 transition count 312
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 356 place count 66 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 66 transition count 260
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 370 place count 53 transition count 181
Iterating global reduction 5 with 13 rules applied. Total rules applied 383 place count 53 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 389 place count 53 transition count 175
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 393 place count 51 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 395 place count 49 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 396 place count 48 transition count 171
Applied a total of 396 rules in 65 ms. Remains 48 /239 variables (removed 191) and now considering 171/450 (removed 279) transitions.
// Phase 1: matrix 171 rows 48 cols
[2024-05-21 23:02:49] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 23:02:49] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 23:02:49] [INFO ] Invariant cache hit.
[2024-05-21 23:02:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:02:49] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 305 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/239 places, 171/450 transitions.
Applied a total of 0 rules in 7 ms. Remains 47 /47 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 378 ms. Remains : 47/239 places, 171/450 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-13
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-13 finished in 494 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 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 235 transition count 446
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 235 transition count 446
Applied a total of 8 rules in 9 ms. Remains 235 /239 variables (removed 4) and now considering 446/450 (removed 4) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 23:02:49] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 23:02:49] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 23:02:49] [INFO ] Invariant cache hit.
[2024-05-21 23:02:50] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 23:02:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:02:58] [INFO ] Deduced a trap composed of 21 places in 330 ms of which 5 ms to minimize.
[2024-05-21 23:02:58] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 4 ms to minimize.
[2024-05-21 23:02:59] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 4 ms to minimize.
[2024-05-21 23:02:59] [INFO ] Deduced a trap composed of 53 places in 293 ms of which 3 ms to minimize.
[2024-05-21 23:02:59] [INFO ] Deduced a trap composed of 43 places in 303 ms of which 4 ms to minimize.
[2024-05-21 23:03:00] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:03:00] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 4 ms to minimize.
[2024-05-21 23:03:01] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 3 ms to minimize.
[2024-05-21 23:03:01] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 4 ms to minimize.
[2024-05-21 23:03:01] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 4 ms to minimize.
[2024-05-21 23:03:01] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 3 ms to minimize.
[2024-05-21 23:03:02] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 4 ms to minimize.
[2024-05-21 23:03:02] [INFO ] Deduced a trap composed of 33 places in 302 ms of which 3 ms to minimize.
[2024-05-21 23:03:02] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 4 ms to minimize.
[2024-05-21 23:03:03] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 4 ms to minimize.
[2024-05-21 23:03:03] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 3 ms to minimize.
[2024-05-21 23:03:03] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 3 ms to minimize.
[2024-05-21 23:03:04] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 4 ms to minimize.
[2024-05-21 23:03:04] [INFO ] Deduced a trap composed of 39 places in 292 ms of which 3 ms to minimize.
[2024-05-21 23:03:04] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:03:05] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 3 ms to minimize.
[2024-05-21 23:03:05] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 4 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 3 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 3 ms to minimize.
[2024-05-21 23:03:07] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 3 ms to minimize.
[2024-05-21 23:03:07] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 3 ms to minimize.
[2024-05-21 23:03:07] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-05-21 23:03:07] [INFO ] Deduced a trap composed of 57 places in 314 ms of which 3 ms to minimize.
[2024-05-21 23:03:08] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
[2024-05-21 23:03:08] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:03:08] [INFO ] Deduced a trap composed of 40 places in 241 ms of which 4 ms to minimize.
[2024-05-21 23:03:09] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-21 23:03:09] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:03:09] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 3 ms to minimize.
[2024-05-21 23:03:09] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:03:10] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 4 ms to minimize.
[2024-05-21 23:03:10] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-05-21 23:03:10] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:03:10] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:03:15] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 4 ms to minimize.
[2024-05-21 23:03:15] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 3 ms to minimize.
[2024-05-21 23:03:16] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 4 ms to minimize.
[2024-05-21 23:03:16] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 2 ms to minimize.
[2024-05-21 23:03:17] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 3 ms to minimize.
[2024-05-21 23:03:17] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:03:17] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:03:18] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:03:18] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:03:18] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:03:18] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:03:19] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 3 ms to minimize.
[2024-05-21 23:03:19] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 4 ms to minimize.
[2024-05-21 23:03:19] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:03:26] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 4 ms to minimize.
[2024-05-21 23:03:27] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 3 ms to minimize.
[2024-05-21 23:03:27] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:03:27] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 4 ms to minimize.
[2024-05-21 23:03:28] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2024-05-21 23:03:28] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:03:28] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2024-05-21 23:03:28] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 3 ms to minimize.
[2024-05-21 23:03:29] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 3 ms to minimize.
[2024-05-21 23:03:29] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:03:29] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:03:29] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:03:30] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:03:30] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 4 ms to minimize.
[2024-05-21 23:03:30] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:03:34] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 3 ms to minimize.
[2024-05-21 23:03:34] [INFO ] Deduced a trap composed of 35 places in 284 ms of which 3 ms to minimize.
[2024-05-21 23:03:34] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 4 ms to minimize.
[2024-05-21 23:03:35] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 3 ms to minimize.
[2024-05-21 23:03:35] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 4 ms to minimize.
[2024-05-21 23:03:35] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 3 ms to minimize.
[2024-05-21 23:03:37] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:03:41] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
[2024-05-21 23:03:41] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 3 ms to minimize.
[2024-05-21 23:03:42] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 3 ms to minimize.
[2024-05-21 23:03:42] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 3 ms to minimize.
[2024-05-21 23:03:43] [INFO ] Deduced a trap composed of 51 places in 261 ms of which 4 ms to minimize.
[2024-05-21 23:03:43] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 23:03:48] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 2 ms to minimize.
[2024-05-21 23:03:49] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:03:49] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:03:50] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 60880ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 60885ms
Starting structural reductions in LTL mode, iteration 1 : 235/239 places, 446/450 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61387 ms. Remains : 235/239 places, 446/450 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06b-LTLFireability-14 finished in 61622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&G(F(p1))))))'
Support contains 5 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 450/450 transitions.
Graph (trivial) has 220 edges and 239 vertex of which 4 / 239 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 236 transition count 361
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 122 rules applied. Total rules applied 209 place count 150 transition count 325
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 230 place count 129 transition count 325
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 230 place count 129 transition count 318
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 244 place count 122 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 119 transition count 315
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 119 transition count 315
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 350 place count 69 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 69 transition count 263
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 362 place count 58 transition count 198
Iterating global reduction 4 with 11 rules applied. Total rules applied 373 place count 58 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 379 place count 58 transition count 192
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 383 place count 56 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 55 transition count 189
Applied a total of 384 rules in 56 ms. Remains 55 /239 variables (removed 184) and now considering 189/450 (removed 261) transitions.
// Phase 1: matrix 189 rows 55 cols
[2024-05-21 23:03:51] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:03:51] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 23:03:51] [INFO ] Invariant cache hit.
[2024-05-21 23:03:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:03:51] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [50, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 339 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/239 places, 189/450 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 52 transition count 188
Applied a total of 2 rules in 11 ms. Remains 52 /53 variables (removed 1) and now considering 188/189 (removed 1) transitions.
// Phase 1: matrix 188 rows 52 cols
[2024-05-21 23:03:51] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 23:03:51] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 23:03:51] [INFO ] Invariant cache hit.
[2024-05-21 23:03:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:03:52] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/239 places, 188/450 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 715 ms. Remains : 52/239 places, 188/450 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 4 reset in 88 ms.
Product exploration explored 100000 steps with 28 reset in 102 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 7417 steps (363 resets) in 49 ms. (148 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 311 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 188/188 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-21 23:03:53] [INFO ] Invariant cache hit.
[2024-05-21 23:03:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:03:53] [INFO ] Invariant cache hit.
[2024-05-21 23:03:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:03:53] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-21 23:03:53] [INFO ] Redundant transitions in 16 ms returned [101]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 184 sub problems to find dead transitions.
// Phase 1: matrix 187 rows 52 cols
[2024-05-21 23:03:53] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 23:03:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 186/237 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-21 23:03:56] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 1/238 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 1/239 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 62 constraints, problems are : Problem set: 0 solved, 184 unsolved in 10338 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 186/237 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 184/244 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 1/239 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/239 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 246 constraints, problems are : Problem set: 0 solved, 184 unsolved in 21925 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 1/1 constraints]
After SMT, in 32709ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 32712ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/52 places, 187/188 transitions.
Reduce places removed 1 places and 1 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 50 transition count 185
Applied a total of 2 rules in 7 ms. Remains 50 /52 variables (removed 2) and now considering 185/187 (removed 2) transitions.
// Phase 1: matrix 185 rows 50 cols
[2024-05-21 23:04:26] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 23:04:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:04:26] [INFO ] Invariant cache hit.
[2024-05-21 23:04:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:04:26] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/52 places, 185/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33191 ms. Remains : 50/52 places, 185/188 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 9383 steps (459 resets) in 51 ms. (180 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 341 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 125 reset in 98 ms.
Product exploration explored 100000 steps with 21 reset in 110 ms.
Built C files in :
/tmp/ltsmin3074962805524595331
[2024-05-21 23:04:27] [INFO ] Computing symmetric may disable matrix : 185 transitions.
[2024-05-21 23:04:27] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:04:27] [INFO ] Computing symmetric may enable matrix : 185 transitions.
[2024-05-21 23:04:27] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:04:27] [INFO ] Computing Do-Not-Accords matrix : 185 transitions.
[2024-05-21 23:04:27] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:04:27] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3074962805524595331
Running compilation step : cd /tmp/ltsmin3074962805524595331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1271 ms.
Running link step : cd /tmp/ltsmin3074962805524595331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3074962805524595331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9984239481372328843.hoa' '--buchi-type=spotba'
LTSmin run took 10454 ms.
FORMULA AutonomousCar-PT-06b-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-06b-LTLFireability-15 finished in 47945 ms.
All properties solved by simple procedures.
Total runtime 756993 ms.

BK_STOP 1716332679357

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;