MCC'2024- Execution of r026-smll-171620167500364

About the Execution of ITS-Tools for AutonomousCar-PT-10a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15997.699	3600000.00	6213825.00	7798.10	FTFTFTFTF?FTF?T?	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.r026-smll-171620167500364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutonomousCar-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167500364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K 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.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 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 1.5M 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-10a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716354543345

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 05:09:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 05:09:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:09:06] [INFO ] Load time of PNML (sax parser for PT used): 746 ms
[2024-05-22 05:09:06] [INFO ] Transformed 97 places.
[2024-05-22 05:09:06] [INFO ] Transformed 1921 transitions.
[2024-05-22 05:09:06] [INFO ] Found NUPN structural information;
[2024-05-22 05:09:06] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 1003 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 91 transition count 1442
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 91 transition count 1442
Applied a total of 12 rules in 58 ms. Remains 91 /97 variables (removed 6) and now considering 1442/1498 (removed 56) transitions.
// Phase 1: matrix 1442 rows 91 cols
[2024-05-22 05:09:07] [INFO ] Computed 14 invariants in 95 ms
[2024-05-22 05:09:07] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-22 05:09:07] [INFO ] Invariant cache hit.
[2024-05-22 05:09:08] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-05-22 05:09:08] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned [87, 89]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1817 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/97 places, 1442/1498 transitions.
Applied a total of 0 rules in 15 ms. Remains 89 /89 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1922 ms. Remains : 89/97 places, 1442/1498 transitions.
Support contains 49 out of 89 places after structural reductions.
[2024-05-22 05:09:10] [INFO ] Flatten gal took : 499 ms
[2024-05-22 05:09:10] [INFO ] Flatten gal took : 351 ms
[2024-05-22 05:09:11] [INFO ] Input system was already deterministic with 1442 transitions.
Support contains 48 out of 89 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (1818 resets) in 5033 ms. (7 steps per ms) remains 30/37 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (15 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 32 ms. (121 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (15 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (14 resets) in 28 ms. (138 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (9 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (13 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
// Phase 1: matrix 1442 rows 89 cols
[2024-05-22 05:09:12] [INFO ] Computed 12 invariants in 22 ms
[2024-05-22 05:09:13] [INFO ] State equation strengthened by 353 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/81 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1516 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1516 variables, 352/445 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1516 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 13/1529 variables, 7/452 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/453 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 1/1531 variables, 1/454 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1531/1531 variables, and 454 constraints, problems are : Problem set: 2 solved, 24 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 89/89 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 26/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 41/81 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1516 variables, 81/93 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1516 variables, 352/445 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1516 variables, 0/445 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 13/1529 variables, 7/452 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/453 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 1/1531 variables, 1/454 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1531/1531 variables, and 454 constraints, problems are : Problem set: 2 solved, 24 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 89/89 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 24/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11166ms problems are : Problem set: 2 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Graph (complete) has 1186 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.60 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 88 transition count 1434
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 84 transition count 1432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 82 transition count 1432
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 82 transition count 1429
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 79 transition count 1429
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 26 place count 75 transition count 1395
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 75 transition count 1395
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 74 transition count 1394
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 74 transition count 1388
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 84 place count 68 transition count 1348
Applied a total of 84 rules in 710 ms. Remains 68 /89 variables (removed 21) and now considering 1348/1442 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 68/89 places, 1348/1442 transitions.
RANDOM walk for 40000 steps (377 resets) in 1823 ms. (21 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (15 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
// Phase 1: matrix 1348 rows 68 cols
[2024-05-22 05:09:25] [INFO ] Computed 14 invariants in 15 ms
[2024-05-22 05:09:25] [INFO ] State equation strengthened by 281 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 28/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2138 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 28/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1348/1416 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 281/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 363 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 281/281 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5778ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 3 properties in 17042 ms.
Support contains 35 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 1348/1348 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 1347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 67 transition count 1337
Applied a total of 12 rules in 186 ms. Remains 67 /68 variables (removed 1) and now considering 1337/1348 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 67/68 places, 1337/1348 transitions.
RANDOM walk for 40000 steps (172 resets) in 1333 ms. (29 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (109 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (23 resets) in 240 ms. (165 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (99 resets) in 139 ms. (285 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (89 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (14 resets) in 166 ms. (239 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (102 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (27 resets) in 161 ms. (246 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (95 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (95 resets) in 128 ms. (310 steps per ms) remains 6/7 properties
// Phase 1: matrix 1337 rows 67 cols
[2024-05-22 05:09:49] [INFO ] Computed 14 invariants in 16 ms
[2024-05-22 05:09:49] [INFO ] State equation strengthened by 271 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 36/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1337/1404 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1404 variables, 271/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1404/1404 variables, and 352 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 36/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/67 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1337/1404 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1404 variables, 271/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1404 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 352 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2603ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 5831 ms.
Support contains 13 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 1337/1337 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 1336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 66 transition count 1336
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 64 transition count 1334
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 64 transition count 1332
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 20 place count 62 transition count 1322
Applied a total of 20 rules in 280 ms. Remains 62 /67 variables (removed 5) and now considering 1322/1337 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 62/67 places, 1322/1337 transitions.
RANDOM walk for 40000 steps (133 resets) in 1266 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (93 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (103 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (88 resets) in 92 ms. (430 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (91 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
// Phase 1: matrix 1322 rows 62 cols
[2024-05-22 05:09:58] [INFO ] Computed 14 invariants in 15 ms
[2024-05-22 05:09:58] [INFO ] State equation strengthened by 261 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/62 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1322/1384 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1384 variables, 261/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1384 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1384 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 337 constraints, problems are : Problem set: 0 solved, 5 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 22/62 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1322/1384 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1384 variables, 261/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1384 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1384 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1384/1384 variables, and 337 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 261/261 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2343ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 4150 ms.
Support contains 9 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 1322/1322 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 1311
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 1311
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 61 transition count 1310
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 14 place count 60 transition count 1300
Applied a total of 14 rules in 216 ms. Remains 60 /62 variables (removed 2) and now considering 1300/1322 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 60/62 places, 1300/1322 transitions.
RANDOM walk for 40000 steps (32 resets) in 1296 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (85 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (95 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (61 resets) in 149 ms. (266 steps per ms) remains 3/4 properties
// Phase 1: matrix 1300 rows 60 cols
[2024-05-22 05:10:06] [INFO ] Computed 14 invariants in 14 ms
[2024-05-22 05:10:06] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/60 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1360 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 241/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 315 constraints, problems are : Problem set: 0 solved, 3 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/60 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1300/1360 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 241/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1360 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 315 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2031ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2150 ms.
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1300/1300 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 1299
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 1289
Applied a total of 12 rules in 195 ms. Remains 59 /60 variables (removed 1) and now considering 1289/1300 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 59/60 places, 1289/1300 transitions.
RANDOM walk for 40000 steps (28 resets) in 1171 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (90 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (45 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (50 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 409891 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 3
Probabilistic random walk after 409891 steps, saw 62561 distinct states, run finished after 3008 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 1289 rows 59 cols
[2024-05-22 05:10:14] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 05:10:14] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/59 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1289/1348 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1348 variables, 231/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1348 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1348 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1348/1348 variables, and 304 constraints, problems are : Problem set: 0 solved, 3 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/59 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1289/1348 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1348 variables, 231/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1348 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1348 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1348/1348 variables, and 304 constraints, problems are : Problem set: 0 solved, 3 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 59/59 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1504ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2205 ms.
Support contains 7 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1289/1289 transitions.
Applied a total of 0 rules in 89 ms. Remains 59 /59 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 59/59 places, 1289/1289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 1289/1289 transitions.
Applied a total of 0 rules in 91 ms. Remains 59 /59 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-05-22 05:10:17] [INFO ] Invariant cache hit.
[2024-05-22 05:10:18] [INFO ] Implicit Places using invariants in 926 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 931 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/59 places, 1289/1289 transitions.
Applied a total of 0 rules in 88 ms. Remains 58 /58 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1111 ms. Remains : 58/59 places, 1289/1289 transitions.
RANDOM walk for 40000 steps (27 resets) in 1137 ms. (35 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (102 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 408819 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 3
Probabilistic random walk after 408819 steps, saw 62445 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 1289 rows 58 cols
[2024-05-22 05:10:22] [INFO ] Computed 13 invariants in 9 ms
[2024-05-22 05:10:22] [INFO ] State equation strengthened by 231 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/58 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1289/1347 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 231/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1347 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1347 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1347/1347 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/58 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1289/1347 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 231/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1347 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1347 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1347/1347 variables, and 302 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1996ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2377 ms.
Support contains 7 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1289/1289 transitions.
Applied a total of 0 rules in 87 ms. Remains 58 /58 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 58/58 places, 1289/1289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1289/1289 transitions.
Applied a total of 0 rules in 90 ms. Remains 58 /58 variables (removed 0) and now considering 1289/1289 (removed 0) transitions.
[2024-05-22 05:10:26] [INFO ] Invariant cache hit.
[2024-05-22 05:10:27] [INFO ] Implicit Places using invariants in 677 ms returned []
[2024-05-22 05:10:27] [INFO ] Invariant cache hit.
[2024-05-22 05:10:28] [INFO ] State equation strengthened by 231 read => feed constraints.
[2024-05-22 05:10:29] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
[2024-05-22 05:10:29] [INFO ] Redundant transitions in 176 ms returned []
Running 1288 sub problems to find dead transitions.
[2024-05-22 05:10:29] [INFO ] Invariant cache hit.
[2024-05-22 05:10:29] [INFO ] State equation strengthened by 231 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
[2024-05-22 05:11:16] [INFO ] Deduced a trap composed of 23 places in 1619 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1347 variables, and 14 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/231 constraints, PredecessorRefiner: 1288/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 4 (OVERLAPS) 1289/1347 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1347 variables, 231/303 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 33/336 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1347/1347 variables, and 336 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 1288/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 83830ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 83866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86432 ms. Remains : 58/58 places, 1289/1289 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
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' '!(X(G(p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:11:54] [INFO ] Computed 12 invariants in 14 ms
[2024-05-22 05:11:54] [INFO ] Implicit Places using invariants in 748 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 751 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 6 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 771 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-00
Product exploration explored 100000 steps with 1882 reset in 1317 ms.
Product exploration explored 100000 steps with 2382 reset in 1283 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 : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (1844 resets) in 2066 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32294 steps (109 resets) in 292 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-00 finished in 4763 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((X(G((p0||F(p1))))&&F(p2))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 89 transition count 1434
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 81 transition count 1433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 80 transition count 1433
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 80 transition count 1431
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 22 place count 78 transition count 1431
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 73 transition count 1376
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 73 transition count 1376
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 34 place count 72 transition count 1375
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 36 place count 71 transition count 1375
Applied a total of 36 rules in 551 ms. Remains 71 /89 variables (removed 18) and now considering 1375/1442 (removed 67) transitions.
// Phase 1: matrix 1375 rows 71 cols
[2024-05-22 05:11:59] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 05:11:59] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-22 05:11:59] [INFO ] Invariant cache hit.
[2024-05-22 05:12:00] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 05:12:00] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-05-22 05:12:00] [INFO ] Redundant transitions in 99 ms returned []
Running 1374 sub problems to find dead transitions.
[2024-05-22 05:12:01] [INFO ] Invariant cache hit.
[2024-05-22 05:12:01] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1374/1445 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
SMT process timed out in 54860ms, After SMT, problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 54895ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1375/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57167 ms. Remains : 71/89 places, 1375/1442 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-02
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-02 finished in 57503 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))||(X(p1)&&(!p2 U (p3||G(!p2))))))'
Support contains 21 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 18 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:12:56] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 05:12:56] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-22 05:12:56] [INFO ] Invariant cache hit.
[2024-05-22 05:12:57] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:12:57] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:12:57] [INFO ] Invariant cache hit.
[2024-05-22 05:12:57] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 85159ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85191ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86278 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-03
Product exploration timeout after 77910 steps with 38955 reset in 10002 ms.
Product exploration timeout after 80370 steps with 40185 reset in 10001 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) p1), (X (NOT p2)), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 23 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-03 finished in 106516 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((F(G(p0))&&F(p1))) U p2)))'
Support contains 8 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 1420
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 1420
Applied a total of 4 rules in 21 ms. Remains 87 /89 variables (removed 2) and now considering 1420/1442 (removed 22) transitions.
// Phase 1: matrix 1420 rows 87 cols
[2024-05-22 05:14:42] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 05:14:43] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-22 05:14:43] [INFO ] Invariant cache hit.
[2024-05-22 05:14:44] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-22 05:14:45] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
Running 1419 sub problems to find dead transitions.
[2024-05-22 05:14:45] [INFO ] Invariant cache hit.
[2024-05-22 05:14:45] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 87/1507 variables, and 12 constraints, problems are : Problem set: 0 solved, 1419 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/87 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 1419/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
SMT process timed out in 84983ms, After SMT, problems are : Problem set: 0 solved, 1419 unsolved
Search for dead transitions found 0 dead transitions in 85014ms
Starting structural reductions in LTL mode, iteration 1 : 87/89 places, 1420/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87771 ms. Remains : 87/89 places, 1420/1442 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-04
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-04 finished in 88100 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 U p1)) U !p0)))'
Support contains 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 19 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-22 05:16:10] [INFO ] Computed 12 invariants in 14 ms
[2024-05-22 05:16:11] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-22 05:16:11] [INFO ] Invariant cache hit.
[2024-05-22 05:16:11] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-22 05:16:12] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-05-22 05:16:12] [INFO ] Invariant cache hit.
[2024-05-22 05:16:12] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/1483 variables, and 12 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/85 constraints, ReadFeed: 0/313 constraints, PredecessorRefiner: 1397/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1482 variables, 312/409 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1482/1483 variables, and 470 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 312/313 constraints, PredecessorRefiner: 1397/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 85061ms problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 85088ms
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86829 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 224 ms :[p0, p0, (NOT p1), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-05
Product exploration timeout after 73730 steps with 36865 reset in 10002 ms.
Product exploration timeout after 78550 steps with 39275 reset in 10001 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-05 finished in 107133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 11 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
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 36 place count 71 transition count 1374
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 2 with 2 rules applied. Total rules applied 38 place count 70 transition count 1374
Applied a total of 38 rules in 256 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 05:17:58] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:17:58] [INFO ] Implicit Places using invariants in 652 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 656 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 110 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1023 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-06
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-06 finished in 1140 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(p1)||p0)))'
Support contains 18 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 71 transition count 1374
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 38 place count 70 transition count 1374
Applied a total of 38 rules in 258 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
[2024-05-22 05:17:59] [INFO ] Invariant cache hit.
[2024-05-22 05:17:59] [INFO ] Implicit Places using invariants in 486 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 492 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 168 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 919 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 816 reset in 754 ms.
Product exploration explored 100000 steps with 1482 reset in 958 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2257 resets) in 2101 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (67 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (123 resets) in 266 ms. (149 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (124 resets) in 202 ms. (197 steps per ms) remains 1/2 properties
// Phase 1: matrix 1374 rows 69 cols
[2024-05-22 05:18:02] [INFO ] Computed 11 invariants in 10 ms
[2024-05-22 05:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/63 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1371/1434 variables, 63/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1434 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/1442 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1442 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1443 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1443 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1443 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1443/1443 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 52/1443 variables, and 10 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 0/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-07 finished in 4451 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)&&G(p1))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 11 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:18:03] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 05:18:04] [INFO ] Implicit Places using invariants in 531 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 535 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/89 places, 1387/1442 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 552 ms. Remains : 83/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-08
Product exploration explored 100000 steps with 3331 reset in 1538 ms.
Product exploration explored 100000 steps with 793 reset in 518 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 : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (1815 resets) in 1785 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25232 steps (90 resets) in 530 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-10a-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-10a-LTLFireability-08 finished in 4005 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&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 17 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2024-05-22 05:18:07] [INFO ] Invariant cache hit.
[2024-05-22 05:18:07] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-22 05:18:07] [INFO ] Invariant cache hit.
[2024-05-22 05:18:08] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:18:09] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:18:09] [INFO ] Invariant cache hit.
[2024-05-22 05:18:09] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 96 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1326/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 84385ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 84412ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85914 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09
Product exploration explored 100000 steps with 1173 reset in 1109 ms.
Product exploration explored 100000 steps with 1817 reset in 1060 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 107 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
RANDOM walk for 40000 steps (1816 resets) in 2550 ms. (15 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (99 resets) in 124 ms. (320 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40004 steps (26 resets) in 527 ms. (75 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (101 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (101 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (101 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
[2024-05-22 05:19:37] [INFO ] Invariant cache hit.
[2024-05-22 05:19:37] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 2 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1093 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2017ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 803 ms.
Support contains 17 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 83 transition count 1375
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
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 30 place count 70 transition count 1370
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 70 transition count 1360
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 130 place count 60 transition count 1280
Applied a total of 130 rules in 250 ms. Remains 60 /84 variables (removed 24) and now considering 1280/1387 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 60/84 places, 1280/1387 transitions.
RANDOM walk for 40000 steps (37 resets) in 2030 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (49 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 348840 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 2
Probabilistic random walk after 348840 steps, saw 51894 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
// Phase 1: matrix 1280 rows 60 cols
[2024-05-22 05:19:44] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 05:19:44] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1835ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 945 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 68 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 60/60 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 70 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-22 05:19:47] [INFO ] Invariant cache hit.
[2024-05-22 05:19:47] [INFO ] Implicit Places using invariants in 295 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1280/1280 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1279
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1279
Applied a total of 2 rules in 81 ms. Remains 58 /59 variables (removed 1) and now considering 1279/1280 (removed 1) transitions.
// Phase 1: matrix 1279 rows 58 cols
[2024-05-22 05:19:47] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:19:48] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-22 05:19:48] [INFO ] Invariant cache hit.
[2024-05-22 05:19:48] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 05:19:49] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1279/1280 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1922 ms. Remains : 58/60 places, 1279/1280 transitions.
RANDOM walk for 40000 steps (18 resets) in 2440 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (56 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 349726 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 2
Probabilistic random walk after 349726 steps, saw 52086 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-22 05:19:53] [INFO ] Invariant cache hit.
[2024-05-22 05:19:53] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1134ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 994 steps, including 224 resets, run visited all 2 properties in 89 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 96 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (AND (OR p0 (NOT p2) p3) (OR (NOT p1) (NOT p2) p3))), (G (OR (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F p2), (F (NOT (OR (NOT p1) p2 p3))), (F p3), (F (NOT p0)), (F (NOT (AND (OR p0 p2 p3) (OR (NOT p1) p2 p3))))]
Knowledge based reduction with 21 factoid took 523 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:19:55] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 05:19:56] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-22 05:19:56] [INFO ] Invariant cache hit.
[2024-05-22 05:19:56] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:19:57] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:19:57] [INFO ] Invariant cache hit.
[2024-05-22 05:19:57] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30154 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85037ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85062ms
Finished structural reductions in LTL mode , in 1 iterations and 86961 ms. Remains : 84/84 places, 1387/1387 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 220 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
RANDOM walk for 40000 steps (1839 resets) in 2602 ms. (15 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (102 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 257 ms. (155 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (106 resets) in 294 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (101 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (103 resets) in 339 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (97 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
[2024-05-22 05:21:24] [INFO ] Invariant cache hit.
[2024-05-22 05:21:24] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 57/76 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4286ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3501 ms.
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 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 83 transition count 1376
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 76 transition count 1375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 75 transition count 1375
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 20 place count 75 transition count 1372
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 72 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 71 transition count 1371
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 70 transition count 1370
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 39 place count 70 transition count 1361
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 118 place count 61 transition count 1291
Applied a total of 118 rules in 312 ms. Remains 61 /84 variables (removed 23) and now considering 1291/1387 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 312 ms. Remains : 61/84 places, 1291/1387 transitions.
RANDOM walk for 40000 steps (62 resets) in 2545 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (74 resets) in 215 ms. (185 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (63 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
// Phase 1: matrix 1291 rows 61 cols
[2024-05-22 05:21:33] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 05:21:33] [INFO ] State equation strengthened by 231 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1291/1352 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 231/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1352 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1352/1352 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 61/61 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1718ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 858 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1291/1291 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1290
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1280
Applied a total of 12 rules in 143 ms. Remains 60 /61 variables (removed 1) and now considering 1280/1291 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 60/61 places, 1280/1291 transitions.
RANDOM walk for 40000 steps (36 resets) in 2821 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (47 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 329904 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 2
Probabilistic random walk after 329904 steps, saw 50258 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
// Phase 1: matrix 1280 rows 60 cols
[2024-05-22 05:21:40] [INFO ] Computed 14 invariants in 11 ms
[2024-05-22 05:21:40] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/59 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1280/1340 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 221/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1340 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1340/1340 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 60/60 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 944 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 68 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 60/60 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1280/1280 transitions.
Applied a total of 0 rules in 68 ms. Remains 60 /60 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-22 05:21:43] [INFO ] Invariant cache hit.
[2024-05-22 05:21:43] [INFO ] Implicit Places using invariants in 324 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 327 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1280/1280 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1279
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1279
Applied a total of 2 rules in 108 ms. Remains 58 /59 variables (removed 1) and now considering 1279/1280 (removed 1) transitions.
// Phase 1: matrix 1279 rows 58 cols
[2024-05-22 05:21:43] [INFO ] Computed 13 invariants in 11 ms
[2024-05-22 05:21:44] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-22 05:21:44] [INFO ] Invariant cache hit.
[2024-05-22 05:21:44] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 05:21:45] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1279/1280 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2120 ms. Remains : 58/60 places, 1279/1280 transitions.
RANDOM walk for 40000 steps (34 resets) in 2604 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (49 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 308541 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 2
Probabilistic random walk after 308541 steps, saw 46922 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-22 05:21:49] [INFO ] Invariant cache hit.
[2024-05-22 05:21:49] [INFO ] State equation strengthened by 221 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1279/1337 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/1337 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1131ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 835 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 67 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 58/58 places, 1279/1279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1279/1279 transitions.
Applied a total of 0 rules in 68 ms. Remains 58 /58 variables (removed 0) and now considering 1279/1279 (removed 0) transitions.
[2024-05-22 05:21:51] [INFO ] Invariant cache hit.
[2024-05-22 05:21:52] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-22 05:21:52] [INFO ] Invariant cache hit.
[2024-05-22 05:21:52] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 05:21:53] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2024-05-22 05:21:53] [INFO ] Redundant transitions in 68 ms returned []
Running 1278 sub problems to find dead transitions.
[2024-05-22 05:21:53] [INFO ] Invariant cache hit.
[2024-05-22 05:21:53] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
[2024-05-22 05:22:40] [INFO ] Deduced a trap composed of 23 places in 1317 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 58/1337 variables, and 14 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/58 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 4 (OVERLAPS) 1279/1337 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 326 constraints, problems are : Problem set: 0 solved, 1278 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1278/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 83761ms problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 83786ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85516 ms. Remains : 58/58 places, 1279/1279 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND p0 (NOT p2) (NOT p3) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND (OR p0 p3) (OR (NOT p1) p3)))), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 652 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 245 reset in 436 ms.
Product exploration explored 100000 steps with 451 reset in 408 ms.
Built C files in :
/tmp/ltsmin587800164315085638
[2024-05-22 05:23:19] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin587800164315085638
Running compilation step : cd /tmp/ltsmin587800164315085638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin587800164315085638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin587800164315085638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 19 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:23:23] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 05:23:23] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-22 05:23:23] [INFO ] Invariant cache hit.
[2024-05-22 05:23:24] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:23:24] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:23:24] [INFO ] Invariant cache hit.
[2024-05-22 05:23:24] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 84605ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 84633ms
Finished structural reductions in LTL mode , in 1 iterations and 86356 ms. Remains : 84/84 places, 1387/1387 transitions.
Built C files in :
/tmp/ltsmin4636818828064559945
[2024-05-22 05:24:49] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4636818828064559945
Running compilation step : cd /tmp/ltsmin4636818828064559945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4636818828064559945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4636818828064559945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 05:24:53] [INFO ] Flatten gal took : 262 ms
[2024-05-22 05:24:53] [INFO ] Flatten gal took : 204 ms
[2024-05-22 05:24:53] [INFO ] Time to serialize gal into /tmp/LTL17152918911786809790.gal : 79 ms
[2024-05-22 05:24:53] [INFO ] Time to serialize properties into /tmp/LTL12432868347118000815.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17152918911786809790.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14421331465547392904.hoa' '-atoms' '/tmp/LTL12432868347118000815.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12432868347118000815.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14421331465547392904.hoa
Detected timeout of ITS tools.
[2024-05-22 05:25:08] [INFO ] Flatten gal took : 180 ms
[2024-05-22 05:25:09] [INFO ] Flatten gal took : 170 ms
[2024-05-22 05:25:09] [INFO ] Time to serialize gal into /tmp/LTL12688037141794358974.gal : 28 ms
[2024-05-22 05:25:09] [INFO ] Time to serialize properties into /tmp/LTL9313924892641573616.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12688037141794358974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9313924892641573616.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))"))U((G(!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))")))||((!("(((p1==1)&&(p6==...533
Formula 0 simplified : XG(!"(((p1==0)||(p9==0))||((p47==0)||(p89==0)))" | (("(((p1==1)&&(p11==1))&&((p70==1)&&(p89==1)))" M !"(((((p17==1)&&(p27==1))&&((p3...355
Detected timeout of ITS tools.
[2024-05-22 05:25:24] [INFO ] Flatten gal took : 155 ms
[2024-05-22 05:25:24] [INFO ] Applying decomposition
[2024-05-22 05:25:24] [INFO ] Flatten gal took : 152 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16782883119779184202.txt' '-o' '/tmp/graph16782883119779184202.bin' '-w' '/tmp/graph16782883119779184202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16782883119779184202.bin' '-l' '-1' '-v' '-w' '/tmp/graph16782883119779184202.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:25:25] [INFO ] Decomposing Gal with order
[2024-05-22 05:25:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:25:26] [INFO ] Removed a total of 12316 redundant transitions.
[2024-05-22 05:25:26] [INFO ] Flatten gal took : 695 ms
[2024-05-22 05:25:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 101 ms.
[2024-05-22 05:25:26] [INFO ] Time to serialize gal into /tmp/LTL5176195428370211856.gal : 8 ms
[2024-05-22 05:25:26] [INFO ] Time to serialize properties into /tmp/LTL14363969050656451992.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5176195428370211856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14363969050656451992.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((u0.p1==1)&&(u0.p6==1))&&((u16.p63==1)&&(u0.p89==1)))"))U((G(!("(((u0.p1==1)&&(u0.p6==1))&&((u16.p63==1)&&(u0.p89==1)))"...693
Formula 0 simplified : XG(!"(((u0.p1==0)||(u0.p9==0))||((i1.u10.p47==0)||(u0.p89==0)))" | (("(((u0.p1==1)&&(u0.p11==1))&&((i1.u18.p70==1)&&(u0.p89==1)))" M...473
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 453854 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 15 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 12 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
[2024-05-22 05:25:41] [INFO ] Invariant cache hit.
[2024-05-22 05:25:41] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-22 05:25:41] [INFO ] Invariant cache hit.
[2024-05-22 05:25:42] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:25:43] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:25:43] [INFO ] Invariant cache hit.
[2024-05-22 05:25:43] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30174 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85020ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85048ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86876 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-10 finished in 86985 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' '!(((p0||F(p1)) U p2))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 89 transition count 1433
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 80 transition count 1432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 77 transition count 1430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 28 place count 73 transition count 1386
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 73 transition count 1386
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 34 place count 72 transition count 1385
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 36 place count 71 transition count 1385
Applied a total of 36 rules in 243 ms. Remains 71 /89 variables (removed 18) and now considering 1385/1442 (removed 57) transitions.
// Phase 1: matrix 1385 rows 71 cols
[2024-05-22 05:27:08] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:27:09] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-22 05:27:09] [INFO ] Invariant cache hit.
[2024-05-22 05:27:09] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-22 05:27:10] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
[2024-05-22 05:27:10] [INFO ] Redundant transitions in 104 ms returned []
Running 1384 sub problems to find dead transitions.
[2024-05-22 05:27:10] [INFO ] Invariant cache hit.
[2024-05-22 05:27:10] [INFO ] State equation strengthened by 315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1384 unsolved
SMT process timed out in 54299ms, After SMT, problems are : Problem set: 0 solved, 1384 unsolved
Search for dead transitions found 0 dead transitions in 54326ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/89 places, 1385/1442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56557 ms. Remains : 71/89 places, 1385/1442 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-12
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-10a-LTLFireability-12 finished in 56689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 16 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 89 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 79 transition count 1432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 79 transition count 1430
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 24 place count 77 transition count 1430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 72 transition count 1375
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 72 transition count 1375
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 36 place count 71 transition count 1374
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 38 place count 70 transition count 1374
Applied a total of 38 rules in 294 ms. Remains 70 /89 variables (removed 19) and now considering 1374/1442 (removed 68) transitions.
// Phase 1: matrix 1374 rows 70 cols
[2024-05-22 05:28:05] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 05:28:05] [INFO ] Implicit Places using invariants in 485 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 488 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/89 places, 1374/1442 transitions.
Applied a total of 0 rules in 159 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 942 ms. Remains : 69/89 places, 1374/1442 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-13
Product exploration explored 100000 steps with 2619 reset in 1563 ms.
Product exploration explored 100000 steps with 855 reset in 463 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2240 resets) in 1174 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 10480 steps (30 resets) in 51 ms. (201 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Support contains 11 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 162 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
// Phase 1: matrix 1374 rows 69 cols
[2024-05-22 05:28:09] [INFO ] Computed 11 invariants in 9 ms
[2024-05-22 05:28:09] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-22 05:28:09] [INFO ] Invariant cache hit.
[2024-05-22 05:28:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:28:10] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2024-05-22 05:28:10] [INFO ] Redundant transitions in 199 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-05-22 05:28:10] [INFO ] Invariant cache hit.
[2024-05-22 05:28:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/1443 variables, and 80 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1442 variables, 45/125 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/1443 variables, and 125 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 84360ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 84388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85991 ms. Remains : 69/69 places, 1374/1374 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2245 resets) in 1828 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 11712 steps (33 resets) in 52 ms. (220 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1841 reset in 1224 ms.
Product exploration explored 100000 steps with 1005 reset in 567 ms.
Built C files in :
/tmp/ltsmin6158466697466819376
[2024-05-22 05:29:38] [INFO ] Computing symmetric may disable matrix : 1374 transitions.
[2024-05-22 05:29:38] [INFO ] Computation of Complete disable matrix. took 686 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:29:38] [INFO ] Computing symmetric may enable matrix : 1374 transitions.
[2024-05-22 05:29:39] [INFO ] Computation of Complete enable matrix. took 96 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:29:39] [INFO ] Computing Do-Not-Accords matrix : 1374 transitions.
[2024-05-22 05:29:39] [INFO ] Computation of Completed DNA matrix. took 224 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:29:40] [INFO ] Built C files in 1979ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6158466697466819376
Running compilation step : cd /tmp/ltsmin6158466697466819376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6158466697466819376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6158466697466819376;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 11 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 1374/1374 transitions.
Applied a total of 0 rules in 142 ms. Remains 69 /69 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-05-22 05:29:43] [INFO ] Invariant cache hit.
[2024-05-22 05:29:43] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-22 05:29:43] [INFO ] Invariant cache hit.
[2024-05-22 05:29:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:29:45] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
[2024-05-22 05:29:45] [INFO ] Redundant transitions in 94 ms returned []
Running 1373 sub problems to find dead transitions.
[2024-05-22 05:29:45] [INFO ] Invariant cache hit.
[2024-05-22 05:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/1443 variables, and 80 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1442 variables, 69/80 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1442 variables, 45/125 constraints. Problems are: Problem set: 0 solved, 1373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/1443 variables, and 125 constraints, problems are : Problem set: 0 solved, 1373 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1373/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 85028ms problems are : Problem set: 0 solved, 1373 unsolved
Search for dead transitions found 0 dead transitions in 85055ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 87113 ms. Remains : 69/69 places, 1374/1374 transitions.
Built C files in :
/tmp/ltsmin11616291246961553425
[2024-05-22 05:31:10] [INFO ] Computing symmetric may disable matrix : 1374 transitions.
[2024-05-22 05:31:10] [INFO ] Computation of Complete disable matrix. took 450 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:31:10] [INFO ] Computing symmetric may enable matrix : 1374 transitions.
[2024-05-22 05:31:10] [INFO ] Computation of Complete enable matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:31:11] [INFO ] Computing Do-Not-Accords matrix : 1374 transitions.
[2024-05-22 05:31:11] [INFO ] Computation of Completed DNA matrix. took 194 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:31:11] [INFO ] Built C files in 1521ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11616291246961553425
Running compilation step : cd /tmp/ltsmin11616291246961553425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11616291246961553425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11616291246961553425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 05:31:15] [INFO ] Flatten gal took : 196 ms
[2024-05-22 05:31:15] [INFO ] Flatten gal took : 196 ms
[2024-05-22 05:31:15] [INFO ] Time to serialize gal into /tmp/LTL18064460992659882099.gal : 29 ms
[2024-05-22 05:31:15] [INFO ] Time to serialize properties into /tmp/LTL10611477641002458226.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18064460992659882099.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17722514569064874837.hoa' '-atoms' '/tmp/LTL10611477641002458226.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10611477641002458226.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17722514569064874837.hoa
Detected timeout of ITS tools.
[2024-05-22 05:31:30] [INFO ] Flatten gal took : 318 ms
[2024-05-22 05:31:31] [INFO ] Flatten gal took : 317 ms
[2024-05-22 05:31:31] [INFO ] Time to serialize gal into /tmp/LTL3928879905638058607.gal : 24 ms
[2024-05-22 05:31:31] [INFO ] Time to serialize properties into /tmp/LTL14785121589342007937.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3928879905638058607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14785121589342007937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((p17==0)||(p27==0))||((p34==0)||(p41==0)))||(((p48==0)||(p52==0))||((p62==0)||(p66==0))))||(((p76==0)||(p80==0))||(p90==0))...301
Formula 0 simplified : G!"(((((p17==0)||(p27==0))||((p34==0)||(p41==0)))||(((p48==0)||(p52==0))||((p62==0)||(p66==0))))||(((p76==0)||(p80==0))||(p90==0)))"...291
Detected timeout of ITS tools.
[2024-05-22 05:31:46] [INFO ] Flatten gal took : 187 ms
[2024-05-22 05:31:46] [INFO ] Applying decomposition
[2024-05-22 05:31:46] [INFO ] Flatten gal took : 188 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14979097142652199994.txt' '-o' '/tmp/graph14979097142652199994.bin' '-w' '/tmp/graph14979097142652199994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14979097142652199994.bin' '-l' '-1' '-v' '-w' '/tmp/graph14979097142652199994.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:31:47] [INFO ] Decomposing Gal with order
[2024-05-22 05:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:31:47] [INFO ] Removed a total of 12319 redundant transitions.
[2024-05-22 05:31:47] [INFO ] Flatten gal took : 461 ms
[2024-05-22 05:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 82 ms.
[2024-05-22 05:31:47] [INFO ] Time to serialize gal into /tmp/LTL3196784762277006683.gal : 8 ms
[2024-05-22 05:31:47] [INFO ] Time to serialize properties into /tmp/LTL13627481641405716321.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3196784762277006683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13627481641405716321.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(((((i3.u0.p17==0)||(i3.u3.p27==0))||((u5.p34==0)||(u7.p41==0)))||(((u9.p48==0)||(i3.u10.p52==0))||((u13.p62==0)||(i3.u14.p66==...413
Formula 0 simplified : G!"(((((i3.u0.p17==0)||(i3.u3.p27==0))||((u5.p34==0)||(u7.p41==0)))||(((u9.p48==0)||(i3.u10.p52==0))||((u13.p62==0)||(i3.u14.p66==0)...403
Reverse transition relation is NOT exact ! Due to transitions t917, t918, t919, t920, t921, t922, t923, t924, t925, t926, t927, t928, t929, t930, t931, t93...3929
Computing Next relation with stutter on 1.29803e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10a-LTLFireability-13 finished in 237848 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&&X((p1&&F((G(F(!p2))||(!p3&&F(!p2)))))))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 84 transition count 1387
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 84 transition count 1387
Applied a total of 10 rules in 19 ms. Remains 84 /89 variables (removed 5) and now considering 1387/1442 (removed 55) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:32:02] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 05:32:03] [INFO ] Implicit Places using invariants in 539 ms returned []
[2024-05-22 05:32:03] [INFO ] Invariant cache hit.
[2024-05-22 05:32:04] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:32:04] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:32:04] [INFO ] Invariant cache hit.
[2024-05-22 05:32:04] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
SMT process timed out in 54449ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 54478ms
Starting structural reductions in LTL mode, iteration 1 : 84/89 places, 1387/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56378 ms. Remains : 84/89 places, 1387/1442 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 7362 ms.
Product exploration explored 100000 steps with 25000 reset in 7361 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) p2), p2, p2]
RANDOM walk for 40000 steps (1851 resets) in 2274 ms. (17 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (99 resets) in 331 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (129 resets) in 428 ms. (93 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (110 resets) in 391 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (99 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (100 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
[2024-05-22 05:33:16] [INFO ] Invariant cache hit.
[2024-05-22 05:33:16] [INFO ] State equation strengthened by 303 read => feed constraints.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 1 solved, 3 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/76 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1380/1456 variables, 76/88 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1456 variables, 302/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1456 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/1469 variables, 7/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1469 variables, 0/397 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1470 variables, 1/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2374ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1055 ms.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 1373
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 73 transition count 1371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 71 transition count 1370
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 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 69 transition count 1369
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 66 transition count 1366
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 66 transition count 1358
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 134 place count 58 transition count 1278
Applied a total of 134 rules in 257 ms. Remains 58 /84 variables (removed 26) and now considering 1278/1387 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 58/84 places, 1278/1387 transitions.
RANDOM walk for 40000 steps (25 resets) in 2047 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 329499 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 2
Probabilistic random walk after 329499 steps, saw 51632 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
// Phase 1: matrix 1278 rows 58 cols
[2024-05-22 05:33:23] [INFO ] Computed 14 invariants in 11 ms
[2024-05-22 05:33:23] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1363ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 899 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 139 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 138 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 05:33:26] [INFO ] Invariant cache hit.
[2024-05-22 05:33:27] [INFO ] Implicit Places using invariants in 985 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 988 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 83 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1210 ms. Remains : 57/58 places, 1278/1278 transitions.
RANDOM walk for 40000 steps (45 resets) in 2591 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (101 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 322085 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 2
Probabilistic random walk after 322085 steps, saw 50526 distinct states, run finished after 3004 ms. (steps per millisecond=107 ) properties seen :0
// Phase 1: matrix 1278 rows 57 cols
[2024-05-22 05:33:30] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:33:30] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1551ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 928 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 92 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 05:33:33] [INFO ] Invariant cache hit.
[2024-05-22 05:33:34] [INFO ] Implicit Places using invariants in 965 ms returned []
[2024-05-22 05:33:34] [INFO ] Invariant cache hit.
[2024-05-22 05:33:35] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 05:33:35] [INFO ] Implicit Places using invariants and state equation in 1307 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
[2024-05-22 05:33:35] [INFO ] Redundant transitions in 70 ms returned []
Running 1277 sub problems to find dead transitions.
[2024-05-22 05:33:36] [INFO ] Invariant cache hit.
[2024-05-22 05:33:36] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
[2024-05-22 05:34:22] [INFO ] Deduced a trap composed of 23 places in 1539 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 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 Real declared 57/1335 variables, and 14 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/57 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 4 (OVERLAPS) 1278/1335 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1335 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 32/324 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 324 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 83230ms problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 83256ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85708 ms. Remains : 57/57 places, 1278/1278 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (X p0)), (G (OR p1 p0)), (G (OR (NOT p1) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F p3), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 204 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 84 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:34:59] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 05:35:00] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-22 05:35:00] [INFO ] Invariant cache hit.
[2024-05-22 05:35:01] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:35:01] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:35:01] [INFO ] Invariant cache hit.
[2024-05-22 05:35:01] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30250 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 85102ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 85130ms
Finished structural reductions in LTL mode , in 1 iterations and 87013 ms. Remains : 84/84 places, 1387/1387 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
RANDOM walk for 40000 steps (1836 resets) in 3328 ms. (12 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (98 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2024-05-22 05:36:28] [INFO ] Invariant cache hit.
[2024-05-22 05:36:28] [INFO ] State equation strengthened by 303 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1453 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 302/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1453 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1466 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1466 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1470 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1378/1453 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1453 variables, 302/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1453 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1466 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1466 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1470 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1470 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1471 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1471 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1471/1471 variables, and 399 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 303/303 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2263ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 739 ms.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Graph (complete) has 1126 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 1373
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 73 transition count 1371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 71 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 71 transition count 1370
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 70 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 69 transition count 1369
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 69 transition count 1369
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 66 transition count 1366
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 46 place count 66 transition count 1358
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 88 rules applied. Total rules applied 134 place count 58 transition count 1278
Applied a total of 134 rules in 265 ms. Remains 58 /84 variables (removed 26) and now considering 1278/1387 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 58/84 places, 1278/1387 transitions.
RANDOM walk for 40000 steps (28 resets) in 2719 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 311093 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 311093 steps, saw 48789 distinct states, run finished after 3004 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 1278 rows 58 cols
[2024-05-22 05:36:35] [INFO ] Computed 14 invariants in 7 ms
[2024-05-22 05:36:35] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/58 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1336 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1336 variables, 221/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1336 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 293 constraints, problems are : Problem set: 0 solved, 2 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 58/58 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1497ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 963 ms.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 58/58 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 81 ms. Remains 58 /58 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 05:36:38] [INFO ] Invariant cache hit.
[2024-05-22 05:36:38] [INFO ] Implicit Places using invariants in 614 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 618 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1278/1278 transitions.
Applied a total of 0 rules in 139 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 840 ms. Remains : 57/58 places, 1278/1278 transitions.
RANDOM walk for 40000 steps (22 resets) in 2455 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (96 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 311983 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 311983 steps, saw 48904 distinct states, run finished after 3003 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 1278 rows 57 cols
[2024-05-22 05:36:42] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:36:42] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1278/1335 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 221/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1335 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1007 ms.
Support contains 6 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 81 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 57/57 places, 1278/1278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1278/1278 transitions.
Applied a total of 0 rules in 82 ms. Remains 57 /57 variables (removed 0) and now considering 1278/1278 (removed 0) transitions.
[2024-05-22 05:36:45] [INFO ] Invariant cache hit.
[2024-05-22 05:36:45] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-05-22 05:36:45] [INFO ] Invariant cache hit.
[2024-05-22 05:36:46] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-22 05:36:46] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2024-05-22 05:36:47] [INFO ] Redundant transitions in 69 ms returned []
Running 1277 sub problems to find dead transitions.
[2024-05-22 05:36:47] [INFO ] Invariant cache hit.
[2024-05-22 05:36:47] [INFO ] State equation strengthened by 221 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
[2024-05-22 05:37:31] [INFO ] Deduced a trap composed of 23 places in 1248 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 57/1335 variables, and 14 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/57 constraints, ReadFeed: 0/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 4 (OVERLAPS) 1278/1335 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1335 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1335 variables, 32/324 constraints. Problems are: Problem set: 0 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1335/1335 variables, and 324 constraints, problems are : Problem set: 0 solved, 1277 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 1277/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 83451ms problems are : Problem set: 0 solved, 1277 unsolved
Search for dead transitions found 0 dead transitions in 83477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85605 ms. Remains : 57/57 places, 1278/1278 transitions.
Knowledge obtained : [(AND (NOT p2) p1)]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 185 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 210 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 25000 reset in 8028 ms.
Product exploration explored 100000 steps with 25000 reset in 7216 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 1387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 12 place count 84 transition count 1389
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 84 transition count 1389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 83 transition count 1388
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 83 transition count 1388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 83 transition count 1391
Deduced a syphon composed of 15 places in 1 ms
Applied a total of 18 rules in 308 ms. Remains 83 /84 variables (removed 1) and now considering 1391/1387 (removed -4) transitions.
[2024-05-22 05:38:27] [INFO ] Redundant transitions in 82 ms returned []
Running 1390 sub problems to find dead transitions.
// Phase 1: matrix 1391 rows 83 cols
[2024-05-22 05:38:27] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 05:38:27] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-22 05:39:04] [INFO ] Deduced a trap composed of 6 places in 864 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 05:39:05] [INFO ] Deduced a trap composed of 6 places in 1089 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-22 05:39:07] [INFO ] Deduced a trap composed of 6 places in 1182 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-22 05:39:08] [INFO ] Deduced a trap composed of 6 places in 1185 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 05:39:09] [INFO ] Deduced a trap composed of 6 places in 1037 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 05:39:10] [INFO ] Deduced a trap composed of 6 places in 999 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-22 05:39:11] [INFO ] Deduced a trap composed of 6 places in 898 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-22 05:39:12] [INFO ] Deduced a trap composed of 6 places in 793 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-22 05:39:12] [INFO ] Deduced a trap composed of 6 places in 784 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-22 05:39:13] [INFO ] Deduced a trap composed of 6 places in 767 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-22 05:39:13] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 83/1474 variables, and 23 constraints, problems are : Problem set: 11 solved, 1379 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/83 constraints, ReadFeed: 0/307 constraints, PredecessorRefiner: 1390/60 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 1 (OVERLAPS) 12/83 variables, 12/12 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 11/23 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 11 solved, 1379 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
At refinement iteration 4 (OVERLAPS) 1390/1473 variables, 83/106 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1473 variables, 306/412 constraints. Problems are: Problem set: 19 solved, 1371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1473/1474 variables, and 455 constraints, problems are : Problem set: 19 solved, 1371 unsolved in 30243 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 306/307 constraints, PredecessorRefiner: 1373/60 constraints, Known Traps: 11/11 constraints]
After SMT, in 84568ms problems are : Problem set: 19 solved, 1371 unsolved
Search for dead transitions found 19 dead transitions in 84592ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 83/84 places, 1372/1387 transitions.
Graph (complete) has 1161 edges and 83 vertex of which 68 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.10 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 258 ms. Remains 68 /83 variables (removed 15) and now considering 1372/1372 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/84 places, 1372/1387 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85253 ms. Remains : 68/84 places, 1372/1387 transitions.
Built C files in :
/tmp/ltsmin13997345004453828794
[2024-05-22 05:39:52] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13997345004453828794
Running compilation step : cd /tmp/ltsmin13997345004453828794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13997345004453828794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13997345004453828794;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 1387/1387 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:39:55] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 05:39:55] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-05-22 05:39:55] [INFO ] Invariant cache hit.
[2024-05-22 05:39:56] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:39:57] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:39:57] [INFO ] Invariant cache hit.
[2024-05-22 05:39:57] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30158 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 84317ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 84346ms
Finished structural reductions in LTL mode , in 1 iterations and 86602 ms. Remains : 84/84 places, 1387/1387 transitions.
Built C files in :
/tmp/ltsmin15488350257990895610
[2024-05-22 05:41:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15488350257990895610
Running compilation step : cd /tmp/ltsmin15488350257990895610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15488350257990895610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15488350257990895610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 05:41:25] [INFO ] Flatten gal took : 238 ms
[2024-05-22 05:41:25] [INFO ] Flatten gal took : 238 ms
[2024-05-22 05:41:25] [INFO ] Time to serialize gal into /tmp/LTL1511286998186202324.gal : 38 ms
[2024-05-22 05:41:25] [INFO ] Time to serialize properties into /tmp/LTL4945285102516668851.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1511286998186202324.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12047476320214994771.hoa' '-atoms' '/tmp/LTL4945285102516668851.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4945285102516668851.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12047476320214994771.hoa
Detected timeout of ITS tools.
[2024-05-22 05:41:40] [INFO ] Flatten gal took : 199 ms
[2024-05-22 05:41:41] [INFO ] Flatten gal took : 244 ms
[2024-05-22 05:41:41] [INFO ] Time to serialize gal into /tmp/LTL13195880068085906465.gal : 38 ms
[2024-05-22 05:41:41] [INFO ] Time to serialize properties into /tmp/LTL15456205386174162538.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13195880068085906465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15456205386174162538.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((p1==0)||(p12==0))||((p54==0)||(p89==0)))")&&(F((G(F("(((p1!=1)||(p5!=1))||((p19!=1)||(p89!=1)))")))||(("(((p1!=1)||(p...382
Formula 0 simplified : XXG(!"(((((p17==0)||(p27==0))||((p31==0)||(p38==0)))||(((p45==0)||(p55==0))||((p59==0)||(p69==0))))||(((p73==0)||(p80==0))||(p90==0)...364
Detected timeout of ITS tools.
[2024-05-22 05:41:56] [INFO ] Flatten gal took : 140 ms
[2024-05-22 05:41:56] [INFO ] Applying decomposition
[2024-05-22 05:41:56] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10419096620146349902.txt' '-o' '/tmp/graph10419096620146349902.bin' '-w' '/tmp/graph10419096620146349902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10419096620146349902.bin' '-l' '-1' '-v' '-w' '/tmp/graph10419096620146349902.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:41:56] [INFO ] Decomposing Gal with order
[2024-05-22 05:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:41:57] [INFO ] Removed a total of 12828 redundant transitions.
[2024-05-22 05:41:57] [INFO ] Flatten gal took : 273 ms
[2024-05-22 05:41:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 97 ms.
[2024-05-22 05:41:57] [INFO ] Time to serialize gal into /tmp/LTL4910481771131806721.gal : 14 ms
[2024-05-22 05:41:57] [INFO ] Time to serialize properties into /tmp/LTL522192976204514003.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4910481771131806721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL522192976204514003.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((u0.p1==0)||(u0.p12==0))||((i8.u12.p54==0)||(u0.p89==0)))")&&(F((G(F("(((u0.p1!=1)||(u0.p5!=1))||((u2.p19!=1)||(u0.p89...504
Formula 0 simplified : XXG(!"(((((i8.u1.p17==0)||(u4.p27==0))||((i8.u5.p31==0)||(i8.u7.p38==0)))||(((i8.u9.p45==0)||(i8.u12.p55==0))||((i8.u13.p59==0)||(u1...486
Reverse transition relation is NOT exact ! Due to transitions t413, t414, t415, t416, t417, t418, t419, t420, t429, t430, t431, t432, t433, t434, t435, t43...2070
Computing Next relation with stutter on 1.29803e+06 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
1398 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.0419,296480,1,0,321631,2065,13508,2.51451e+06,465,14041,682508
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutonomousCar-PT-10a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10a-LTLFireability-14 finished in 609521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
Support contains 17 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 1442/1442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 85 transition count 1398
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 85 transition count 1398
Applied a total of 8 rules in 11 ms. Remains 85 /89 variables (removed 4) and now considering 1398/1442 (removed 44) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-22 05:42:12] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:42:12] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-22 05:42:12] [INFO ] Invariant cache hit.
[2024-05-22 05:42:13] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-22 05:42:14] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-05-22 05:42:14] [INFO ] Invariant cache hit.
[2024-05-22 05:42:14] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1482/1483 variables, and 97 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 0/313 constraints, PredecessorRefiner: 1397/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1482 variables, 312/409 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1482/1483 variables, and 470 constraints, problems are : Problem set: 0 solved, 1397 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 312/313 constraints, PredecessorRefiner: 1397/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 84789ms problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 84817ms
Starting structural reductions in LTL mode, iteration 1 : 85/89 places, 1398/1442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86536 ms. Remains : 85/89 places, 1398/1442 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-15
Product exploration explored 100000 steps with 16624 reset in 5147 ms.
Product exploration explored 100000 steps with 16727 reset in 5193 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (1837 resets) in 2153 ms. (18 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (101 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (123 resets) in 378 ms. (105 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (100 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (103 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
[2024-05-22 05:43:51] [INFO ] Invariant cache hit.
[2024-05-22 05:43:51] [INFO ] State equation strengthened by 313 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 1 solved, 2 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2076ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 720 ms.
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 73 transition count 1382
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 28 place count 72 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 1381
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 1381
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 36 place count 68 transition count 1378
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 68 transition count 1367
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 101 rules applied. Total rules applied 148 place count 57 transition count 1277
Applied a total of 148 rules in 425 ms. Remains 57 /85 variables (removed 28) and now considering 1277/1398 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 57/85 places, 1277/1398 transitions.
RANDOM walk for 40000 steps (11 resets) in 2197 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (28 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 412123 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 2
Probabilistic random walk after 412123 steps, saw 49635 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
// Phase 1: matrix 1277 rows 57 cols
[2024-05-22 05:43:58] [INFO ] Computed 14 invariants in 13 ms
[2024-05-22 05:43:58] [INFO ] State equation strengthened by 221 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1277/1334 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1334/1334 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1277/1334 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1334 variables, 221/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1334 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1334/1334 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 221/221 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1759ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 6752 steps, including 971 resets, run visited all 2 properties in 706 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 705 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (OR p1 p2))), (F p0)]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
// Phase 1: matrix 1398 rows 85 cols
[2024-05-22 05:44:01] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 05:44:01] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-22 05:44:01] [INFO ] Invariant cache hit.
[2024-05-22 05:44:02] [INFO ] State equation strengthened by 313 read => feed constraints.
[2024-05-22 05:44:02] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
Running 1397 sub problems to find dead transitions.
[2024-05-22 05:44:02] [INFO ] Invariant cache hit.
[2024-05-22 05:44:02] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
At refinement iteration 3 (OVERLAPS) 1397/1482 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 1397 unsolved
SMT process timed out in 54387ms, After SMT, problems are : Problem set: 0 solved, 1397 unsolved
Search for dead transitions found 0 dead transitions in 54415ms
Finished structural reductions in LTL mode , in 1 iterations and 55885 ms. Remains : 85/85 places, 1398/1398 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (1840 resets) in 2541 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (118 resets) in 182 ms. (218 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (103 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-05-22 05:44:58] [INFO ] Invariant cache hit.
[2024-05-22 05:44:58] [INFO ] State equation strengthened by 313 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/76 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1389/1465 variables, 76/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1465 variables, 312/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1465 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/1478 variables, 5/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1478 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/1482 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1482 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1483 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1483 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1483/1483 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 85/85 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1638ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 727 ms.
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Graph (complete) has 1138 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 84 transition count 1383
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 73 transition count 1383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 73 transition count 1382
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 72 transition count 1382
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 70 transition count 1370
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 70 transition count 1370
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 67 transition count 1367
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 67 transition count 1357
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 148 place count 57 transition count 1267
Applied a total of 148 rules in 245 ms. Remains 57 /85 variables (removed 28) and now considering 1267/1398 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 57/85 places, 1267/1398 transitions.
RANDOM walk for 40000 steps (16 resets) in 971 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (28 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 529197 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 529197 steps, saw 75708 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 1267 rows 57 cols
[2024-05-22 05:45:04] [INFO ] Computed 14 invariants in 6 ms
[2024-05-22 05:45:04] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1324 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/57 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1324 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 211/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1324 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1208ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 697 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 79 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 57/57 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 95 ms. Remains 57 /57 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-05-22 05:45:06] [INFO ] Invariant cache hit.
[2024-05-22 05:45:07] [INFO ] Implicit Places using invariants in 653 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 657 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 56/57 places, 1267/1267 transitions.
Applied a total of 0 rules in 135 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 890 ms. Remains : 56/57 places, 1267/1267 transitions.
RANDOM walk for 40000 steps (13 resets) in 1390 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (28 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 493588 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 493588 steps, saw 70962 distinct states, run finished after 3004 ms. (steps per millisecond=164 ) properties seen :0
// Phase 1: matrix 1267 rows 56 cols
[2024-05-22 05:45:10] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 05:45:10] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1267/1323 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 211/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1323 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1273ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 719 ms.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 81 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 56/56 places, 1267/1267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 1267/1267 transitions.
Applied a total of 0 rules in 81 ms. Remains 56 /56 variables (removed 0) and now considering 1267/1267 (removed 0) transitions.
[2024-05-22 05:45:12] [INFO ] Invariant cache hit.
[2024-05-22 05:45:13] [INFO ] Implicit Places using invariants in 880 ms returned []
[2024-05-22 05:45:13] [INFO ] Invariant cache hit.
[2024-05-22 05:45:14] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-05-22 05:45:15] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2548 ms to find 0 implicit places.
[2024-05-22 05:45:15] [INFO ] Redundant transitions in 41 ms returned []
Running 1266 sub problems to find dead transitions.
[2024-05-22 05:45:15] [INFO ] Invariant cache hit.
[2024-05-22 05:45:15] [INFO ] State equation strengthened by 211 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
[2024-05-22 05:45:57] [INFO ] Deduced a trap composed of 23 places in 1278 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 56/1323 variables, and 14 constraints, problems are : Problem set: 0 solved, 1266 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/56 constraints, ReadFeed: 0/211 constraints, PredecessorRefiner: 1266/31 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 4 (OVERLAPS) 1267/1323 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1323 variables, 211/281 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 31/312 constraints. Problems are: Problem set: 0 solved, 1266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 312 constraints, problems are : Problem set: 0 solved, 1266 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 56/56 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 1266/31 constraints, Known Traps: 1/1 constraints]
After SMT, in 83676ms problems are : Problem set: 0 solved, 1266 unsolved
Search for dead transitions found 0 dead transitions in 83691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86374 ms. Remains : 56/56 places, 1267/1267 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16648 reset in 5399 ms.
Product exploration explored 100000 steps with 16676 reset in 5132 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 85 transition count 1398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 9 place count 85 transition count 1400
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 85 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 1389
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 84 transition count 1389
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 84 transition count 1392
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 15 rules in 281 ms. Remains 84 /85 variables (removed 1) and now considering 1392/1398 (removed 6) transitions.
[2024-05-22 05:46:51] [INFO ] Redundant transitions in 99 ms returned []
Running 1391 sub problems to find dead transitions.
// Phase 1: matrix 1392 rows 84 cols
[2024-05-22 05:46:51] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 05:46:51] [INFO ] State equation strengthened by 307 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1391 unsolved
[2024-05-22 05:47:31] [INFO ] Deduced a trap composed of 6 places in 1499 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-22 05:47:32] [INFO ] Deduced a trap composed of 6 places in 1314 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 05:47:33] [INFO ] Deduced a trap composed of 6 places in 1191 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 05:47:34] [INFO ] Deduced a trap composed of 6 places in 1058 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-22 05:47:35] [INFO ] Deduced a trap composed of 6 places in 977 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-22 05:47:36] [INFO ] Deduced a trap composed of 6 places in 934 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-22 05:47:37] [INFO ] Deduced a trap composed of 6 places in 1083 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-22 05:47:39] [INFO ] Deduced a trap composed of 6 places in 1192 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-22 05:47:40] [INFO ] Deduced a trap composed of 6 places in 1118 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-22 05:47:44] [INFO ] Deduced a trap composed of 12 places in 476 ms of which 2 ms to minimize.
Problem TDEAD335 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1476 variables, and 22 constraints, problems are : Problem set: 10 solved, 1381 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/307 constraints, PredecessorRefiner: 1391/61 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 1 (OVERLAPS) 11/84 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 10/22 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/22 constraints. Problems are: Problem set: 10 solved, 1381 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
At refinement iteration 4 (OVERLAPS) 1391/1475 variables, 84/106 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 306/412 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 46/458 constraints. Problems are: Problem set: 17 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1475/1476 variables, and 458 constraints, problems are : Problem set: 17 solved, 1374 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 306/307 constraints, PredecessorRefiner: 1376/61 constraints, Known Traps: 10/10 constraints]
After SMT, in 85268ms problems are : Problem set: 17 solved, 1374 unsolved
Search for dead transitions found 17 dead transitions in 85295ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 1375/1398 transitions.
Graph (complete) has 1162 edges and 84 vertex of which 71 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.6 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 112 ms. Remains 71 /84 variables (removed 13) and now considering 1375/1375 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/85 places, 1375/1398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85802 ms. Remains : 71/85 places, 1375/1398 transitions.
Built C files in :
/tmp/ltsmin565564217016244543
[2024-05-22 05:48:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin565564217016244543
Running compilation step : cd /tmp/ltsmin565564217016244543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin565564217016244543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin565564217016244543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 15 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 1398/1398 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 1387
Applied a total of 2 rules in 11 ms. Remains 84 /85 variables (removed 1) and now considering 1387/1398 (removed 11) transitions.
// Phase 1: matrix 1387 rows 84 cols
[2024-05-22 05:48:19] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 05:48:19] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-22 05:48:19] [INFO ] Invariant cache hit.
[2024-05-22 05:48:20] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-22 05:48:20] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
Running 1386 sub problems to find dead transitions.
[2024-05-22 05:48:20] [INFO ] Invariant cache hit.
[2024-05-22 05:48:20] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 84/1471 variables, and 12 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 0/84 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 3 (OVERLAPS) 1386/1470 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1470 variables, 302/398 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1470/1471 variables, and 458 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 30188 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 84/84 constraints, ReadFeed: 302/303 constraints, PredecessorRefiner: 1386/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 84418ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 84446ms
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 1387/1398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85739 ms. Remains : 84/85 places, 1387/1398 transitions.
Built C files in :
/tmp/ltsmin9603795724787901335
[2024-05-22 05:49:45] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9603795724787901335
Running compilation step : cd /tmp/ltsmin9603795724787901335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9603795724787901335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9603795724787901335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 05:49:48] [INFO ] Flatten gal took : 146 ms
[2024-05-22 05:49:48] [INFO ] Flatten gal took : 236 ms
[2024-05-22 05:49:48] [INFO ] Time to serialize gal into /tmp/LTL4103061639316303760.gal : 37 ms
[2024-05-22 05:49:48] [INFO ] Time to serialize properties into /tmp/LTL12111542445537886131.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4103061639316303760.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2303881883819081365.hoa' '-atoms' '/tmp/LTL12111542445537886131.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12111542445537886131.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2303881883819081365.hoa
Detected timeout of ITS tools.
[2024-05-22 05:50:04] [INFO ] Flatten gal took : 138 ms
[2024-05-22 05:50:04] [INFO ] Flatten gal took : 142 ms
[2024-05-22 05:50:04] [INFO ] Time to serialize gal into /tmp/LTL8791448264330314180.gal : 23 ms
[2024-05-22 05:50:04] [INFO ] Time to serialize properties into /tmp/LTL14551661513683128562.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8791448264330314180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14551661513683128562.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((X((X(X("(((p1==0)||(p6==0))||((p28==0)||(p89==0)))")))||(G("(((p1==1)&&(p5==1))&&((p30==1)&&(p89==1)))"))))||("(((((p20==1)&&(...274
Formula 0 simplified : XF(!"(((((p20==1)&&(p24==1))&&((p34==1)&&(p38==1)))&&(((p45==1)&&(p52==1))&&((p59==1)&&(p66==1))))&&(((p76==1)&&(p83==1))&&(p90==1))...260
Detected timeout of ITS tools.
[2024-05-22 05:50:19] [INFO ] Flatten gal took : 136 ms
[2024-05-22 05:50:19] [INFO ] Applying decomposition
[2024-05-22 05:50:19] [INFO ] Flatten gal took : 141 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3555360074824574707.txt' '-o' '/tmp/graph3555360074824574707.bin' '-w' '/tmp/graph3555360074824574707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3555360074824574707.bin' '-l' '-1' '-v' '-w' '/tmp/graph3555360074824574707.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:50:20] [INFO ] Decomposing Gal with order
[2024-05-22 05:50:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:50:20] [INFO ] Removed a total of 12423 redundant transitions.
[2024-05-22 05:50:20] [INFO ] Flatten gal took : 356 ms
[2024-05-22 05:50:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 105 ms.
[2024-05-22 05:50:20] [INFO ] Time to serialize gal into /tmp/LTL9872120834977175949.gal : 13 ms
[2024-05-22 05:50:20] [INFO ] Time to serialize properties into /tmp/LTL3638869499931442149.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9872120834977175949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3638869499931442149.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X((X(X("(((u28.p1==0)||(u28.p6==0))||((i4.u6.p28==0)||(u28.p89==0)))")))||(G("(((u28.p1==1)&&(u28.p5==1))&&((i1.u7.p30==1)&&(u...383
Formula 0 simplified : XF(!"(((((i2.u2.p20==1)&&(i1.u4.p24==1))&&((i4.u8.p34==1)&&(i1.u10.p38==1)))&&(((i1.u12.p45==1)&&(i1.u15.p52==1))&&((i1.u18.p59==1)&...369
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10a-LTLFireability-15 finished in 503368 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&&(!p1 U (G(!p1)||(!p1&&(!p2 U (p3||G(!p2))))))))))'
Found a Shortening insensitive property : AutonomousCar-PT-10a-LTLFireability-09
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
Support contains 19 out of 89 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 89/89 places, 1442/1442 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 7 rules applied. Total rules applied 7 place count 89 transition count 1435
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 82 transition count 1434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 81 transition count 1434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 81 transition count 1432
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 79 transition count 1432
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 74 transition count 1377
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 74 transition count 1377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 73 transition count 1376
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 3 with 2 rules applied. Total rules applied 34 place count 72 transition count 1376
Applied a total of 34 rules in 178 ms. Remains 72 /89 variables (removed 17) and now considering 1376/1442 (removed 66) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-22 05:50:36] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 05:50:36] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-22 05:50:36] [INFO ] Invariant cache hit.
[2024-05-22 05:50:37] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 05:50:37] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-05-22 05:50:37] [INFO ] Invariant cache hit.
[2024-05-22 05:50:37] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 55444ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 55463ms
Starting structural reductions in LI_LTL mode, iteration 1 : 72/89 places, 1376/1442 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56963 ms. Remains : 72/89 places, 1376/1442 transitions.
Running random walk in product with property : AutonomousCar-PT-10a-LTLFireability-09
Product exploration explored 100000 steps with 385 reset in 375 ms.
Product exploration explored 100000 steps with 4872 reset in 2469 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) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 113 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3)))]
RANDOM walk for 40000 steps (2153 resets) in 1949 ms. (20 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (110 resets) in 463 ms. (86 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (50 resets) in 508 ms. (78 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 386 ms. (103 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (109 resets) in 430 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (115 resets) in 395 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (111 resets) in 495 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (109 resets) in 471 ms. (84 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (111 resets) in 406 ms. (98 steps per ms) remains 7/7 properties
[2024-05-22 05:51:38] [INFO ] Invariant cache hit.
[2024-05-22 05:51:38] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1846 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3187ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3002 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 70 transition count 1362
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 93 place count 61 transition count 1292
Applied a total of 93 rules in 196 ms. Remains 61 /72 variables (removed 11) and now considering 1292/1376 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 61/72 places, 1292/1376 transitions.
RANDOM walk for 40000 steps (681 resets) in 4109 ms. (9 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (69 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
// Phase 1: matrix 1292 rows 61 cols
[2024-05-22 05:51:45] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 05:51:45] [INFO ] State equation strengthened by 232 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1608ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 661 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1281
Applied a total of 12 rules in 145 ms. Remains 60 /61 variables (removed 1) and now considering 1281/1292 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 60/61 places, 1281/1292 transitions.
RANDOM walk for 40000 steps (469 resets) in 2265 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 318606 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 2
Probabilistic random walk after 318606 steps, saw 48484 distinct states, run finished after 3002 ms. (steps per millisecond=106 ) properties seen :0
// Phase 1: matrix 1281 rows 60 cols
[2024-05-22 05:51:51] [INFO ] Computed 13 invariants in 12 ms
[2024-05-22 05:51:51] [INFO ] State equation strengthened by 222 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1281/1340 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1340 variables, 222/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1340 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1341 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1341 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1341/1341 variables, and 295 constraints, problems are : Problem set: 0 solved, 2 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 631 ms.
Support contains 17 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 71 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 60/60 places, 1281/1281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1281/1281 transitions.
Applied a total of 0 rules in 69 ms. Remains 60 /60 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2024-05-22 05:51:54] [INFO ] Invariant cache hit.
[2024-05-22 05:51:54] [INFO ] Implicit Places using invariants in 294 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 296 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/60 places, 1281/1281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 1280
Applied a total of 2 rules in 85 ms. Remains 58 /59 variables (removed 1) and now considering 1280/1281 (removed 1) transitions.
// Phase 1: matrix 1280 rows 58 cols
[2024-05-22 05:51:54] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 05:51:54] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-22 05:51:54] [INFO ] Invariant cache hit.
[2024-05-22 05:51:55] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-22 05:51:55] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/60 places, 1280/1281 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1510 ms. Remains : 58/60 places, 1280/1281 transitions.
RANDOM walk for 40000 steps (476 resets) in 2352 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (50 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (55 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 365291 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 365291 steps, saw 55503 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-22 05:51:59] [INFO ] Invariant cache hit.
[2024-05-22 05:51:59] [INFO ] State equation strengthened by 222 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/57 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1280/1337 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 222/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1337 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/1338 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1338 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1338/1338 variables, and 292 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 58/58 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1601ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 809 ms.
Support contains 17 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 77 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 58/58 places, 1280/1280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1280/1280 transitions.
Applied a total of 0 rules in 75 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
[2024-05-22 05:52:02] [INFO ] Invariant cache hit.
[2024-05-22 05:52:02] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-22 05:52:02] [INFO ] Invariant cache hit.
[2024-05-22 05:52:02] [INFO ] State equation strengthened by 222 read => feed constraints.
[2024-05-22 05:52:03] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
[2024-05-22 05:52:03] [INFO ] Redundant transitions in 43 ms returned []
Running 1279 sub problems to find dead transitions.
[2024-05-22 05:52:03] [INFO ] Invariant cache hit.
[2024-05-22 05:52:03] [INFO ] State equation strengthened by 222 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1280/1338 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
SMT process timed out in 54247ms, After SMT, problems are : Problem set: 0 solved, 1279 unsolved
Search for dead transitions found 0 dead transitions in 54267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55773 ms. Remains : 58/58 places, 1280/1280 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 95 ms. Remains 58 /58 variables (removed 0) and now considering 1280/1280 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 05:52:57] [INFO ] Invariant cache hit.
[2024-05-22 05:52:58] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-22 05:52:58] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 05:52:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-22 05:52:58] [INFO ] After 592ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-22 05:52:58] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 879 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (AND p0 (NOT p3) (NOT p2) (NOT p1))), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p3)), (G (AND (OR p0 (NOT p2) p3) (OR (NOT p1) (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F p3), (F (NOT p0)), (F (NOT (AND (OR p0 p2 p3) (OR (NOT p1) p2 p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 21 factoid took 406 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-22 05:52:59] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:53:00] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-22 05:53:00] [INFO ] Invariant cache hit.
[2024-05-22 05:53:00] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 05:53:01] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-05-22 05:53:01] [INFO ] Invariant cache hit.
[2024-05-22 05:53:01] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 55325ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 55350ms
Finished structural reductions in LTL mode , in 1 iterations and 56890 ms. Remains : 72/72 places, 1376/1376 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 (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (NOT (OR p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 163 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
RANDOM walk for 40000 steps (2191 resets) in 5538 ms. (7 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (108 resets) in 461 ms. (86 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40002 steps (53 resets) in 410 ms. (97 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (113 resets) in 401 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (113 resets) in 389 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 397 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (114 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (112 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
[2024-05-22 05:53:59] [INFO ] Invariant cache hit.
[2024-05-22 05:53:59] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1373/1440 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 304/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1440 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/1447 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1447 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1448 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1448 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1448/1448 variables, and 389 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 72/72 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3496ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5005 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Graph (complete) has 1117 edges and 72 vertex of which 71 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 70 transition count 1371
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 70 transition count 1371
Free-agglomeration rule applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 70 transition count 1362
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 93 place count 61 transition count 1292
Applied a total of 93 rules in 315 ms. Remains 61 /72 variables (removed 11) and now considering 1292/1376 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 61/72 places, 1292/1376 transitions.
RANDOM walk for 40000 steps (668 resets) in 4418 ms. (9 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (70 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (71 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
// Phase 1: matrix 1292 rows 61 cols
[2024-05-22 05:54:09] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:54:09] [INFO ] State equation strengthened by 232 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1292/1352 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1352 variables, 232/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1352 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1353 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1353 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1353/1353 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1764ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 619 ms.
Support contains 17 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 1292/1292 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 1291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 60 transition count 1281
Applied a total of 12 rules in 146 ms. Remains 60 /61 variables (removed 1) and now considering 1281/1292 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 60/61 places, 1281/1292 transitions.
RANDOM walk for 40000 steps (407 resets) in 2524 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (44 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 33389 steps (39 resets) in 159 ms. (208 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p3) p0))), (X (AND (NOT p1) (NOT p2) (NOT p3) p0)), (X (NOT (OR p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p0))), (X (X (NOT (OR p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (OR p0 p3) (OR (NOT p1) p3)))), (F (NOT p0)), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p1 (NOT p2) p3))), (F p1)]
Knowledge based reduction with 19 factoid took 658 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND p1 p2 (NOT p3)), p1, (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 1058 reset in 822 ms.
Product exploration explored 100000 steps with 254 reset in 252 ms.
Built C files in :
/tmp/ltsmin15677064288489106660
[2024-05-22 05:54:15] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15677064288489106660
Running compilation step : cd /tmp/ltsmin15677064288489106660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15677064288489106660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15677064288489106660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 1376/1376 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 1376/1376 (removed 0) transitions.
// Phase 1: matrix 1376 rows 72 cols
[2024-05-22 05:54:18] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:54:19] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-22 05:54:19] [INFO ] Invariant cache hit.
[2024-05-22 05:54:19] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-22 05:54:20] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
Running 1375 sub problems to find dead transitions.
[2024-05-22 05:54:20] [INFO ] Invariant cache hit.
[2024-05-22 05:54:20] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 3 (OVERLAPS) 1375/1447 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
SMT process timed out in 54463ms, After SMT, problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 54481ms
Finished structural reductions in LTL mode , in 1 iterations and 56060 ms. Remains : 72/72 places, 1376/1376 transitions.
Built C files in :
/tmp/ltsmin8788764124614743692
[2024-05-22 05:55:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8788764124614743692
Running compilation step : cd /tmp/ltsmin8788764124614743692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8788764124614743692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8788764124614743692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-22 05:55:18] [INFO ] Flatten gal took : 474 ms
[2024-05-22 05:55:18] [INFO ] Flatten gal took : 317 ms
[2024-05-22 05:55:18] [INFO ] Time to serialize gal into /tmp/LTL4586276245407484910.gal : 25 ms
[2024-05-22 05:55:18] [INFO ] Time to serialize properties into /tmp/LTL16946785171207250683.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4586276245407484910.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14367699521408243550.hoa' '-atoms' '/tmp/LTL16946785171207250683.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16946785171207250683.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14367699521408243550.hoa
Detected timeout of ITS tools.
[2024-05-22 05:55:34] [INFO ] Flatten gal took : 254 ms
[2024-05-22 05:55:34] [INFO ] Flatten gal took : 316 ms
[2024-05-22 05:55:34] [INFO ] Time to serialize gal into /tmp/LTL14964521628320412909.gal : 38 ms
[2024-05-22 05:55:34] [INFO ] Time to serialize properties into /tmp/LTL1499264122314035146.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14964521628320412909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1499264122314035146.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))"))U((G(!("(((p1==1)&&(p6==1))&&((p63==1)&&(p89==1)))")))||((!("(((p1==1)&&(p6==...533
Formula 0 simplified : XG(!"(((p1==0)||(p9==0))||((p47==0)||(p89==0)))" | (("(((p1==1)&&(p11==1))&&((p70==1)&&(p89==1)))" M !"(((((p17==1)&&(p27==1))&&((p3...355
Detected timeout of ITS tools.
[2024-05-22 05:55:49] [INFO ] Flatten gal took : 197 ms
[2024-05-22 05:55:49] [INFO ] Applying decomposition
[2024-05-22 05:55:50] [INFO ] Flatten gal took : 190 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8807026270451926298.txt' '-o' '/tmp/graph8807026270451926298.bin' '-w' '/tmp/graph8807026270451926298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8807026270451926298.bin' '-l' '-1' '-v' '-w' '/tmp/graph8807026270451926298.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:55:50] [INFO ] Decomposing Gal with order
[2024-05-22 05:55:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:55:50] [INFO ] Removed a total of 12319 redundant transitions.
[2024-05-22 05:55:51] [INFO ] Flatten gal took : 376 ms
[2024-05-22 05:55:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 109 ms.
[2024-05-22 05:55:51] [INFO ] Time to serialize gal into /tmp/LTL2339432346261114958.gal : 11 ms
[2024-05-22 05:55:51] [INFO ] Time to serialize properties into /tmp/LTL10031432516419822468.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2339432346261114958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10031432516419822468.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((!("(((i4.u21.p1==1)&&(i4.u21.p6==1))&&((i0.u15.p63==1)&&(i4.u21.p89==1)))"))U((G(!("(((i4.u21.p1==1)&&(i4.u21.p6==1))&&((i0.u...784
Formula 0 simplified : XG(!"(((i4.u21.p1==0)||(i4.u21.p9==0))||((i1.u9.p47==0)||(i4.u21.p89==0)))" | (("(((i4.u21.p1==1)&&(i4.u21.p11==1))&&((u17.p70==1)&&...525
Detected timeout of ITS tools.
Treatment of property AutonomousCar-PT-10a-LTLFireability-09 finished in 330465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X((X(X(p1))||G(p2)))))))'
[2024-05-22 05:56:06] [INFO ] Flatten gal took : 173 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1496749470467335079
[2024-05-22 05:56:06] [INFO ] Computing symmetric may disable matrix : 1442 transitions.
[2024-05-22 05:56:06] [INFO ] Applying decomposition
[2024-05-22 05:56:07] [INFO ] Flatten gal took : 212 ms
[2024-05-22 05:56:07] [INFO ] Computation of Complete disable matrix. took 577 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:56:07] [INFO ] Computing symmetric may enable matrix : 1442 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12036479056177762727.txt' '-o' '/tmp/graph12036479056177762727.bin' '-w' '/tmp/graph12036479056177762727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12036479056177762727.bin' '-l' '-1' '-v' '-w' '/tmp/graph12036479056177762727.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:56:07] [INFO ] Decomposing Gal with order
[2024-05-22 05:56:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:56:07] [INFO ] Computation of Complete enable matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:56:07] [INFO ] Removed a total of 13033 redundant transitions.
[2024-05-22 05:56:07] [INFO ] Flatten gal took : 251 ms
[2024-05-22 05:56:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 46 ms.
[2024-05-22 05:56:08] [INFO ] Computing Do-Not-Accords matrix : 1442 transitions.
[2024-05-22 05:56:08] [INFO ] Time to serialize gal into /tmp/LTLFireability17585796790073960658.gal : 3 ms
[2024-05-22 05:56:08] [INFO ] Time to serialize properties into /tmp/LTLFireability17389249882879104444.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17585796790073960658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17389249882879104444.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(F(("(((i0.u31.p1==0)||(i0.u31.p9==0))||((i4.u14.p47==0)||(i0.u31.p89==0)))")&&((!("(((i0.u31.p1==1)&&(i0.u31.p6==1))&&((i6.u21.p6...803
Formula 0 simplified : XG(!"(((i0.u31.p1==0)||(i0.u31.p9==0))||((i4.u14.p47==0)||(i0.u31.p89==0)))" | (("(((i0.u31.p1==1)&&(i0.u31.p11==1))&&((i0.u24.p70==...541
[2024-05-22 05:56:08] [INFO ] Computation of Completed DNA matrix. took 132 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 05:56:08] [INFO ] Built C files in 1480ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1496749470467335079
Running compilation step : cd /tmp/ltsmin1496749470467335079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 21338 ms.
Running link step : cd /tmp/ltsmin1496749470467335079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 174 ms.
Running LTSmin : cd /tmp/ltsmin1496749470467335079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&(!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1496749470467335079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&(!(LTLAPp1==true) U ([](!(LTLAPp1==true))||(!(LTLAPp1==true)&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1496749470467335079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp4==true))&&[](<>((LTLAPp5==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10a.tgz
mv AutonomousCar-PT-10a 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 ;