About the Execution of GreatSPN+red for AutonomousCar-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6998.615 | 1030729.00 | 1136868.00 | 3232.40 | FFFFTFF?FFTFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166400324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 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 334K 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-07b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716351692024
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:21:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 04:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:21:35] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2024-05-22 04:21:35] [INFO ] Transformed 323 places.
[2024-05-22 04:21:35] [INFO ] Transformed 846 transitions.
[2024-05-22 04:21:35] [INFO ] Found NUPN structural information;
[2024-05-22 04:21:35] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 604 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutonomousCar-PT-07b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 846/846 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 276 transition count 799
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 276 transition count 799
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 290 place count 276 transition count 603
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 299 place count 267 transition count 594
Iterating global reduction 1 with 9 rules applied. Total rules applied 308 place count 267 transition count 594
Applied a total of 308 rules in 199 ms. Remains 267 /323 variables (removed 56) and now considering 594/846 (removed 252) transitions.
// Phase 1: matrix 594 rows 267 cols
[2024-05-22 04:21:35] [INFO ] Computed 12 invariants in 53 ms
[2024-05-22 04:21:36] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-22 04:21:36] [INFO ] Invariant cache hit.
[2024-05-22 04:21:37] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Running 593 sub problems to find dead transitions.
[2024-05-22 04:21:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:21:52] [INFO ] Deduced a trap composed of 17 places in 539 ms of which 67 ms to minimize.
[2024-05-22 04:21:53] [INFO ] Deduced a trap composed of 77 places in 514 ms of which 6 ms to minimize.
[2024-05-22 04:21:53] [INFO ] Deduced a trap composed of 41 places in 424 ms of which 5 ms to minimize.
[2024-05-22 04:21:54] [INFO ] Deduced a trap composed of 21 places in 390 ms of which 5 ms to minimize.
[2024-05-22 04:21:54] [INFO ] Deduced a trap composed of 35 places in 356 ms of which 4 ms to minimize.
[2024-05-22 04:21:54] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 4 ms to minimize.
[2024-05-22 04:21:55] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 4 ms to minimize.
[2024-05-22 04:21:55] [INFO ] Deduced a trap composed of 46 places in 339 ms of which 3 ms to minimize.
[2024-05-22 04:21:55] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 4 ms to minimize.
[2024-05-22 04:21:56] [INFO ] Deduced a trap composed of 48 places in 376 ms of which 4 ms to minimize.
[2024-05-22 04:21:56] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 4 ms to minimize.
[2024-05-22 04:21:57] [INFO ] Deduced a trap composed of 47 places in 436 ms of which 5 ms to minimize.
[2024-05-22 04:21:57] [INFO ] Deduced a trap composed of 49 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:21:57] [INFO ] Deduced a trap composed of 46 places in 401 ms of which 4 ms to minimize.
[2024-05-22 04:21:58] [INFO ] Deduced a trap composed of 46 places in 364 ms of which 4 ms to minimize.
[2024-05-22 04:21:58] [INFO ] Deduced a trap composed of 46 places in 366 ms of which 4 ms to minimize.
[2024-05-22 04:21:59] [INFO ] Deduced a trap composed of 39 places in 446 ms of which 4 ms to minimize.
[2024-05-22 04:21:59] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 4 ms to minimize.
[2024-05-22 04:21:59] [INFO ] Deduced a trap composed of 43 places in 398 ms of which 5 ms to minimize.
[2024-05-22 04:22:00] [INFO ] Deduced a trap composed of 21 places in 440 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 593 unsolved
[2024-05-22 04:22:01] [INFO ] Deduced a trap composed of 49 places in 406 ms of which 4 ms to minimize.
[2024-05-22 04:22:02] [INFO ] Deduced a trap composed of 14 places in 459 ms of which 4 ms to minimize.
[2024-05-22 04:22:02] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 4 ms to minimize.
[2024-05-22 04:22:03] [INFO ] Deduced a trap composed of 63 places in 498 ms of which 4 ms to minimize.
[2024-05-22 04:22:03] [INFO ] Deduced a trap composed of 24 places in 453 ms of which 5 ms to minimize.
[2024-05-22 04:22:04] [INFO ] Deduced a trap composed of 41 places in 440 ms of which 4 ms to minimize.
[2024-05-22 04:22:04] [INFO ] Deduced a trap composed of 43 places in 416 ms of which 4 ms to minimize.
[2024-05-22 04:22:04] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 4 ms to minimize.
[2024-05-22 04:22:05] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 4 ms to minimize.
[2024-05-22 04:22:05] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 4 ms to minimize.
[2024-05-22 04:22:06] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 4 ms to minimize.
[2024-05-22 04:22:06] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 4 ms to minimize.
[2024-05-22 04:22:06] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 3 ms to minimize.
[2024-05-22 04:22:07] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 5 ms to minimize.
[2024-05-22 04:22:08] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 5 ms to minimize.
[2024-05-22 04:22:08] [INFO ] Deduced a trap composed of 42 places in 382 ms of which 5 ms to minimize.
[2024-05-22 04:22:08] [INFO ] Deduced a trap composed of 38 places in 372 ms of which 4 ms to minimize.
[2024-05-22 04:22:09] [INFO ] Deduced a trap composed of 48 places in 414 ms of which 4 ms to minimize.
[2024-05-22 04:22:10] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:22:10] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 5 ms to minimize.
SMT process timed out in 33480ms, After SMT, problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 33551ms
Starting structural reductions in LTL mode, iteration 1 : 267/323 places, 594/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35095 ms. Remains : 267/323 places, 594/846 transitions.
Support contains 36 out of 267 places after structural reductions.
[2024-05-22 04:22:11] [INFO ] Flatten gal took : 228 ms
[2024-05-22 04:22:11] [INFO ] Flatten gal took : 130 ms
[2024-05-22 04:22:11] [INFO ] Input system was already deterministic with 594 transitions.
RANDOM walk for 40000 steps (323 resets) in 2828 ms. (14 steps per ms) remains 10/19 properties
BEST_FIRST walk for 40004 steps (88 resets) in 238 ms. (167 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40002 steps (65 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (65 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (61 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (63 resets) in 96 ms. (412 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (65 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (64 resets) in 146 ms. (272 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (83 resets) in 165 ms. (240 steps per ms) remains 5/6 properties
[2024-05-22 04:22:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 240/258 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/267 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 594/861 variables, 267/279 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/861 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/861 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 279 constraints, problems are : Problem set: 1 solved, 4 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 147/155 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 112/267 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 594/861 variables, 267/279 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/861 variables, 4/283 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 04:22:14] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/861 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/861 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 284 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2069 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 2754ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2199 ms.
Support contains 8 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 246 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 7 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 1086 edges and 265 vertex of which 263 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 263 transition count 494
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 137 rules applied. Total rules applied 235 place count 168 transition count 452
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 260 place count 143 transition count 452
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 260 place count 143 transition count 445
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 274 place count 136 transition count 445
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 275 place count 135 transition count 444
Iterating global reduction 3 with 1 rules applied. Total rules applied 276 place count 135 transition count 444
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 396 place count 75 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 397 place count 75 transition count 383
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 409 place count 63 transition count 300
Iterating global reduction 4 with 12 rules applied. Total rules applied 421 place count 63 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 427 place count 63 transition count 294
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 429 place count 62 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 62 transition count 292
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 440 place count 62 transition count 282
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 450 place count 52 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 452 place count 52 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 453 place count 51 transition count 281
Applied a total of 453 rules in 297 ms. Remains 51 /267 variables (removed 216) and now considering 281/594 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 51/267 places, 281/594 transitions.
RANDOM walk for 40000 steps (523 resets) in 720 ms. (55 steps per ms) remains 0/4 properties
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 44 stabilizing places and 45 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' '!(F(X((F(G((!X(p0) U p1)))||G((G(p0)||p1))))))'
Support contains 12 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 591
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 263 transition count 590
Applied a total of 8 rules in 30 ms. Remains 263 /267 variables (removed 4) and now considering 590/594 (removed 4) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-22 04:22:19] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 04:22:19] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 04:22:19] [INFO ] Invariant cache hit.
[2024-05-22 04:22:19] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-22 04:22:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:22:33] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 4 ms to minimize.
[2024-05-22 04:22:34] [INFO ] Deduced a trap composed of 35 places in 436 ms of which 4 ms to minimize.
[2024-05-22 04:22:34] [INFO ] Deduced a trap composed of 37 places in 380 ms of which 3 ms to minimize.
[2024-05-22 04:22:35] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 4 ms to minimize.
[2024-05-22 04:22:36] [INFO ] Deduced a trap composed of 25 places in 480 ms of which 5 ms to minimize.
[2024-05-22 04:22:36] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 4 ms to minimize.
[2024-05-22 04:22:37] [INFO ] Deduced a trap composed of 36 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:22:37] [INFO ] Deduced a trap composed of 35 places in 467 ms of which 4 ms to minimize.
[2024-05-22 04:22:38] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 4 ms to minimize.
[2024-05-22 04:22:38] [INFO ] Deduced a trap composed of 42 places in 454 ms of which 5 ms to minimize.
[2024-05-22 04:22:38] [INFO ] Deduced a trap composed of 36 places in 442 ms of which 4 ms to minimize.
[2024-05-22 04:22:39] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 4 ms to minimize.
[2024-05-22 04:22:39] [INFO ] Deduced a trap composed of 49 places in 448 ms of which 4 ms to minimize.
[2024-05-22 04:22:40] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:22:40] [INFO ] Deduced a trap composed of 24 places in 449 ms of which 5 ms to minimize.
[2024-05-22 04:22:41] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 5 ms to minimize.
[2024-05-22 04:22:42] [INFO ] Deduced a trap composed of 41 places in 395 ms of which 3 ms to minimize.
[2024-05-22 04:22:42] [INFO ] Deduced a trap composed of 42 places in 314 ms of which 3 ms to minimize.
[2024-05-22 04:22:42] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 3 ms to minimize.
[2024-05-22 04:22:43] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:22:44] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-22 04:22:45] [INFO ] Deduced a trap composed of 24 places in 464 ms of which 5 ms to minimize.
[2024-05-22 04:22:45] [INFO ] Deduced a trap composed of 75 places in 437 ms of which 5 ms to minimize.
[2024-05-22 04:22:46] [INFO ] Deduced a trap composed of 43 places in 370 ms of which 4 ms to minimize.
[2024-05-22 04:22:46] [INFO ] Deduced a trap composed of 59 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:22:47] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 4 ms to minimize.
[2024-05-22 04:22:47] [INFO ] Deduced a trap composed of 31 places in 434 ms of which 4 ms to minimize.
[2024-05-22 04:22:48] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 4 ms to minimize.
[2024-05-22 04:22:48] [INFO ] Deduced a trap composed of 42 places in 424 ms of which 4 ms to minimize.
[2024-05-22 04:22:48] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 4 ms to minimize.
[2024-05-22 04:22:49] [INFO ] Deduced a trap composed of 38 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:22:49] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 3 ms to minimize.
[2024-05-22 04:22:50] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 4 ms to minimize.
[2024-05-22 04:22:50] [INFO ] Deduced a trap composed of 44 places in 438 ms of which 4 ms to minimize.
[2024-05-22 04:22:51] [INFO ] Deduced a trap composed of 40 places in 459 ms of which 4 ms to minimize.
[2024-05-22 04:22:51] [INFO ] Deduced a trap composed of 45 places in 415 ms of which 4 ms to minimize.
[2024-05-22 04:22:52] [INFO ] Deduced a trap composed of 46 places in 397 ms of which 4 ms to minimize.
[2024-05-22 04:22:52] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 5 ms to minimize.
[2024-05-22 04:22:52] [INFO ] Deduced a trap composed of 44 places in 394 ms of which 4 ms to minimize.
SMT process timed out in 33045ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 33060ms
Starting structural reductions in LTL mode, iteration 1 : 263/267 places, 590/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33856 ms. Remains : 263/267 places, 590/594 transitions.
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-00
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 8 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-00 finished in 34365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 249 edges and 267 vertex of which 4 / 267 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 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 264 transition count 495
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 138 rules applied. Total rules applied 235 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 260 place count 143 transition count 453
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 260 place count 143 transition count 446
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 274 place count 136 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 275 place count 135 transition count 445
Iterating global reduction 3 with 1 rules applied. Total rules applied 276 place count 135 transition count 445
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 394 place count 76 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 76 transition count 384
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 408 place count 63 transition count 293
Iterating global reduction 4 with 13 rules applied. Total rules applied 421 place count 63 transition count 293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 427 place count 63 transition count 287
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 431 place count 61 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 433 place count 59 transition count 283
Applied a total of 433 rules in 237 ms. Remains 59 /267 variables (removed 208) and now considering 283/594 (removed 311) transitions.
// Phase 1: matrix 283 rows 59 cols
[2024-05-22 04:22:53] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 04:22:53] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 04:22:53] [INFO ] Invariant cache hit.
[2024-05-22 04:22:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:22:53] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [54, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 391 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/267 places, 283/594 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 56 transition count 282
Applied a total of 2 rules in 24 ms. Remains 56 /57 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 56 cols
[2024-05-22 04:22:53] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 04:22:54] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 04:22:54] [INFO ] Invariant cache hit.
[2024-05-22 04:22:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:22:54] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/267 places, 282/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1035 ms. Remains : 56/267 places, 282/594 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-01
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-01 finished in 1311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1)))))'
Support contains 5 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 265 transition count 592
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 265 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 264 transition count 591
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 264 transition count 591
Applied a total of 6 rules in 34 ms. Remains 264 /267 variables (removed 3) and now considering 591/594 (removed 3) transitions.
// Phase 1: matrix 591 rows 264 cols
[2024-05-22 04:22:54] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 04:22:54] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 04:22:54] [INFO ] Invariant cache hit.
[2024-05-22 04:22:55] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Running 590 sub problems to find dead transitions.
[2024-05-22 04:22:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:23:07] [INFO ] Deduced a trap composed of 23 places in 480 ms of which 4 ms to minimize.
[2024-05-22 04:23:08] [INFO ] Deduced a trap composed of 14 places in 495 ms of which 4 ms to minimize.
[2024-05-22 04:23:08] [INFO ] Deduced a trap composed of 49 places in 439 ms of which 4 ms to minimize.
[2024-05-22 04:23:09] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-22 04:23:09] [INFO ] Deduced a trap composed of 25 places in 459 ms of which 4 ms to minimize.
[2024-05-22 04:23:10] [INFO ] Deduced a trap composed of 33 places in 448 ms of which 6 ms to minimize.
[2024-05-22 04:23:10] [INFO ] Deduced a trap composed of 38 places in 423 ms of which 4 ms to minimize.
[2024-05-22 04:23:11] [INFO ] Deduced a trap composed of 36 places in 437 ms of which 5 ms to minimize.
[2024-05-22 04:23:11] [INFO ] Deduced a trap composed of 33 places in 422 ms of which 4 ms to minimize.
[2024-05-22 04:23:12] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 4 ms to minimize.
[2024-05-22 04:23:12] [INFO ] Deduced a trap composed of 46 places in 374 ms of which 4 ms to minimize.
[2024-05-22 04:23:12] [INFO ] Deduced a trap composed of 49 places in 407 ms of which 4 ms to minimize.
[2024-05-22 04:23:13] [INFO ] Deduced a trap composed of 45 places in 410 ms of which 5 ms to minimize.
[2024-05-22 04:23:14] [INFO ] Deduced a trap composed of 59 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:23:14] [INFO ] Deduced a trap composed of 43 places in 417 ms of which 3 ms to minimize.
[2024-05-22 04:23:14] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 4 ms to minimize.
[2024-05-22 04:23:15] [INFO ] Deduced a trap composed of 43 places in 412 ms of which 4 ms to minimize.
[2024-05-22 04:23:15] [INFO ] Deduced a trap composed of 41 places in 396 ms of which 4 ms to minimize.
[2024-05-22 04:23:16] [INFO ] Deduced a trap composed of 43 places in 343 ms of which 4 ms to minimize.
[2024-05-22 04:23:16] [INFO ] Deduced a trap composed of 38 places in 399 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:23:17] [INFO ] Deduced a trap composed of 34 places in 356 ms of which 4 ms to minimize.
[2024-05-22 04:23:18] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 4 ms to minimize.
[2024-05-22 04:23:18] [INFO ] Deduced a trap composed of 42 places in 331 ms of which 4 ms to minimize.
[2024-05-22 04:23:18] [INFO ] Deduced a trap composed of 48 places in 383 ms of which 3 ms to minimize.
[2024-05-22 04:23:19] [INFO ] Deduced a trap composed of 28 places in 342 ms of which 4 ms to minimize.
[2024-05-22 04:23:19] [INFO ] Deduced a trap composed of 36 places in 390 ms of which 4 ms to minimize.
[2024-05-22 04:23:20] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 4 ms to minimize.
[2024-05-22 04:23:20] [INFO ] Deduced a trap composed of 42 places in 393 ms of which 4 ms to minimize.
[2024-05-22 04:23:20] [INFO ] Deduced a trap composed of 32 places in 355 ms of which 4 ms to minimize.
[2024-05-22 04:23:21] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 4 ms to minimize.
[2024-05-22 04:23:21] [INFO ] Deduced a trap composed of 46 places in 319 ms of which 4 ms to minimize.
[2024-05-22 04:23:22] [INFO ] Deduced a trap composed of 41 places in 372 ms of which 4 ms to minimize.
[2024-05-22 04:23:22] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 4 ms to minimize.
[2024-05-22 04:23:23] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 4 ms to minimize.
[2024-05-22 04:23:23] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-22 04:23:23] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 3 ms to minimize.
[2024-05-22 04:23:24] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 3 ms to minimize.
[2024-05-22 04:23:24] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2024-05-22 04:23:24] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 3 ms to minimize.
[2024-05-22 04:23:24] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/855 variables, and 52 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/264 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:23:33] [INFO ] Deduced a trap composed of 18 places in 386 ms of which 5 ms to minimize.
[2024-05-22 04:23:34] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 3 ms to minimize.
[2024-05-22 04:23:35] [INFO ] Deduced a trap composed of 32 places in 391 ms of which 5 ms to minimize.
[2024-05-22 04:23:36] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 4 ms to minimize.
[2024-05-22 04:23:36] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 3 ms to minimize.
[2024-05-22 04:23:37] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 3 ms to minimize.
[2024-05-22 04:23:37] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 3 ms to minimize.
[2024-05-22 04:23:37] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 3 ms to minimize.
[2024-05-22 04:23:37] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 3 ms to minimize.
[2024-05-22 04:23:38] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 3 ms to minimize.
[2024-05-22 04:23:38] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 2 ms to minimize.
[2024-05-22 04:23:39] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 3 ms to minimize.
[2024-05-22 04:23:39] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 4 ms to minimize.
[2024-05-22 04:23:39] [INFO ] Deduced a trap composed of 41 places in 263 ms of which 3 ms to minimize.
[2024-05-22 04:23:39] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 2 ms to minimize.
[2024-05-22 04:23:40] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 3 ms to minimize.
[2024-05-22 04:23:40] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 3 ms to minimize.
[2024-05-22 04:23:41] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 2 ms to minimize.
[2024-05-22 04:23:41] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 4 ms to minimize.
[2024-05-22 04:23:41] [INFO ] Deduced a trap composed of 46 places in 379 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:23:44] [INFO ] Deduced a trap composed of 32 places in 341 ms of which 4 ms to minimize.
[2024-05-22 04:23:45] [INFO ] Deduced a trap composed of 38 places in 344 ms of which 4 ms to minimize.
[2024-05-22 04:23:45] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 2 ms to minimize.
[2024-05-22 04:23:45] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 2 ms to minimize.
[2024-05-22 04:23:46] [INFO ] Deduced a trap composed of 31 places in 300 ms of which 4 ms to minimize.
[2024-05-22 04:23:46] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 3 ms to minimize.
[2024-05-22 04:23:47] [INFO ] Deduced a trap composed of 48 places in 341 ms of which 4 ms to minimize.
[2024-05-22 04:23:47] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 3 ms to minimize.
[2024-05-22 04:23:48] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 590 unsolved
[2024-05-22 04:23:56] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 4 ms to minimize.
[2024-05-22 04:23:56] [INFO ] Deduced a trap composed of 41 places in 225 ms of which 3 ms to minimize.
[2024-05-22 04:23:56] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
[2024-05-22 04:23:57] [INFO ] Deduced a trap composed of 41 places in 255 ms of which 3 ms to minimize.
[2024-05-22 04:23:57] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
SMT process timed out in 62095ms, After SMT, problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 62103ms
Starting structural reductions in LTL mode, iteration 1 : 264/267 places, 591/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62759 ms. Remains : 264/267 places, 591/594 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-03
Product exploration explored 100000 steps with 434 reset in 402 ms.
Entered a terminal (fully accepting) state of product in 20773 steps with 194 reset in 120 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-03 finished in 63499 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 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 252 edges and 267 vertex of which 4 / 267 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 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 264 transition count 495
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 138 rules applied. Total rules applied 235 place count 168 transition count 453
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 261 place count 143 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 142 transition count 452
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 262 place count 142 transition count 444
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 278 place count 134 transition count 444
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 280 place count 132 transition count 442
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 132 transition count 442
Performed 58 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 398 place count 74 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 399 place count 74 transition count 382
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 414 place count 59 transition count 276
Iterating global reduction 5 with 15 rules applied. Total rules applied 429 place count 59 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 436 place count 59 transition count 269
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 440 place count 57 transition count 267
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 442 place count 55 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 443 place count 54 transition count 265
Applied a total of 443 rules in 147 ms. Remains 54 /267 variables (removed 213) and now considering 265/594 (removed 329) transitions.
// Phase 1: matrix 265 rows 54 cols
[2024-05-22 04:23:58] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 04:23:58] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-22 04:23:58] [INFO ] Invariant cache hit.
[2024-05-22 04:23:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:23:58] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [49, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 506 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/267 places, 265/594 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 51 transition count 264
Applied a total of 2 rules in 22 ms. Remains 51 /52 variables (removed 1) and now considering 264/265 (removed 1) transitions.
// Phase 1: matrix 264 rows 51 cols
[2024-05-22 04:23:58] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 04:23:58] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 04:23:58] [INFO ] Invariant cache hit.
[2024-05-22 04:23:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:23:59] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/267 places, 264/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1168 ms. Remains : 51/267 places, 264/594 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-04
Product exploration explored 100000 steps with 40023 reset in 489 ms.
Product exploration explored 100000 steps with 39958 reset in 280 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/51 stabilizing places and 4/264 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 211 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 6 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-22 04:24:00] [INFO ] Invariant cache hit.
[2024-05-22 04:24:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 04:24:01] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-22 04:24:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 04:24:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 04:24:01] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-22 04:24:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:24:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 04:24:01] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 2 ms to minimize.
[2024-05-22 04:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-05-22 04:24:01] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 256 transitions) in 106 ms.
[2024-05-22 04:24:01] [INFO ] Added : 0 causal constraints over 0 iterations in 149 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 264/264 transitions.
Applied a total of 0 rules in 14 ms. Remains 51 /51 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 04:24:01] [INFO ] Invariant cache hit.
[2024-05-22 04:24:02] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 04:24:02] [INFO ] Invariant cache hit.
[2024-05-22 04:24:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:24:02] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-22 04:24:02] [INFO ] Redundant transitions in 27 ms returned [163]
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 261 sub problems to find dead transitions.
// Phase 1: matrix 263 rows 51 cols
[2024-05-22 04:24:02] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 04:24:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 04:24:05] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/312 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 1/313 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 61 constraints, problems are : Problem set: 0 solved, 261 unsolved in 13677 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/312 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 261/320 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 04:24:29] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/314 variables, and 322 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints]
After SMT, in 44985ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 44991ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/51 places, 263/264 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 49 transition count 261
Applied a total of 2 rules in 21 ms. Remains 49 /51 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 49 cols
[2024-05-22 04:24:47] [INFO ] Computed 8 invariants in 7 ms
[2024-05-22 04:24:47] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 04:24:47] [INFO ] Invariant cache hit.
[2024-05-22 04:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:24:47] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/51 places, 261/264 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45988 ms. Remains : 49/51 places, 261/264 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/49 stabilizing places and 5/261 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 28 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-04 finished in 49774 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||G(F((p1||G(F(p2))))))))'
Support contains 7 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 591
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 263 transition count 590
Applied a total of 8 rules in 19 ms. Remains 263 /267 variables (removed 4) and now considering 590/594 (removed 4) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-22 04:24:47] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 04:24:48] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-22 04:24:48] [INFO ] Invariant cache hit.
[2024-05-22 04:24:48] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-22 04:24:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:25:03] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 5 ms to minimize.
[2024-05-22 04:25:03] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 5 ms to minimize.
[2024-05-22 04:25:04] [INFO ] Deduced a trap composed of 37 places in 436 ms of which 5 ms to minimize.
[2024-05-22 04:25:04] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 5 ms to minimize.
[2024-05-22 04:25:05] [INFO ] Deduced a trap composed of 25 places in 402 ms of which 4 ms to minimize.
[2024-05-22 04:25:05] [INFO ] Deduced a trap composed of 14 places in 425 ms of which 4 ms to minimize.
[2024-05-22 04:25:06] [INFO ] Deduced a trap composed of 36 places in 445 ms of which 4 ms to minimize.
[2024-05-22 04:25:06] [INFO ] Deduced a trap composed of 35 places in 440 ms of which 4 ms to minimize.
[2024-05-22 04:25:07] [INFO ] Deduced a trap composed of 36 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:25:07] [INFO ] Deduced a trap composed of 42 places in 449 ms of which 4 ms to minimize.
[2024-05-22 04:25:08] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 4 ms to minimize.
[2024-05-22 04:25:08] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 4 ms to minimize.
[2024-05-22 04:25:08] [INFO ] Deduced a trap composed of 49 places in 465 ms of which 4 ms to minimize.
[2024-05-22 04:25:09] [INFO ] Deduced a trap composed of 18 places in 430 ms of which 4 ms to minimize.
[2024-05-22 04:25:09] [INFO ] Deduced a trap composed of 24 places in 455 ms of which 4 ms to minimize.
[2024-05-22 04:25:10] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 4 ms to minimize.
[2024-05-22 04:25:10] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 4 ms to minimize.
[2024-05-22 04:25:11] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 3 ms to minimize.
[2024-05-22 04:25:11] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 3 ms to minimize.
[2024-05-22 04:25:11] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:25:12] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 04:25:13] [INFO ] Deduced a trap composed of 24 places in 484 ms of which 5 ms to minimize.
[2024-05-22 04:25:14] [INFO ] Deduced a trap composed of 75 places in 452 ms of which 4 ms to minimize.
[2024-05-22 04:25:14] [INFO ] Deduced a trap composed of 43 places in 442 ms of which 4 ms to minimize.
[2024-05-22 04:25:14] [INFO ] Deduced a trap composed of 59 places in 466 ms of which 4 ms to minimize.
[2024-05-22 04:25:15] [INFO ] Deduced a trap composed of 39 places in 466 ms of which 4 ms to minimize.
[2024-05-22 04:25:15] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 4 ms to minimize.
[2024-05-22 04:25:16] [INFO ] Deduced a trap composed of 22 places in 461 ms of which 5 ms to minimize.
[2024-05-22 04:25:16] [INFO ] Deduced a trap composed of 42 places in 425 ms of which 4 ms to minimize.
[2024-05-22 04:25:17] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 4 ms to minimize.
[2024-05-22 04:25:17] [INFO ] Deduced a trap composed of 38 places in 428 ms of which 4 ms to minimize.
[2024-05-22 04:25:18] [INFO ] Deduced a trap composed of 31 places in 359 ms of which 4 ms to minimize.
[2024-05-22 04:25:18] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 4 ms to minimize.
[2024-05-22 04:25:19] [INFO ] Deduced a trap composed of 44 places in 463 ms of which 4 ms to minimize.
[2024-05-22 04:25:19] [INFO ] Deduced a trap composed of 40 places in 447 ms of which 5 ms to minimize.
[2024-05-22 04:25:20] [INFO ] Deduced a trap composed of 45 places in 427 ms of which 4 ms to minimize.
[2024-05-22 04:25:20] [INFO ] Deduced a trap composed of 46 places in 410 ms of which 4 ms to minimize.
[2024-05-22 04:25:20] [INFO ] Deduced a trap composed of 47 places in 413 ms of which 4 ms to minimize.
[2024-05-22 04:25:21] [INFO ] Deduced a trap composed of 44 places in 353 ms of which 3 ms to minimize.
[2024-05-22 04:25:21] [INFO ] Deduced a trap composed of 40 places in 346 ms of which 4 ms to minimize.
SMT process timed out in 32790ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 32801ms
Starting structural reductions in LTL mode, iteration 1 : 263/267 places, 590/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33723 ms. Remains : 263/267 places, 590/594 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-05
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-05 finished in 33980 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 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 251 edges and 267 vertex of which 4 / 267 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 264 transition count 493
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 239 place count 166 transition count 451
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 264 place count 141 transition count 451
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 264 place count 141 transition count 445
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 276 place count 135 transition count 445
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 278 place count 133 transition count 443
Iterating global reduction 3 with 2 rules applied. Total rules applied 280 place count 133 transition count 443
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 398 place count 74 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 74 transition count 382
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 413 place count 60 transition count 284
Iterating global reduction 4 with 14 rules applied. Total rules applied 427 place count 60 transition count 284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 434 place count 60 transition count 277
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 438 place count 58 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 440 place count 56 transition count 273
Applied a total of 440 rules in 101 ms. Remains 56 /267 variables (removed 211) and now considering 273/594 (removed 321) transitions.
// Phase 1: matrix 273 rows 56 cols
[2024-05-22 04:25:21] [INFO ] Computed 11 invariants in 4 ms
[2024-05-22 04:25:22] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 04:25:22] [INFO ] Invariant cache hit.
[2024-05-22 04:25:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:25:22] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [51, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 481 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/267 places, 273/594 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 53 transition count 272
Applied a total of 2 rules in 23 ms. Remains 53 /54 variables (removed 1) and now considering 272/273 (removed 1) transitions.
// Phase 1: matrix 272 rows 53 cols
[2024-05-22 04:25:22] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 04:25:22] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 04:25:22] [INFO ] Invariant cache hit.
[2024-05-22 04:25:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:25:22] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/267 places, 272/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1072 ms. Remains : 53/267 places, 272/594 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-07
Product exploration explored 100000 steps with 366 reset in 238 ms.
Product exploration explored 100000 steps with 62 reset in 228 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 109 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 49 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2176 resets) in 1615 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1254424 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 1
Probabilistic random walk after 1254424 steps, saw 186677 distinct states, run finished after 3010 ms. (steps per millisecond=416 ) properties seen :0
[2024-05-22 04:25:27] [INFO ] Invariant cache hit.
[2024-05-22 04:25:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/260 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/323 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/325 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/325 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 242/260 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/323 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/324 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/325 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/325 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 272/272 transitions.
Graph (complete) has 568 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 52 transition count 269
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 11 place count 52 transition count 261
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 44 transition count 261
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 44 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 43 transition count 262
Applied a total of 21 rules in 52 ms. Remains 43 /53 variables (removed 10) and now considering 262/272 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 43/53 places, 262/272 transitions.
RANDOM walk for 15555 steps (144 resets) in 118 ms. (130 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 272/272 transitions.
Applied a total of 0 rules in 21 ms. Remains 53 /53 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-22 04:25:28] [INFO ] Invariant cache hit.
[2024-05-22 04:25:28] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 04:25:28] [INFO ] Invariant cache hit.
[2024-05-22 04:25:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:25:28] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-22 04:25:28] [INFO ] Redundant transitions in 30 ms returned [164]
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 268 sub problems to find dead transitions.
// Phase 1: matrix 271 rows 53 cols
[2024-05-22 04:25:28] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 04:25:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 270/322 variables, 52/61 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 04:25:36] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/323 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 1/324 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 0/324 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 64 constraints, problems are : Problem set: 0 solved, 268 unsolved in 18635 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 1/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 270/322 variables, 52/62 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 268/330 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 268 unsolved
SMT process timed out in 50438ms, After SMT, problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 50444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 271/272 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 51 transition count 269
Applied a total of 2 rules in 14 ms. Remains 51 /53 variables (removed 2) and now considering 269/271 (removed 2) transitions.
// Phase 1: matrix 269 rows 51 cols
[2024-05-22 04:26:19] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 04:26:19] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 04:26:19] [INFO ] Invariant cache hit.
[2024-05-22 04:26:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:26:19] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/53 places, 269/272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51283 ms. Remains : 51/53 places, 269/272 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 77 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)]
RANDOM walk for 40000 steps (2233 resets) in 571 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (213 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1439068 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :0 out of 1
Probabilistic random walk after 1439068 steps, saw 217764 distinct states, run finished after 3006 ms. (steps per millisecond=478 ) properties seen :0
[2024-05-22 04:26:22] [INFO ] Invariant cache hit.
[2024-05-22 04:26:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/319 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 244/262 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/319 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 269/269 transitions.
Graph (complete) has 561 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 267
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 50 transition count 259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 42 transition count 259
Applied a total of 18 rules in 35 ms. Remains 42 /51 variables (removed 9) and now considering 259/269 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 42/51 places, 259/269 transitions.
RANDOM walk for 17484 steps (153 resets) in 132 ms. (131 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 141 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)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 56 reset in 127 ms.
Product exploration explored 100000 steps with 277 reset in 544 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 269/269 transitions.
Applied a total of 0 rules in 15 ms. Remains 51 /51 variables (removed 0) and now considering 269/269 (removed 0) transitions.
[2024-05-22 04:26:24] [INFO ] Invariant cache hit.
[2024-05-22 04:26:24] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 04:26:24] [INFO ] Invariant cache hit.
[2024-05-22 04:26:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:26:24] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-22 04:26:24] [INFO ] Redundant transitions in 24 ms returned []
Running 267 sub problems to find dead transitions.
[2024-05-22 04:26:24] [INFO ] Invariant cache hit.
[2024-05-22 04:26:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/319 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-22 04:26:31] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 1/320 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 62 constraints, problems are : Problem set: 0 solved, 267 unsolved in 16045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/319 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 267/328 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 329 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 1/1 constraints]
After SMT, in 47785ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 47790ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48251 ms. Remains : 51/51 places, 269/269 transitions.
Treatment of property AutonomousCar-PT-07b-LTLFireability-07 finished in 111058 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((X(p1)&&p0))))'
Support contains 9 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 264 transition count 591
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 264 transition count 591
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 263 transition count 590
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 263 transition count 590
Applied a total of 8 rules in 22 ms. Remains 263 /267 variables (removed 4) and now considering 590/594 (removed 4) transitions.
// Phase 1: matrix 590 rows 263 cols
[2024-05-22 04:27:12] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 04:27:13] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-22 04:27:13] [INFO ] Invariant cache hit.
[2024-05-22 04:27:13] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
Running 589 sub problems to find dead transitions.
[2024-05-22 04:27:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:27:25] [INFO ] Deduced a trap composed of 17 places in 502 ms of which 5 ms to minimize.
[2024-05-22 04:27:26] [INFO ] Deduced a trap composed of 35 places in 447 ms of which 4 ms to minimize.
[2024-05-22 04:27:26] [INFO ] Deduced a trap composed of 37 places in 408 ms of which 4 ms to minimize.
[2024-05-22 04:27:27] [INFO ] Deduced a trap composed of 34 places in 441 ms of which 4 ms to minimize.
[2024-05-22 04:27:27] [INFO ] Deduced a trap composed of 25 places in 440 ms of which 3 ms to minimize.
[2024-05-22 04:27:28] [INFO ] Deduced a trap composed of 14 places in 378 ms of which 4 ms to minimize.
[2024-05-22 04:27:28] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 4 ms to minimize.
[2024-05-22 04:27:29] [INFO ] Deduced a trap composed of 35 places in 432 ms of which 4 ms to minimize.
[2024-05-22 04:27:29] [INFO ] Deduced a trap composed of 36 places in 426 ms of which 4 ms to minimize.
[2024-05-22 04:27:29] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 4 ms to minimize.
[2024-05-22 04:27:30] [INFO ] Deduced a trap composed of 36 places in 427 ms of which 5 ms to minimize.
[2024-05-22 04:27:30] [INFO ] Deduced a trap composed of 36 places in 413 ms of which 4 ms to minimize.
[2024-05-22 04:27:31] [INFO ] Deduced a trap composed of 49 places in 444 ms of which 4 ms to minimize.
[2024-05-22 04:27:31] [INFO ] Deduced a trap composed of 18 places in 410 ms of which 4 ms to minimize.
[2024-05-22 04:27:32] [INFO ] Deduced a trap composed of 24 places in 433 ms of which 4 ms to minimize.
[2024-05-22 04:27:32] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 4 ms to minimize.
[2024-05-22 04:27:33] [INFO ] Deduced a trap composed of 41 places in 387 ms of which 4 ms to minimize.
[2024-05-22 04:27:33] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 4 ms to minimize.
[2024-05-22 04:27:34] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 3 ms to minimize.
[2024-05-22 04:27:34] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:27:35] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-22 04:27:36] [INFO ] Deduced a trap composed of 24 places in 487 ms of which 4 ms to minimize.
[2024-05-22 04:27:37] [INFO ] Deduced a trap composed of 75 places in 465 ms of which 4 ms to minimize.
[2024-05-22 04:27:37] [INFO ] Deduced a trap composed of 43 places in 434 ms of which 4 ms to minimize.
[2024-05-22 04:27:38] [INFO ] Deduced a trap composed of 59 places in 468 ms of which 4 ms to minimize.
[2024-05-22 04:27:38] [INFO ] Deduced a trap composed of 39 places in 414 ms of which 4 ms to minimize.
[2024-05-22 04:27:38] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 5 ms to minimize.
[2024-05-22 04:27:39] [INFO ] Deduced a trap composed of 22 places in 400 ms of which 4 ms to minimize.
[2024-05-22 04:27:39] [INFO ] Deduced a trap composed of 42 places in 437 ms of which 4 ms to minimize.
[2024-05-22 04:27:40] [INFO ] Deduced a trap composed of 27 places in 418 ms of which 4 ms to minimize.
[2024-05-22 04:27:40] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 4 ms to minimize.
[2024-05-22 04:27:41] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 4 ms to minimize.
[2024-05-22 04:27:41] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 5 ms to minimize.
[2024-05-22 04:27:42] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 4 ms to minimize.
[2024-05-22 04:27:42] [INFO ] Deduced a trap composed of 40 places in 432 ms of which 5 ms to minimize.
[2024-05-22 04:27:43] [INFO ] Deduced a trap composed of 45 places in 426 ms of which 4 ms to minimize.
[2024-05-22 04:27:43] [INFO ] Deduced a trap composed of 46 places in 357 ms of which 4 ms to minimize.
[2024-05-22 04:27:43] [INFO ] Deduced a trap composed of 47 places in 333 ms of which 4 ms to minimize.
[2024-05-22 04:27:44] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 4 ms to minimize.
[2024-05-22 04:27:44] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/853 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:27:53] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:27:53] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 4 ms to minimize.
[2024-05-22 04:27:54] [INFO ] Deduced a trap composed of 31 places in 363 ms of which 4 ms to minimize.
[2024-05-22 04:27:54] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 4 ms to minimize.
[2024-05-22 04:27:55] [INFO ] Deduced a trap composed of 38 places in 339 ms of which 4 ms to minimize.
[2024-05-22 04:27:55] [INFO ] Deduced a trap composed of 52 places in 456 ms of which 4 ms to minimize.
[2024-05-22 04:27:55] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 4 ms to minimize.
[2024-05-22 04:27:56] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 3 ms to minimize.
[2024-05-22 04:27:56] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 3 ms to minimize.
[2024-05-22 04:27:56] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 4 ms to minimize.
[2024-05-22 04:27:57] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 3 ms to minimize.
[2024-05-22 04:27:57] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 3 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 3 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 3 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 3 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 46 places in 206 ms of which 3 ms to minimize.
[2024-05-22 04:27:58] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 5 ms to minimize.
[2024-05-22 04:27:59] [INFO ] Deduced a trap composed of 52 places in 284 ms of which 3 ms to minimize.
[2024-05-22 04:27:59] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 3 ms to minimize.
[2024-05-22 04:28:00] [INFO ] Deduced a trap composed of 38 places in 297 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-22 04:28:01] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-22 04:28:02] [INFO ] Deduced a trap composed of 41 places in 278 ms of which 3 ms to minimize.
[2024-05-22 04:28:03] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 3 ms to minimize.
[2024-05-22 04:28:03] [INFO ] Deduced a trap composed of 41 places in 319 ms of which 4 ms to minimize.
[2024-05-22 04:28:03] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 2 ms to minimize.
[2024-05-22 04:28:04] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 3 ms to minimize.
[2024-05-22 04:28:04] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 2 ms to minimize.
[2024-05-22 04:28:04] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
[2024-05-22 04:28:05] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 3 ms to minimize.
[2024-05-22 04:28:05] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 3 ms to minimize.
[2024-05-22 04:28:06] [INFO ] Deduced a trap composed of 58 places in 373 ms of which 4 ms to minimize.
[2024-05-22 04:28:07] [INFO ] Deduced a trap composed of 56 places in 380 ms of which 3 ms to minimize.
[2024-05-22 04:28:07] [INFO ] Deduced a trap composed of 26 places in 397 ms of which 4 ms to minimize.
[2024-05-22 04:28:08] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 3 ms to minimize.
[2024-05-22 04:28:08] [INFO ] Deduced a trap composed of 10 places in 411 ms of which 4 ms to minimize.
[2024-05-22 04:28:08] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 4 ms to minimize.
[2024-05-22 04:28:09] [INFO ] Deduced a trap composed of 28 places in 402 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/853 variables, and 89 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 77/77 constraints]
After SMT, in 61956ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 61963ms
Starting structural reductions in LTL mode, iteration 1 : 263/267 places, 590/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62729 ms. Remains : 263/267 places, 590/594 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-09 finished in 62956 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 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 251 edges and 267 vertex of which 4 / 267 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 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 264 transition count 493
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 140 rules applied. Total rules applied 239 place count 166 transition count 451
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 141 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 266 place count 140 transition count 450
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 266 place count 140 transition count 443
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 280 place count 133 transition count 443
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 282 place count 131 transition count 441
Iterating global reduction 4 with 2 rules applied. Total rules applied 284 place count 131 transition count 441
Performed 59 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 402 place count 72 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 403 place count 72 transition count 380
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 418 place count 57 transition count 274
Iterating global reduction 5 with 15 rules applied. Total rules applied 433 place count 57 transition count 274
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 440 place count 57 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 444 place count 55 transition count 265
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 446 place count 53 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 447 place count 52 transition count 263
Applied a total of 447 rules in 85 ms. Remains 52 /267 variables (removed 215) and now considering 263/594 (removed 331) transitions.
// Phase 1: matrix 263 rows 52 cols
[2024-05-22 04:28:15] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 04:28:16] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 04:28:16] [INFO ] Invariant cache hit.
[2024-05-22 04:28:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:28:16] [INFO ] Implicit Places using invariants and state equation in 301 ms returned [47, 51]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 504 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/267 places, 263/594 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 49 transition count 262
Applied a total of 2 rules in 17 ms. Remains 49 /50 variables (removed 1) and now considering 262/263 (removed 1) transitions.
// Phase 1: matrix 262 rows 49 cols
[2024-05-22 04:28:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 04:28:16] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 04:28:16] [INFO ] Invariant cache hit.
[2024-05-22 04:28:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:28:16] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/267 places, 262/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1058 ms. Remains : 49/267 places, 262/594 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-12
Product exploration explored 100000 steps with 39972 reset in 367 ms.
Product exploration explored 100000 steps with 39992 reset in 353 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 286 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-22 04:28:18] [INFO ] Invariant cache hit.
[2024-05-22 04:28:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 04:28:18] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-22 04:28:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 04:28:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 04:28:19] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-22 04:28:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:28:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 04:28:19] [INFO ] Computed and/alt/rep : 12/62/12 causal constraints (skipped 248 transitions) in 58 ms.
[2024-05-22 04:28:19] [INFO ] Added : 2 causal constraints over 2 iterations in 134 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 262/262 transitions.
Applied a total of 0 rules in 13 ms. Remains 49 /49 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-22 04:28:19] [INFO ] Invariant cache hit.
[2024-05-22 04:28:19] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 04:28:19] [INFO ] Invariant cache hit.
[2024-05-22 04:28:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:28:19] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-22 04:28:19] [INFO ] Redundant transitions in 21 ms returned [161]
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 259 sub problems to find dead transitions.
// Phase 1: matrix 261 rows 49 cols
[2024-05-22 04:28:19] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 04:28:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 260/308 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 04:28:24] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 1/309 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 1/310 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 59 constraints, problems are : Problem set: 0 solved, 259 unsolved in 16520 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/308 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 259/316 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 1/309 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 1/310 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 318 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 1/1 constraints]
After SMT, in 47879ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 47885ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/49 places, 261/262 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 47 transition count 259
Applied a total of 2 rules in 17 ms. Remains 47 /49 variables (removed 2) and now considering 259/261 (removed 2) transitions.
// Phase 1: matrix 259 rows 47 cols
[2024-05-22 04:29:07] [INFO ] Computed 8 invariants in 4 ms
[2024-05-22 04:29:07] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 04:29:07] [INFO ] Invariant cache hit.
[2024-05-22 04:29:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:29:08] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/49 places, 259/262 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48908 ms. Remains : 47/49 places, 259/262 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07b-LTLFireability-12 finished in 52208 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((X((X(!p0)&&!p1)) U p2))))'
Support contains 1 out of 267 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 594/594 transitions.
Graph (trivial) has 233 edges and 267 vertex of which 4 / 267 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 264 transition count 494
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 139 rules applied. Total rules applied 237 place count 167 transition count 452
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 26 rules applied. Total rules applied 263 place count 142 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 141 transition count 451
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 264 place count 141 transition count 446
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 274 place count 136 transition count 446
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 134 transition count 444
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 134 transition count 444
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 4 with 104 rules applied. Total rules applied 382 place count 82 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 383 place count 82 transition count 390
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 394 place count 71 transition count 316
Iterating global reduction 5 with 11 rules applied. Total rules applied 405 place count 71 transition count 316
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 412 place count 71 transition count 309
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 416 place count 69 transition count 307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 418 place count 67 transition count 305
Applied a total of 418 rules in 81 ms. Remains 67 /267 variables (removed 200) and now considering 305/594 (removed 289) transitions.
// Phase 1: matrix 305 rows 67 cols
[2024-05-22 04:29:08] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 04:29:08] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 04:29:08] [INFO ] Invariant cache hit.
[2024-05-22 04:29:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 04:29:08] [INFO ] Implicit Places using invariants and state equation in 380 ms returned [62, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 508 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/267 places, 305/594 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 64 transition count 304
Applied a total of 2 rules in 10 ms. Remains 64 /65 variables (removed 1) and now considering 304/305 (removed 1) transitions.
// Phase 1: matrix 304 rows 64 cols
[2024-05-22 04:29:08] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 04:29:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 04:29:08] [INFO ] Invariant cache hit.
[2024-05-22 04:29:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:29:08] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/267 places, 304/594 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 843 ms. Remains : 64/267 places, 304/594 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07b-LTLFireability-14
Stuttering criterion allowed to conclude after 1119 steps with 140 reset in 4 ms.
FORMULA AutonomousCar-PT-07b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07b-LTLFireability-14 finished in 960 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)))'
[2024-05-22 04:29:09] [INFO ] Flatten gal took : 51 ms
[2024-05-22 04:29:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 04:29:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 267 places, 594 transitions and 4185 arcs took 13 ms.
Total runtime 454794 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running AutonomousCar-PT-07b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 267
TRANSITIONS: 594
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.012s]
SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1919
MODEL NAME: /home/mcc/execution/403/model
267 places, 594 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-07b-LTLFireability-07 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716352722753
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
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-07b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-07b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166400324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-07b.tgz
mv AutonomousCar-PT-07b 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 '
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 ;