MCC'2024- Execution of r468-smll-171620167400316

About the Execution of LTSMin+red for AutonomousCar-PT-07a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3345.804	608761.00	738544.00	1930.20	FFTFFFTFTFFFTFFT	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.r468-smll-171620167400316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 18:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 12 18:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 18:11 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 276K 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-07a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717214990135

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:09:52] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-06-01 04:09:52] [INFO ] Transformed 73 places.
[2024-06-01 04:09:52] [INFO ] Transformed 593 transitions.
[2024-06-01 04:09:52] [INFO ] Found NUPN structural information;
[2024-06-01 04:09:52] [INFO ] Parsed PT model containing 73 places and 593 transitions and 5357 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 213 transitions
Reduce redundant transitions removed 213 transitions.
FORMULA AutonomousCar-PT-07a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 380/380 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 371
Applied a total of 4 rules in 42 ms. Remains 71 /73 variables (removed 2) and now considering 371/380 (removed 9) transitions.
// Phase 1: matrix 371 rows 71 cols
[2024-06-01 04:09:52] [INFO ] Computed 11 invariants in 30 ms
[2024-06-01 04:09:52] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 04:09:52] [INFO ] Invariant cache hit.
[2024-06-01 04:09:53] [INFO ] State equation strengthened by 192 read => feed constraints.
[2024-06-01 04:09:53] [INFO ] Implicit Places using invariants and state equation in 316 ms returned [67, 69]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 673 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/73 places, 371/380 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 757 ms. Remains : 69/73 places, 371/380 transitions.
Support contains 40 out of 69 places after structural reductions.
[2024-06-01 04:09:53] [INFO ] Flatten gal took : 134 ms
[2024-06-01 04:09:53] [INFO ] Flatten gal took : 75 ms
[2024-06-01 04:09:54] [INFO ] Input system was already deterministic with 371 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (2157 resets) in 3444 ms. (11 steps per ms) remains 10/28 properties
BEST_FIRST walk for 40002 steps (98 resets) in 313 ms. (127 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (162 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (167 resets) in 136 ms. (292 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (166 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (214 resets) in 216 ms. (184 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (223 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (176 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (170 resets) in 95 ms. (416 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (222 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
// Phase 1: matrix 371 rows 69 cols
[2024-06-01 04:09:55] [INFO ] Computed 9 invariants in 7 ms
[2024-06-01 04:09:55] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/61 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 364/425 variables, 61/70 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 191/261 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/261 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/438 variables, 7/268 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/268 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/439 variables, 1/269 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/440 variables, 1/270 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 270 constraints, problems are : Problem set: 3 solved, 2 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/26 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/60 variables, 5/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 362/422 variables, 60/69 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 191/260 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/435 variables, 5/265 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 2/267 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/439 variables, 4/271 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/271 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/440 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 272 constraints, problems are : Problem set: 3 solved, 2 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1443ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 3618 ms.
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 371/371 transitions.
Graph (complete) has 661 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 68 transition count 360
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 61 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 61 transition count 359
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 60 transition count 359
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 53 transition count 310
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 53 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 50 transition count 307
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 47 place count 50 transition count 300
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 89 place count 43 transition count 265
Applied a total of 89 rules in 139 ms. Remains 43 /69 variables (removed 26) and now considering 265/371 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 43/69 places, 265/371 transitions.
RANDOM walk for 40000 steps (102 resets) in 341 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (142 resets) in 60 ms. (655 steps per ms) remains 1/2 properties
BEST_FIRST walk for 37926 steps (96 resets) in 74 ms. (505 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA AutonomousCar-PT-07a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 13 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 53 transition count 314
Applied a total of 32 rules in 52 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-06-01 04:10:01] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 04:10:01] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 04:10:01] [INFO ] Invariant cache hit.
[2024-06-01 04:10:01] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 04:10:01] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-01 04:10:01] [INFO ] Redundant transitions in 37 ms returned []
Running 313 sub problems to find dead transitions.
[2024-06-01 04:10:01] [INFO ] Invariant cache hit.
[2024-06-01 04:10:01] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-01 04:10:10] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 10 ms to minimize.
[2024-06-01 04:10:11] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 18834 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 51058ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 51067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51503 ms. Remains : 53/69 places, 314/371 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-00
Product exploration explored 100000 steps with 334 reset in 292 ms.
Product exploration explored 100000 steps with 11 reset in 194 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 19964 steps (1251 resets) in 163 ms. (121 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 20 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-01 04:10:54] [INFO ] Invariant cache hit.
[2024-06-01 04:10:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 04:10:54] [INFO ] Invariant cache hit.
[2024-06-01 04:10:54] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 04:10:54] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-01 04:10:54] [INFO ] Redundant transitions in 20 ms returned []
Running 313 sub problems to find dead transitions.
[2024-06-01 04:10:54] [INFO ] Invariant cache hit.
[2024-06-01 04:10:54] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-01 04:11:03] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-06-01 04:11:03] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 17869 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 49577ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 49583ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49963 ms. Remains : 53/53 places, 314/314 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 14342 steps (918 resets) in 159 ms. (89 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20 reset in 143 ms.
Product exploration explored 100000 steps with 6 reset in 165 ms.
Support contains 13 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 314/314 transitions.
Applied a total of 0 rules in 18 ms. Remains 53 /53 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-01 04:11:45] [INFO ] Invariant cache hit.
[2024-06-01 04:11:45] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 04:11:45] [INFO ] Invariant cache hit.
[2024-06-01 04:11:45] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 04:11:45] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-06-01 04:11:45] [INFO ] Redundant transitions in 18 ms returned []
Running 313 sub problems to find dead transitions.
[2024-06-01 04:11:45] [INFO ] Invariant cache hit.
[2024-06-01 04:11:45] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-01 04:11:53] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2024-06-01 04:11:54] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 17551 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 49327ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 49332ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49664 ms. Remains : 53/53 places, 314/314 transitions.
Treatment of property AutonomousCar-PT-07a-LTLFireability-00 finished in 154001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F((G(p2)&&p1)))))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 5 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-06-01 04:12:35] [INFO ] Computed 9 invariants in 4 ms
[2024-06-01 04:12:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 04:12:35] [INFO ] Invariant cache hit.
[2024-06-01 04:12:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 04:12:35] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-06-01 04:12:35] [INFO ] Invariant cache hit.
[2024-06-01 04:12:35] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-06-01 04:12:42] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2024-06-01 04:12:43] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 2 ms to minimize.
[2024-06-01 04:12:43] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2024-06-01 04:12:45] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 242 constraints, problems are : Problem set: 0 solved, 338 unsolved in 22525 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 338/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 580 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
After SMT, in 54482ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 54487ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54831 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-01 finished in 55208 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)||X(F(((!p1 U (p2||G(!p1))) U (((F(!p3) U ((!p4&&F(!p3))||G(F(!p3))))&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))))'
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 365
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 56 transition count 323
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 56 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 55 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 54 transition count 322
Applied a total of 30 rules in 60 ms. Remains 54 /69 variables (removed 15) and now considering 322/371 (removed 49) transitions.
// Phase 1: matrix 322 rows 54 cols
[2024-06-01 04:13:30] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 04:13:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 04:13:30] [INFO ] Invariant cache hit.
[2024-06-01 04:13:31] [INFO ] State equation strengthened by 159 read => feed constraints.
[2024-06-01 04:13:31] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 04:13:31] [INFO ] Redundant transitions in 15 ms returned []
Running 321 sub problems to find dead transitions.
[2024-06-01 04:13:31] [INFO ] Invariant cache hit.
[2024-06-01 04:13:31] [INFO ] State equation strengthened by 159 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 321/375 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-01 04:13:42] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 2 ms to minimize.
[2024-06-01 04:13:42] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 224 constraints, problems are : Problem set: 0 solved, 321 unsolved in 25155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 321/375 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 158/223 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 321/544 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 545 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 159/159 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 2/2 constraints]
After SMT, in 56700ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 56707ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/69 places, 322/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57165 ms. Remains : 54/69 places, 322/371 transitions.
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-02
Product exploration explored 100000 steps with 301 reset in 393 ms.
Product exploration explored 100000 steps with 72 reset in 205 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p4) (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 283 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 5 states, 12 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND (NOT p0) p1 (NOT p2) p3)]
RANDOM walk for 40000 steps (2537 resets) in 703 ms. (56 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (205 resets) in 1292 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (314 resets) in 277 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (209 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (148 resets) in 189 ms. (210 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (194 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (314 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (237 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (188 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (182 resets) in 75 ms. (526 steps per ms) remains 8/9 properties
[2024-06-01 04:14:30] [INFO ] Invariant cache hit.
[2024-06-01 04:14:30] [INFO ] State equation strengthened by 159 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 49/376 variables, and 9 constraints, problems are : Problem set: 8 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/54 constraints, ReadFeed: 0/159 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p4) (NOT p3)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3)))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4) p3) (AND (NOT p0) p2 (NOT p4) p3))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) (NOT p4) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) p2 p4))))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 p1 (NOT p4)) (OR p0 (NOT p4) (NOT p2)))), (G (AND (OR p0 (NOT p1) (NOT p3) p2) (OR p0 (NOT p3) p4))), (G (OR p0 p1 p2)), (G (AND (OR p0 p1 (NOT p3)) (OR p0 (NOT p3) (NOT p2)))), (G (OR p0 (NOT p1) p2)), (G (OR p0 (NOT p4))), (G (AND (OR p0 p1 (NOT p3) p4) (OR p0 (NOT p3) p4 (NOT p2)))), (G (OR p0 (NOT p1) (NOT p3) p2))]
False Knowledge obtained : [(F p3), (F p4), (F p1), (F (NOT p2)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 31 factoid took 31 ms. Reduced automaton from 5 states, 12 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-02 finished in 60135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(F(p1)||X(G(p2))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 339
Applied a total of 8 rules in 9 ms. Remains 65 /69 variables (removed 4) and now considering 339/371 (removed 32) transitions.
// Phase 1: matrix 339 rows 65 cols
[2024-06-01 04:14:30] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 04:14:30] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 04:14:30] [INFO ] Invariant cache hit.
[2024-06-01 04:14:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-06-01 04:14:31] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-06-01 04:14:31] [INFO ] Invariant cache hit.
[2024-06-01 04:14:31] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 338/403 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 163/237 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-06-01 04:14:39] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 2 ms to minimize.
[2024-06-01 04:14:40] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-06-01 04:14:40] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2024-06-01 04:14:43] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 242 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 338/403 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 163/241 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 338/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 1/404 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 580 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 4/4 constraints]
After SMT, in 62228ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 62236ms
Starting structural reductions in LTL mode, iteration 1 : 65/69 places, 339/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62818 ms. Remains : 65/69 places, 339/371 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-04
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-04 finished in 63047 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))&&(X(!p1) U (p2 U p3))))'
Support contains 19 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 3 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-06-01 04:15:33] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:15:33] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 04:15:33] [INFO ] Invariant cache hit.
[2024-06-01 04:15:34] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-06-01 04:15:34] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-01 04:15:34] [INFO ] Invariant cache hit.
[2024-06-01 04:15:34] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-01 04:15:42] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 2 ms to minimize.
[2024-06-01 04:15:43] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2024-06-01 04:15:43] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 322/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 547 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 61727ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 61732ms
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61973 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p3) (NOT p0)), p1, (NOT p0), (NOT p0), (NOT p3), (AND p1 (NOT p3)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-10 finished in 62434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 331
Applied a total of 10 rules in 11 ms. Remains 64 /69 variables (removed 5) and now considering 331/371 (removed 40) transitions.
// Phase 1: matrix 331 rows 64 cols
[2024-06-01 04:16:36] [INFO ] Computed 9 invariants in 9 ms
[2024-06-01 04:16:36] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 04:16:36] [INFO ] Invariant cache hit.
[2024-06-01 04:16:36] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-06-01 04:16:36] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-01 04:16:36] [INFO ] Invariant cache hit.
[2024-06-01 04:16:36] [INFO ] State equation strengthened by 157 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (OVERLAPS) 330/394 variables, 64/73 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 156/229 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-01 04:16:46] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 2 ms to minimize.
[2024-06-01 04:16:46] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 2 ms to minimize.
[2024-06-01 04:16:46] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 2 ms to minimize.
[2024-06-01 04:16:50] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 330 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 234 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (OVERLAPS) 330/394 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 156/233 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 330/563 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 564 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 157/157 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 4/4 constraints]
After SMT, in 61715ms problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 61721ms
Starting structural reductions in LTL mode, iteration 1 : 64/69 places, 331/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62327 ms. Remains : 64/69 places, 331/371 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-11 finished in 62434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 5 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
// Phase 1: matrix 323 rows 63 cols
[2024-06-01 04:17:38] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:17:38] [INFO ] Implicit Places using invariants in 186 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 323/371 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 62/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 1173 ms.
Product exploration explored 100000 steps with 50000 reset in 1134 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-07a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-07a-LTLFireability-12 finished in 2606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 323
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 323
Applied a total of 12 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 323/371 (removed 48) transitions.
[2024-06-01 04:17:41] [INFO ] Invariant cache hit.
[2024-06-01 04:17:41] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 04:17:41] [INFO ] Invariant cache hit.
[2024-06-01 04:17:41] [INFO ] State equation strengthened by 150 read => feed constraints.
[2024-06-01 04:17:41] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-01 04:17:41] [INFO ] Invariant cache hit.
[2024-06-01 04:17:41] [INFO ] State equation strengthened by 150 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 322/385 variables, 63/72 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 149/221 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-06-01 04:17:49] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2024-06-01 04:17:49] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-06-01 04:17:49] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/386 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 225 constraints, problems are : Problem set: 0 solved, 322 unsolved in 24203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 322/385 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 149/224 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 322/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/386 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 547 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 150/150 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 3/3 constraints]
After SMT, in 55887ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 55893ms
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 323/371 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56268 ms. Remains : 63/69 places, 323/371 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-13
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-13 finished in 56432 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((((p1 U p2)||(p3 U p2))&&p0)))'
Support contains 14 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 371/371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 69 transition count 366
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 64 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 63 transition count 365
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 63 transition count 363
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 61 transition count 363
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 22 place count 55 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 55 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 54 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 53 transition count 314
Applied a total of 32 rules in 59 ms. Remains 53 /69 variables (removed 16) and now considering 314/371 (removed 57) transitions.
// Phase 1: matrix 314 rows 53 cols
[2024-06-01 04:18:37] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:18:37] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 04:18:37] [INFO ] Invariant cache hit.
[2024-06-01 04:18:38] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 04:18:38] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-06-01 04:18:38] [INFO ] Redundant transitions in 21 ms returned []
Running 313 sub problems to find dead transitions.
[2024-06-01 04:18:38] [INFO ] Invariant cache hit.
[2024-06-01 04:18:38] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (OVERLAPS) 313/366 variables, 53/62 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 151/213 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-01 04:18:48] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 2 ms to minimize.
[2024-06-01 04:18:49] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 216 constraints, problems are : Problem set: 0 solved, 313 unsolved in 25834 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 313/366 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 151/215 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 313/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/367 variables, and 529 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints]
After SMT, in 57724ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 57730ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/69 places, 314/371 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58229 ms. Remains : 53/69 places, 314/371 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-07a-LTLFireability-14
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-07a-LTLFireability-14 finished in 58454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
[2024-06-01 04:19:36] [INFO ] Flatten gal took : 111 ms
[2024-06-01 04:19:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 04:19:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 371 transitions and 3688 arcs took 17 ms.
Total runtime 584952 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-07a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717215598896

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutonomousCar-PT-07a-LTLFireability-00
ltl formula formula --ltl=/tmp/1135/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 69 places, 371 transitions and 3688 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1135/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1135/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1135/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1135/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 70 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 70, there are 972 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~28 levels ~10000 states ~69880 transitions
pnml2lts-mc( 2/ 4): ~104 levels ~20000 states ~187396 transitions
pnml2lts-mc( 1/ 4): ~173 levels ~40000 states ~476312 transitions
pnml2lts-mc( 2/ 4): ~262 levels ~80000 states ~867644 transitions
pnml2lts-mc( 2/ 4): ~262 levels ~160000 states ~2138132 transitions
pnml2lts-mc( 2/ 4): ~262 levels ~320000 states ~4671808 transitions
pnml2lts-mc( 2/ 4): ~286 levels ~640000 states ~9318616 transitions
pnml2lts-mc( 1/ 4): ~517 levels ~1280000 states ~21022200 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~116!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2150660
pnml2lts-mc( 0/ 4): unique states count: 2295722
pnml2lts-mc( 0/ 4): unique transitions count: 32392471
pnml2lts-mc( 0/ 4): - self-loop count: 1127678
pnml2lts-mc( 0/ 4): - claim dead count: 27340742
pnml2lts-mc( 0/ 4): - claim found count: 1623841
pnml2lts-mc( 0/ 4): - claim success count: 2295758
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1432
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2295777 states 32393340 transitions, fanout: 14.110
pnml2lts-mc( 0/ 4): Total exploration time 21.070 sec (21.070 sec minimum, 21.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 108960, Transitions per second: 1537415
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 17.8MB, 8.1 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 374 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 17.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-07a, 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 r468-smll-171620167400316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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