Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 48K 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 AutoFlight-PT-02b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717183078496

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:18:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:18:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:18:00] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-31 19:18:00] [INFO ] Transformed 206 places.
[2024-05-31 19:18:00] [INFO ] Transformed 204 transitions.
[2024-05-31 19:18:00] [INFO ] Found NUPN structural information;
[2024-05-31 19:18:00] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-02b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 185 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 185 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 185 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 178 transition count 173
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 178 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 176 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 176 transition count 171
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 175 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 175 transition count 170
Applied a total of 65 rules in 153 ms. Remains 175 /206 variables (removed 31) and now considering 170/204 (removed 34) transitions.
// Phase 1: matrix 170 rows 175 cols
[2024-05-31 19:18:00] [INFO ] Computed 16 invariants in 28 ms
[2024-05-31 19:18:01] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-31 19:18:01] [INFO ] Invariant cache hit.
[2024-05-31 19:18:01] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-31 19:18:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 43 ms to minimize.
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 4 ms to minimize.
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 4 ms to minimize.
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 4 ms to minimize.
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 4 ms to minimize.
[2024-05-31 19:18:05] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 3 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 3 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:18:06] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-31 19:18:07] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:09] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:18:09] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 4 ms to minimize.
[2024-05-31 19:18:09] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:18:09] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:10] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:18:11] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:18:11] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 3 ms to minimize.
[2024-05-31 19:18:11] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-31 19:18:11] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:18:11] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:18:12] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:12] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 3 ms to minimize.
[2024-05-31 19:18:12] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 170/345 variables, 175/224 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:19] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:18:20] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:18:20] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:18:20] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:18:20] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/345 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:22] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:27] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/345 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 169 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 345/345 variables, and 231 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:33] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:18:34] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:35] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:36] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 170/345 variables, 175/235 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 169/404 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:39] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:18:39] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:18:39] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:18:40] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:18:41] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:18:41] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 6/410 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:44] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-31 19:18:52] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:18:52] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 9 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/345 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 413 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 53/53 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 175/206 places, 170/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61360 ms. Remains : 175/206 places, 170/204 transitions.
Support contains 35 out of 175 places after structural reductions.
[2024-05-31 19:19:02] [INFO ] Flatten gal took : 82 ms
[2024-05-31 19:19:02] [INFO ] Flatten gal took : 32 ms
[2024-05-31 19:19:02] [INFO ] Input system was already deterministic with 170 transitions.
RANDOM walk for 40000 steps (351 resets) in 2226 ms. (17 steps per ms) remains 2/34 properties
BEST_FIRST walk for 40004 steps (45 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (42 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2024-05-31 19:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/162 variables, 11/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:19:03] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/175 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 170/345 variables, 175/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 198 constraints, problems are : Problem set: 1 solved, 1 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 144/162 variables, 14/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 7/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/175 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/345 variables, 175/198 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 1/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 199 constraints, problems are : Problem set: 1 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 762ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 6833 steps, including 71 resets, run visited all 1 properties in 84 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 94 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 46 stabilizing places and 46 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 174 transition count 111
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 66 rules applied. Total rules applied 124 place count 116 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 112 transition count 103
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 128 place count 112 transition count 78
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 178 place count 87 transition count 78
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 184 place count 81 transition count 72
Iterating global reduction 3 with 6 rules applied. Total rules applied 190 place count 81 transition count 72
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 190 place count 81 transition count 69
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 196 place count 78 transition count 69
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 250 place count 51 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 50 transition count 38
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 255 place count 47 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 46 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 256 place count 46 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 260 place count 44 transition count 35
Applied a total of 260 rules in 64 ms. Remains 44 /175 variables (removed 131) and now considering 35/170 (removed 135) transitions.
// Phase 1: matrix 35 rows 44 cols
[2024-05-31 19:19:04] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 19:19:04] [INFO ] Implicit Places using invariants in 81 ms returned [17, 25, 33, 37, 43]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 83 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/175 places, 35/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 35 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 35 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 34 transition count 30
Applied a total of 10 rules in 9 ms. Remains 34 /39 variables (removed 5) and now considering 30/35 (removed 5) transitions.
// Phase 1: matrix 30 rows 34 cols
[2024-05-31 19:19:04] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:19:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 19:19:05] [INFO ] Invariant cache hit.
[2024-05-31 19:19:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:19:05] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/175 places, 30/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 320 ms. Remains : 34/175 places, 30/170 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-00
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 3 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-00 finished in 702 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||(p1&&(G(p2)||(p3&&X(G(p4))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 174 transition count 116
Reduce places removed 53 places and 0 transitions.
Ensure Unique test 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 1 with 60 rules applied. Total rules applied 113 place count 121 transition count 109
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 120 place count 117 transition count 106
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 114 transition count 105
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 124 place count 114 transition count 81
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 172 place count 90 transition count 81
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 179 place count 83 transition count 74
Iterating global reduction 4 with 7 rules applied. Total rules applied 186 place count 83 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 186 place count 83 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 192 place count 80 transition count 71
Performed 25 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 242 place count 55 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 54 transition count 42
Applied a total of 243 rules in 40 ms. Remains 54 /175 variables (removed 121) and now considering 42/170 (removed 128) transitions.
// Phase 1: matrix 42 rows 54 cols
[2024-05-31 19:19:05] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:19:05] [INFO ] Implicit Places using invariants in 100 ms returned [23, 32, 40, 46, 53]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 103 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/175 places, 42/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 46 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 46 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 45 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 45 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 44 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 44 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 43 transition count 36
Applied a total of 12 rules in 10 ms. Remains 43 /49 variables (removed 6) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 43 cols
[2024-05-31 19:19:05] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:19:05] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 19:19:05] [INFO ] Invariant cache hit.
[2024-05-31 19:19:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 19:19:05] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/175 places, 36/170 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 42 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 35
Applied a total of 2 rules in 6 ms. Remains 41 /42 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 41 cols
[2024-05-31 19:19:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 19:19:05] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 19:19:05] [INFO ] Invariant cache hit.
[2024-05-31 19:19:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:06] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 41/175 places, 35/170 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 559 ms. Remains : 41/175 places, 35/170 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p4))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-01
Product exploration explored 100000 steps with 35738 reset in 649 ms.
Product exploration explored 100000 steps with 35710 reset in 400 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3) p4), (X p2), (X (NOT p3)), (X p4), (X (NOT (AND (NOT p0) (NOT p2) p4))), (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) p1 p2 p4))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4)))), (X (NOT p1)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 p2 p4)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4)))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (AND (NOT p0) p2 p4)), (X (NOT (AND (NOT p0) p2 p4))), (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))))), (X (X (AND (NOT p0) p2 p4))), (X (X (NOT (AND (NOT p0) p2 p4)))), (X (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 31 factoid took 1267 ms. Reduced automaton from 4 states, 20 edges and 5 AP (stutter insensitive) to 4 states, 20 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 516 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p4))]
RANDOM walk for 40000 steps (2575 resets) in 747 ms. (53 steps per ms) remains 5/21 properties
BEST_FIRST walk for 40003 steps (574 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (538 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (500 resets) in 393 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (541 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (540 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
[2024-05-31 19:19:09] [INFO ] Invariant cache hit.
[2024-05-31 19:19:10] [INFO ] State equation strengthened by 7 read => feed constraints.
Problem apf10 is UNSAT
Problem apf12 is UNSAT
Problem apf16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/41 variables, 7/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/76 variables, 41/51 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 7/58 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/76 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 58 constraints, problems are : Problem set: 3 solved, 2 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem apf14 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Int declared 26/76 variables, and 3 constraints, problems are : Problem set: 5 solved, 0 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 3/10 constraints, State Equation: 0/41 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3) p4), (X p2), (X (NOT p3)), (X p4), (X (NOT (AND (NOT p0) (NOT p2) p4))), (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p0) p1 p2 p4))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4))))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4)))), (X (NOT p1)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (AND (NOT p0) p1 p2 p3 (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p1 p2 p4)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2 (NOT p4)) (AND (NOT p0) p2 (NOT p3) (NOT p4)))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3) (NOT p4))))), (X (X (NOT p1))), (G (AND (OR p0 p2 p4 p3) (OR p0 p4 p1))), (G (AND (OR p0 p2 p4 p1) (OR p0 p2 p4 p3))), (G (OR p0 (NOT p2) (NOT p1) (NOT p3))), (G (OR p0 (NOT p2) p4 (NOT p1) (NOT p3))), (G (OR p0 (NOT p2) (NOT p4) (NOT p1)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (AND (NOT p0) p2 p4)), (X (NOT (AND (NOT p0) p2 p4))), (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))), (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3)))))), (X (X (AND (NOT p0) p2 p4))), (X (X (NOT (AND (NOT p0) p2 p4)))), (X (X (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p4) (AND (NOT p0) (NOT p2) p4))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (AND (NOT p0) (NOT p2) p4) (AND (NOT p0) p4 (NOT p1))))), (F (NOT (AND (NOT p0) p2 p4))), (F (NOT (OR (AND (NOT p0) p2 (NOT p1)) (AND (NOT p0) p2 (NOT p3))))), (F (NOT (OR p0 p2 (NOT p1) (NOT p3)))), (F (NOT p4)), (F (NOT (OR p0 (NOT p2) (NOT p1) p3))), (F (NOT (AND (OR p0 (NOT p2) p4 p1) (OR p0 (NOT p2) p4 p3)))), (F (NOT (OR p0 p2 (NOT p4)))), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2 p4 (NOT p1) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p4 (NOT p1) p3))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))))), (F p3), (F (NOT (AND (OR p0 p2 p1) (OR p0 p2 p3)))), (F p1)]
Knowledge based reduction with 36 factoid took 2420 ms. Reduced automaton from 4 states, 20 edges and 5 AP (stutter insensitive) to 4 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) p1 (NOT p3) p4) (AND (NOT p0) (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) p1 (NOT p3) p4) (AND (NOT p0) (NOT p1) (NOT p2))), false]
[2024-05-31 19:19:13] [INFO ] Invariant cache hit.
[2024-05-31 19:19:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-31 19:19:13] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 19:19:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:19:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-31 19:19:13] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 19:19:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:13] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 19:19:13] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 19:19:13] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3) p4)
[2024-05-31 19:19:13] [INFO ] Invariant cache hit.
[2024-05-31 19:19:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-31 19:19:13] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 19:19:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:19:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-31 19:19:13] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 19:19:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:13] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 19:19:13] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 19:19:13] [INFO ] Added : 24 causal constraints over 5 iterations in 59 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-31 19:19:13] [INFO ] Invariant cache hit.
[2024-05-31 19:19:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 19:19:13] [INFO ] Invariant cache hit.
[2024-05-31 19:19:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:13] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-31 19:19:13] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-31 19:19:13] [INFO ] Invariant cache hit.
[2024-05-31 19:19:13] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 35/76 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 58 constraints, problems are : Problem set: 0 solved, 30 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 35/76 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 30/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 88 constraints, problems are : Problem set: 0 solved, 30 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1363ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1479 ms. Remains : 41/41 places, 35/35 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Computed a total of 4 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) p4 (NOT p1) p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) p4 p1)))), (X (NOT p3)), (X p4), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) p1))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4) p1)))), (X (NOT (AND (NOT p0) p3 (NOT p4)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) p4 p1))))), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4) p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p4)), (X (NOT (AND (NOT p0) p4))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p4))), (X (X (NOT (AND (NOT p0) p4)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 23 factoid took 1388 ms. Reduced automaton from 4 states, 17 edges and 5 AP (stutter insensitive) to 4 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 (NOT p3) p4) (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), false]
RANDOM walk for 40000 steps (2561 resets) in 216 ms. (184 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (567 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (538 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (536 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
[2024-05-31 19:19:17] [INFO ] Invariant cache hit.
[2024-05-31 19:19:17] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/41 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/76 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/76 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 58 constraints, problems are : Problem set: 0 solved, 3 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf8 is UNSAT
Problem apf11 is UNSAT
Problem apf14 is UNSAT
After SMT solving in domain Int declared 26/76 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/10 constraints, State Equation: 0/41 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p4 (NOT p1) p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) p4 p1)))), (X (NOT p3)), (X p4), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) p1))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4) p1)))), (X (NOT (AND (NOT p0) p3 (NOT p4)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) p4 p1))))), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4) p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4) p1)))), (G (OR p0 p1 p3 p4)), (G (OR p0 p1 p2 p3 p4)), (G (OR p0 (NOT p1) p2 p3 p4))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p4)), (X (NOT (AND (NOT p0) p4))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p4))), (X (X (NOT (AND (NOT p0) p4)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) p4)))), (F p1), (F (NOT (OR p0 (NOT p1) p3 p4))), (F (NOT p4)), (F p0), (F (NOT (OR p0 (NOT p3) p4))), (F (NOT (AND (OR p0 p1 p2) (OR p0 (NOT p1) p3 (NOT p4))))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT p2)), (F (NOT (AND (OR p0 (NOT p1) p3 p4) (OR p0 (NOT p2) p3 p4)))), (F p3), (F (NOT (AND (NOT p0) p4)))]
Knowledge based reduction with 26 factoid took 2486 ms. Reduced automaton from 4 states, 17 edges and 5 AP (stutter insensitive) to 4 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 (NOT p3) p4) (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), false]
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 (NOT p3) p4) (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), false]
[2024-05-31 19:19:20] [INFO ] Invariant cache hit.
[2024-05-31 19:19:20] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-31 19:19:20] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 19:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:19:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-31 19:19:20] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 19:19:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-05-31 19:19:20] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 19:19:20] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3) p4)
[2024-05-31 19:19:20] [INFO ] Invariant cache hit.
[2024-05-31 19:19:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-31 19:19:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 19:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:19:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-31 19:19:20] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 19:19:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:20] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2024-05-31 19:19:20] [INFO ] Computed and/alt/rep : 30/71/30 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 19:19:20] [INFO ] Added : 24 causal constraints over 5 iterations in 55 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p0) (NOT p3) p4) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) p3 (NOT p4))), (OR (AND (NOT p0) p1 (NOT p3) p4) (AND (NOT p0) p1 p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), false]
Product exploration explored 100000 steps with 35704 reset in 267 ms.
Product exploration explored 100000 steps with 35726 reset in 294 ms.
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-31 19:19:21] [INFO ] Invariant cache hit.
[2024-05-31 19:19:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 19:19:21] [INFO ] Invariant cache hit.
[2024-05-31 19:19:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 19:19:21] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-31 19:19:21] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-31 19:19:21] [INFO ] Invariant cache hit.
[2024-05-31 19:19:21] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 35/76 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/76 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 58 constraints, problems are : Problem set: 0 solved, 30 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2/41 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 35/76 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 30/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 88 constraints, problems are : Problem set: 0 solved, 30 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 41/41 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 1583ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1584ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1782 ms. Remains : 41/41 places, 35/35 transitions.
Treatment of property AutoFlight-PT-02b-LTLFireability-01 finished in 18159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 174 transition count 111
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 66 rules applied. Total rules applied 124 place count 116 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 128 place count 112 transition count 103
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 128 place count 112 transition count 79
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 176 place count 88 transition count 79
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 182 place count 82 transition count 73
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 82 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 188 place count 82 transition count 70
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 194 place count 79 transition count 70
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 250 place count 51 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 50 transition count 38
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 255 place count 47 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 46 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 256 place count 46 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 260 place count 44 transition count 35
Applied a total of 260 rules in 33 ms. Remains 44 /175 variables (removed 131) and now considering 35/170 (removed 135) transitions.
// Phase 1: matrix 35 rows 44 cols
[2024-05-31 19:19:23] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 19:19:23] [INFO ] Implicit Places using invariants in 83 ms returned [17, 25, 33, 37, 43]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 85 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/175 places, 35/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 36 transition count 32
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 36 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 35 transition count 31
Applied a total of 8 rules in 6 ms. Remains 35 /39 variables (removed 4) and now considering 31/35 (removed 4) transitions.
// Phase 1: matrix 31 rows 35 cols
[2024-05-31 19:19:23] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:19:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 19:19:23] [INFO ] Invariant cache hit.
[2024-05-31 19:19:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:19:23] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/175 places, 31/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 279 ms. Remains : 35/175 places, 31/170 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-02
Product exploration explored 100000 steps with 8795 reset in 181 ms.
Stack based approach found an accepted trace after 21657 steps with 1899 reset with depth 23 and stack size 23 in 55 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-02 finished in 583 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)||(p1&&X(F(p0))&&G(p2)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 168 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 168 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 168 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 166 transition count 160
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 166 transition count 160
Applied a total of 19 rules in 6 ms. Remains 166 /175 variables (removed 9) and now considering 160/170 (removed 10) transitions.
// Phase 1: matrix 160 rows 166 cols
[2024-05-31 19:19:24] [INFO ] Computed 16 invariants in 4 ms
[2024-05-31 19:19:24] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 19:19:24] [INFO ] Invariant cache hit.
[2024-05-31 19:19:24] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-31 19:19:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:26] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 3 ms to minimize.
[2024-05-31 19:19:27] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 3 ms to minimize.
[2024-05-31 19:19:27] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:19:27] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:19:27] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-31 19:19:27] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:19:27] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:19:28] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:19:28] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:19:28] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:19:28] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:19:28] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:29] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 3 ms to minimize.
[2024-05-31 19:19:29] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:30] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:19:30] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:19:31] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:19:31] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:19:31] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 160/326 variables, 166/201 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:35] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 202 constraints, problems are : Problem set: 0 solved, 159 unsolved in 15778 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:42] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 3 ms to minimize.
[2024-05-31 19:19:42] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:19:42] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:19:42] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:19:42] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:19:42] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:19:42] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:43] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 160/326 variables, 166/210 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 159/369 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:46] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 3 ms to minimize.
[2024-05-31 19:19:46] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:19:47] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 3 ms to minimize.
[2024-05-31 19:19:47] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:19:48] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:19:48] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:19:49] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 3 ms to minimize.
[2024-05-31 19:19:49] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 19:19:51] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:19:51] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2024-05-31 19:19:51] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (OVERLAPS) 0/326 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 381 constraints, problems are : Problem set: 0 solved, 159 unsolved in 23311 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 40/40 constraints]
After SMT, in 39124ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 39129ms
Starting structural reductions in LTL mode, iteration 1 : 166/175 places, 160/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39500 ms. Remains : 166/175 places, 160/170 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-03 finished in 39761 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)||X(p1)||(!p1 U (G(!p1)||(!p1&&G(p2))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 161
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 164 transition count 158
Applied a total of 23 rules in 8 ms. Remains 164 /175 variables (removed 11) and now considering 158/170 (removed 12) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-31 19:20:03] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 19:20:04] [INFO ] Invariant cache hit.
[2024-05-31 19:20:04] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 19:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 4 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:20:06] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 3 ms to minimize.
[2024-05-31 19:20:07] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:20:07] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:20:07] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 4 ms to minimize.
[2024-05-31 19:20:07] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:20:09] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:13] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:15] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:20:15] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:20:15] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:20:15] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 201 constraints, problems are : Problem set: 0 solved, 157 unsolved in 16718 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:22] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/202 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 157/359 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:25] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:20:25] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:20:25] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:20:25] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:28] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:20:28] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:20:29] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:20:29] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:20:29] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:20:30] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:20:31] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 7/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 370 constraints, problems are : Problem set: 0 solved, 157 unsolved in 18780 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 33/33 constraints]
After SMT, in 35518ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 35521ms
Starting structural reductions in LTL mode, iteration 1 : 164/175 places, 158/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35783 ms. Remains : 164/175 places, 158/170 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), false, false, (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-05
Product exploration explored 100000 steps with 1131 reset in 182 ms.
Product exploration explored 100000 steps with 1139 reset in 610 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/164 stabilizing places and 42/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 173 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 19086 steps (165 resets) in 54 ms. (347 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2))), (F p0), (F p1)]
Knowledge based reduction with 16 factoid took 581 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2024-05-31 19:20:42] [INFO ] Invariant cache hit.
[2024-05-31 19:20:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-31 19:20:42] [INFO ] Invariant cache hit.
[2024-05-31 19:20:42] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 19:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:20:45] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 4 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 3 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:20:46] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:48] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:20:48] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:20:49] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:52] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:20:54] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:20:54] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:20:54] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:20:54] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 201 constraints, problems are : Problem set: 0 solved, 157 unsolved in 17389 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:01] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/202 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 157/359 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:04] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:21:04] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:21:04] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:21:05] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:07] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-31 19:21:07] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-31 19:21:08] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:21:08] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:21:08] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:21:09] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 3 ms to minimize.
[2024-05-31 19:21:10] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 7/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 370 constraints, problems are : Problem set: 0 solved, 157 unsolved in 21814 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 33/33 constraints]
After SMT, in 39232ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 39236ms
Finished structural reductions in LTL mode , in 1 iterations and 39628 ms. Remains : 164/164 places, 158/158 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Computed a total of 42 stabilizing places and 42 stable transitions
Detected a total of 42/164 stabilizing places and 42/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 11137 steps (95 resets) in 44 ms. (247 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2))), (F p0), (F p1)]
Knowledge based reduction with 9 factoid took 920 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 1132 reset in 274 ms.
Product exploration explored 100000 steps with 1134 reset in 315 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 164 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 164 transition count 156
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 164 transition count 156
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 164 transition count 156
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 112 place count 126 transition count 118
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 150 place count 126 transition count 118
Performed 39 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 189 place count 126 transition count 114
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 210 place count 105 transition count 93
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 231 place count 105 transition count 93
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 231 rules in 35 ms. Remains 105 /164 variables (removed 59) and now considering 93/158 (removed 65) transitions.
[2024-05-31 19:21:25] [INFO ] Redundant transitions in 4 ms returned []
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 93 rows 105 cols
[2024-05-31 19:21:25] [INFO ] Computed 16 invariants in 3 ms
[2024-05-31 19:21:25] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-31 19:21:26] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:21:26] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 2 ms to minimize.
[2024-05-31 19:21:26] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-05-31 19:21:26] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-31 19:21:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 15/31 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/31 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 93/198 variables, 105/136 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 13/149 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/149 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/149 constraints. Problems are: Problem set: 52 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 149 constraints, problems are : Problem set: 52 solved, 40 unsolved in 3117 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 52 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 49/101 variables, 14/14 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 15/29 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/29 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 4/105 variables, 2/31 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/31 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 93/198 variables, 105/136 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 13/149 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/189 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/189 constraints. Problems are: Problem set: 52 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/189 constraints. Problems are: Problem set: 52 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 189 constraints, problems are : Problem set: 52 solved, 40 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 40/92 constraints, Known Traps: 15/15 constraints]
After SMT, in 4977ms problems are : Problem set: 52 solved, 40 unsolved
Search for dead transitions found 52 dead transitions in 4980ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/164 places, 41/158 transitions.
Graph (complete) has 131 edges and 105 vertex of which 53 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.2 ms
Discarding 52 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 53 /105 variables (removed 52) and now considering 41/41 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/164 places, 41/158 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5037 ms. Remains : 53/164 places, 41/158 transitions.
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 158/158 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 158/158 (removed 0) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-31 19:21:30] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:21:30] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 19:21:30] [INFO ] Invariant cache hit.
[2024-05-31 19:21:31] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 19:21:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 4 ms to minimize.
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:21:35] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:21:35] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:37] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:21:37] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:21:37] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:41] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:42] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:21:43] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:21:43] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:21:43] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 201 constraints, problems are : Problem set: 0 solved, 157 unsolved in 15676 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:48] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/202 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 157/359 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:49] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:21:50] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:21:52] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-31 19:21:52] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:21:52] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:21:52] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 4 ms to minimize.
[2024-05-31 19:21:52] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:21:53] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:21:54] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 7/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 370 constraints, problems are : Problem set: 0 solved, 157 unsolved in 15658 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 33/33 constraints]
After SMT, in 31358ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 31362ms
Finished structural reductions in LTL mode , in 1 iterations and 31757 ms. Remains : 164/164 places, 158/158 transitions.
Treatment of property AutoFlight-PT-02b-LTLFireability-05 finished in 118596 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&&F((!p1&&X(X(G(p2))))))||G((F(!p1)&&F(G(p2)))))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 10 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 162 cols
[2024-05-31 19:22:02] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:22:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 19:22:02] [INFO ] Invariant cache hit.
[2024-05-31 19:22:02] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-31 19:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 6 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:22:04] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:22:05] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:22:05] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:06] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/318 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:08] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:22:08] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:22:08] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:22:08] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9711 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:13] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 3 ms to minimize.
[2024-05-31 19:22:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
[2024-05-31 19:22:13] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-05-31 19:22:13] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-31 19:22:13] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:14] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:22:14] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:15] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/318 variables, 162/202 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 155/357 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:17] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2024-05-31 19:22:17] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:22:17] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:19] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 361 constraints, problems are : Problem set: 0 solved, 155 unsolved in 15716 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 28/28 constraints]
After SMT, in 25444ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 25448ms
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25755 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) p1), (NOT p2), (NOT p2), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-06
Product exploration explored 100000 steps with 885 reset in 140 ms.
Product exploration explored 100000 steps with 880 reset in 156 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/162 stabilizing places and 40/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X p2), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 274 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 20232 steps (176 resets) in 64 ms. (311 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X p2), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 15 factoid took 524 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 162 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-05-31 19:22:30] [INFO ] Invariant cache hit.
[2024-05-31 19:22:30] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 19:22:30] [INFO ] Invariant cache hit.
[2024-05-31 19:22:30] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-31 19:22:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 3 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:22:33] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:34] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/318 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:36] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:22:36] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 5 ms to minimize.
[2024-05-31 19:22:36] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:22:36] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9589 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:41] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:22:41] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:22:41] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:22:41] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:22:41] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:42] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:22:42] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:43] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/318 variables, 162/202 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 155/357 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:45] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-31 19:22:45] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:22:45] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:22:47] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 361 constraints, problems are : Problem set: 0 solved, 155 unsolved in 15684 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 28/28 constraints]
After SMT, in 25305ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 25307ms
Finished structural reductions in LTL mode , in 1 iterations and 25576 ms. Remains : 162/162 places, 156/156 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/162 stabilizing places and 40/156 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 134 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 6193 steps (52 resets) in 15 ms. (387 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X p2), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 8 factoid took 276 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 881 reset in 138 ms.
Product exploration explored 100000 steps with 884 reset in 156 ms.
Applying partial POR strategy [false, true, false, true, false, false]
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 156/156 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 162 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 162 transition count 154
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 162 transition count 154
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 162 transition count 154
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 111 place count 125 transition count 117
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 148 place count 125 transition count 117
Performed 38 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 186 place count 125 transition count 113
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 209 place count 102 transition count 90
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 232 place count 102 transition count 90
Deduced a syphon composed of 50 places in 0 ms
Applied a total of 232 rules in 19 ms. Remains 102 /162 variables (removed 60) and now considering 90/156 (removed 66) transitions.
[2024-05-31 19:22:57] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
// Phase 1: matrix 90 rows 102 cols
[2024-05-31 19:22:57] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:22:57] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-31 19:22:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:22:58] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:22:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 19:22:58] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 15/31 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/31 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 90/192 variables, 102/133 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 15/148 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/148 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/148 constraints. Problems are: Problem set: 50 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 148 constraints, problems are : Problem set: 50 solved, 39 unsolved in 2423 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 50 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 47/98 variables, 14/14 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 15/29 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/29 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 4/102 variables, 2/31 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/31 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 90/192 variables, 102/133 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 15/148 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 39/187 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/187 constraints. Problems are: Problem set: 50 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/187 constraints. Problems are: Problem set: 50 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 187 constraints, problems are : Problem set: 50 solved, 39 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/89 constraints, Known Traps: 15/15 constraints]
After SMT, in 3797ms problems are : Problem set: 50 solved, 39 unsolved
Search for dead transitions found 50 dead transitions in 3799ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/162 places, 40/156 transitions.
Graph (complete) has 130 edges and 102 vertex of which 52 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 52 /102 variables (removed 50) and now considering 40/40 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/162 places, 40/156 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3829 ms. Remains : 52/162 places, 40/156 transitions.
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 162 cols
[2024-05-31 19:23:01] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:23:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 19:23:01] [INFO ] Invariant cache hit.
[2024-05-31 19:23:01] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-31 19:23:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
[2024-05-31 19:23:03] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:23:04] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:23:04] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:23:04] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/318 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:07] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:23:07] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:23:07] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:23:08] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9773 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:12] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:23:12] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-31 19:23:12] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:14] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/318 variables, 162/202 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 155/357 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:16] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:23:16] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:23:16] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:19] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 361 constraints, problems are : Problem set: 0 solved, 155 unsolved in 15513 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 28/28 constraints]
After SMT, in 25316ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 25319ms
Finished structural reductions in LTL mode , in 1 iterations and 25591 ms. Remains : 162/162 places, 156/156 transitions.
Treatment of property AutoFlight-PT-02b-LTLFireability-06 finished in 84777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 6 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
[2024-05-31 19:23:27] [INFO ] Invariant cache hit.
[2024-05-31 19:23:27] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 19:23:27] [INFO ] Invariant cache hit.
[2024-05-31 19:23:27] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-31 19:23:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:23:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:31] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/318 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:33] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-31 19:23:33] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:23:33] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:23:33] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9532 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:38] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:23:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:23:38] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:23:38] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2024-05-31 19:23:38] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:38] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:23:39] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:39] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/318 variables, 162/202 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 155/357 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:41] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-31 19:23:41] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-31 19:23:41] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:23:44] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 361 constraints, problems are : Problem set: 0 solved, 155 unsolved in 15003 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 28/28 constraints]
After SMT, in 24552ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 24556ms
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24819 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-07
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-07 finished in 24944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F((p0&&X(p1)))) U p2))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 166 transition count 161
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 166 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 164 transition count 158
Applied a total of 23 rules in 5 ms. Remains 164 /175 variables (removed 11) and now considering 158/170 (removed 12) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-31 19:23:52] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 19:23:52] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 19:23:52] [INFO ] Invariant cache hit.
[2024-05-31 19:23:52] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-31 19:23:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:23:54] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:23:55] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:23:56] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:23:56] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 2 ms to minimize.
[2024-05-31 19:23:56] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-05-31 19:23:56] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:23:56] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:23:56] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:23:57] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-05-31 19:23:57] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-31 19:23:57] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-31 19:23:57] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:23:58] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-31 19:23:58] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 158/322 variables, 164/212 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:24:00] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-31 19:24:00] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 214 constraints, problems are : Problem set: 0 solved, 157 unsolved in 11825 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:24:05] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:24:05] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:24:05] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 19:24:05] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:24:06] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-05-31 19:24:06] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:24:07] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:24:07] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 158/322 variables, 164/222 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 157/379 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 19:24:10] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 380 constraints, problems are : Problem set: 0 solved, 157 unsolved in 16681 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 43/43 constraints]
After SMT, in 28523ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 28525ms
Starting structural reductions in LTL mode, iteration 1 : 164/175 places, 158/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28790 ms. Remains : 164/175 places, 158/170 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-09
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-09 finished in 28964 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||G(F(p1))) U p2))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 174 transition count 113
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 64 rules applied. Total rules applied 120 place count 118 transition count 105
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 114 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 113 transition count 104
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 126 place count 113 transition count 81
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 172 place count 90 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 86 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 86 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 86 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 84 transition count 75
Performed 27 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 238 place count 57 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 57 transition count 45
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 4 with 2 rules applied. Total rules applied 241 place count 56 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 55 transition count 43
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 246 place count 52 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 247 place count 51 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 247 place count 51 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 251 place count 49 transition count 40
Applied a total of 251 rules in 28 ms. Remains 49 /175 variables (removed 126) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 49 cols
[2024-05-31 19:24:21] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 19:24:21] [INFO ] Implicit Places using invariants in 80 ms returned [20, 28, 42, 48]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 82 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/175 places, 40/170 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 43 transition count 38
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 43 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 42 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 42 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 41 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 41 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 39 transition count 34
Applied a total of 12 rules in 8 ms. Remains 39 /45 variables (removed 6) and now considering 34/40 (removed 6) transitions.
// Phase 1: matrix 34 rows 39 cols
[2024-05-31 19:24:21] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 19:24:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 19:24:21] [INFO ] Invariant cache hit.
[2024-05-31 19:24:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 19:24:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/175 places, 34/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 39/175 places, 34/170 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-10
Product exploration explored 100000 steps with 15862 reset in 218 ms.
Product exploration explored 100000 steps with 15687 reset in 253 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/39 stabilizing places and 5/34 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 888 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p1), (NOT p1)]
RANDOM walk for 1833 steps (105 resets) in 6 ms. (261 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR p2 p0 p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 9 factoid took 2089 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), (NOT p1), (NOT p1)]
[2024-05-31 19:24:25] [INFO ] Invariant cache hit.
[2024-05-31 19:24:25] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-31 19:24:25] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 19:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:24:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-31 19:24:25] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 19:24:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 19:24:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-31 19:24:25] [INFO ] Computed and/alt/rep : 25/51/25 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 19:24:25] [INFO ] Added : 20 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-31 19:24:25] [INFO ] Invariant cache hit.
[2024-05-31 19:24:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 19:24:26] [INFO ] Invariant cache hit.
[2024-05-31 19:24:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 19:24:26] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-31 19:24:26] [INFO ] Redundant transitions in 1 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-31 19:24:26] [INFO ] Invariant cache hit.
[2024-05-31 19:24:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/39 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-31 19:24:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 34/73 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 52 constraints, problems are : Problem set: 0 solved, 25 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 34/73 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 77 constraints, problems are : Problem set: 0 solved, 25 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1323ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1481 ms. Remains : 39/39 places, 34/34 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/39 stabilizing places and 5/34 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1342 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p1), (NOT p1)]
RANDOM walk for 1197 steps (71 resets) in 10 ms. (108 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X p1), (X (NOT p1)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT (OR p2 p0 p1))), (F (NOT p0)), (F p2)]
Knowledge based reduction with 9 factoid took 2142 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p1), (NOT p1)]
[2024-05-31 19:24:31] [INFO ] Invariant cache hit.
[2024-05-31 19:24:31] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-31 19:24:31] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 19:24:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:24:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-31 19:24:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 19:24:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 19:24:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-31 19:24:31] [INFO ] Computed and/alt/rep : 25/51/25 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 19:24:31] [INFO ] Added : 20 causal constraints over 4 iterations in 43 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 15910 reset in 208 ms.
Product exploration explored 100000 steps with 15948 reset in 233 ms.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 34/34 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2024-05-31 19:24:32] [INFO ] Invariant cache hit.
[2024-05-31 19:24:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 19:24:32] [INFO ] Invariant cache hit.
[2024-05-31 19:24:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 19:24:32] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-31 19:24:32] [INFO ] Redundant transitions in 1 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-31 19:24:32] [INFO ] Invariant cache hit.
[2024-05-31 19:24:32] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/39 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-31 19:24:32] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 34/73 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 52 constraints, problems are : Problem set: 0 solved, 25 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 2/39 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 34/73 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 25/77 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 77 constraints, problems are : Problem set: 0 solved, 25 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 1311ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1312ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1468 ms. Remains : 39/39 places, 34/34 transitions.
Treatment of property AutoFlight-PT-02b-LTLFireability-10 finished in 12511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 174 transition count 113
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 64 rules applied. Total rules applied 120 place count 118 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 114 transition count 105
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 124 place count 114 transition count 80
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 174 place count 89 transition count 80
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 181 place count 82 transition count 73
Iterating global reduction 3 with 7 rules applied. Total rules applied 188 place count 82 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 188 place count 82 transition count 70
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 194 place count 79 transition count 70
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 248 place count 52 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 51 transition count 39
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 253 place count 48 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 254 place count 47 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 254 place count 47 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 258 place count 45 transition count 36
Applied a total of 258 rules in 18 ms. Remains 45 /175 variables (removed 130) and now considering 36/170 (removed 134) transitions.
// Phase 1: matrix 36 rows 45 cols
[2024-05-31 19:24:33] [INFO ] Computed 13 invariants in 0 ms
[2024-05-31 19:24:33] [INFO ] Implicit Places using invariants in 84 ms returned [16, 26, 34, 38, 44]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 95 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/175 places, 36/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 33
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 33
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 36 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 36 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 35 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 35 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 34 transition count 30
Applied a total of 12 rules in 4 ms. Remains 34 /40 variables (removed 6) and now considering 30/36 (removed 6) transitions.
// Phase 1: matrix 30 rows 34 cols
[2024-05-31 19:24:33] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:24:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 19:24:33] [INFO ] Invariant cache hit.
[2024-05-31 19:24:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:24:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/175 places, 30/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 34/175 places, 30/170 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-11
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-11 finished in 372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 174 transition count 115
Reduce places removed 54 places and 0 transitions.
Ensure Unique test 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 1 with 61 rules applied. Total rules applied 115 place count 120 transition count 108
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 116 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 115 transition count 107
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 121 place count 115 transition count 82
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 171 place count 90 transition count 82
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 178 place count 83 transition count 75
Iterating global reduction 4 with 7 rules applied. Total rules applied 185 place count 83 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 185 place count 83 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 80 transition count 72
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 245 place count 53 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 52 transition count 41
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 250 place count 49 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 48 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 251 place count 48 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 255 place count 46 transition count 38
Applied a total of 255 rules in 22 ms. Remains 46 /175 variables (removed 129) and now considering 38/170 (removed 132) transitions.
// Phase 1: matrix 38 rows 46 cols
[2024-05-31 19:24:34] [INFO ] Computed 13 invariants in 1 ms
[2024-05-31 19:24:34] [INFO ] Implicit Places using invariants in 90 ms returned [17, 27, 35, 39, 45]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 91 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/175 places, 38/170 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 38 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 38 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 37 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 37 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 33
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 35 transition count 32
Applied a total of 12 rules in 5 ms. Remains 35 /41 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 35 cols
[2024-05-31 19:24:34] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:24:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 19:24:34] [INFO ] Invariant cache hit.
[2024-05-31 19:24:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:24:34] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/175 places, 32/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 35/175 places, 32/170 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-12
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-12 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 14 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 162 cols
[2024-05-31 19:24:34] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:24:34] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 19:24:34] [INFO ] Invariant cache hit.
[2024-05-31 19:24:34] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-31 19:24:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:24:37] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:24:38] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:40] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/318 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:43] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:24:43] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:24:43] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:24:43] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 13503 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:49] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:24:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-31 19:24:49] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-05-31 19:24:49] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-31 19:24:49] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:50] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:24:50] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:51] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/318 variables, 162/202 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 155/357 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:54] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:24:54] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:24:54] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:24:58] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 361 constraints, problems are : Problem set: 0 solved, 155 unsolved in 21110 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 28/28 constraints]
After SMT, in 34634ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 34637ms
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34962 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-13
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-13 finished in 35048 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&&G(p0)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 165 transition count 160
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 165 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 165 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 162 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 162 transition count 156
Applied a total of 27 rules in 6 ms. Remains 162 /175 variables (removed 13) and now considering 156/170 (removed 14) transitions.
[2024-05-31 19:25:09] [INFO ] Invariant cache hit.
[2024-05-31 19:25:09] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 19:25:09] [INFO ] Invariant cache hit.
[2024-05-31 19:25:09] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-31 19:25:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 6 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 3 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 3 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:25:12] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:25:13] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:25:13] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:15] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/318 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:18] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 3 ms to minimize.
[2024-05-31 19:25:18] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:25:18] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:25:19] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 14483 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:25] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:25:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 3 ms to minimize.
[2024-05-31 19:25:25] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:25:26] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:25:26] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:27] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:25:27] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:28] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/318 variables, 162/202 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 155/357 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 3 ms to minimize.
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-31 19:25:34] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 361 constraints, problems are : Problem set: 0 solved, 155 unsolved in 20981 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 28/28 constraints]
After SMT, in 35480ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 35483ms
Starting structural reductions in LTL mode, iteration 1 : 162/175 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35735 ms. Remains : 162/175 places, 156/170 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02b-LTLFireability-14 finished in 35918 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||(p1&&(G(p2)||(p3&&X(G(p4))))))))'
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)||X(p1)||(!p1 U (G(!p1)||(!p1&&G(p2))))))'
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&&F((!p1&&X(X(G(p2))))))||G((F(!p1)&&F(G(p2)))))))'
Found a Lengthening insensitive property : AutoFlight-PT-02b-LTLFireability-06
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) p1), (NOT p2), (NOT p2), p1, (NOT p2), (NOT p2)]
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 175/175 places, 170/170 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 174 transition count 117
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 60 rules applied. Total rules applied 112 place count 122 transition count 109
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 118 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 116 transition count 107
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 120 place count 116 transition count 82
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 170 place count 91 transition count 82
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 176 place count 85 transition count 76
Iterating global reduction 4 with 6 rules applied. Total rules applied 182 place count 85 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 182 place count 85 transition count 73
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 188 place count 82 transition count 73
Performed 27 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 242 place count 55 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 54 transition count 42
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 246 place count 52 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 247 place count 51 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 247 place count 51 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 50 transition count 40
Applied a total of 249 rules in 27 ms. Remains 50 /175 variables (removed 125) and now considering 40/170 (removed 130) transitions.
// Phase 1: matrix 40 rows 50 cols
[2024-05-31 19:25:46] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 19:25:46] [INFO ] Implicit Places using invariants in 87 ms returned [28, 42, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 47/175 places, 40/170 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 39
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 0 with 6 rules applied. Total rules applied 8 place count 43 transition count 36
Applied a total of 8 rules in 5 ms. Remains 43 /47 variables (removed 4) and now considering 36/40 (removed 4) transitions.
// Phase 1: matrix 36 rows 43 cols
[2024-05-31 19:25:46] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:25:46] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 19:25:46] [INFO ] Invariant cache hit.
[2024-05-31 19:25:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:25:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 43/175 places, 36/170 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 301 ms. Remains : 43/175 places, 36/170 transitions.
Running random walk in product with property : AutoFlight-PT-02b-LTLFireability-06
Product exploration explored 100000 steps with 5857 reset in 271 ms.
Product exploration explored 100000 steps with 5871 reset in 282 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/43 stabilizing places and 5/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1859 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 247 steps (12 resets) in 5 ms. (41 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p0), (X (NOT p2)), (X p2), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 6 factoid took 1969 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 402 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-31 19:25:52] [INFO ] Invariant cache hit.
[2024-05-31 19:25:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 19:25:52] [INFO ] Invariant cache hit.
[2024-05-31 19:25:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:25:52] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2024-05-31 19:25:52] [INFO ] Invariant cache hit.
[2024-05-31 19:25:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/79 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 55 constraints, problems are : Problem set: 0 solved, 23 unsolved in 563 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/79 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 78 constraints, problems are : Problem set: 0 solved, 23 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 1171ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1172ms
Finished structural reductions in LTL mode , in 1 iterations and 1345 ms. Remains : 43/43 places, 36/36 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/43 stabilizing places and 5/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 4 factoid took 488 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 228 steps (11 resets) in 7 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 4 factoid took 657 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 295 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 5857 reset in 211 ms.
Product exploration explored 100000 steps with 5857 reset in 237 ms.
Applying partial POR strategy [false, true, false, true, false, false]
Stuttering acceptance computed with spot in 359 ms :[(NOT p2), (NOT p2), (NOT p2), p1, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 36/36 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-31 19:25:56] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
// Phase 1: matrix 36 rows 43 cols
[2024-05-31 19:25:56] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:25:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 19:25:57] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 36/79 variables, 43/55 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 56 constraints, problems are : Problem set: 1 solved, 22 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 4/43 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 36/79 variables, 43/55 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 22/78 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 78 constraints, problems are : Problem set: 1 solved, 22 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 1138ms problems are : Problem set: 1 solved, 22 unsolved
Search for dead transitions found 1 dead transitions in 1139ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/43 places, 35/36 transitions.
Graph (complete) has 93 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 42 /43 variables (removed 1) and now considering 35/35 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/43 places, 35/36 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1150 ms. Remains : 42/43 places, 35/36 transitions.
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 36/36 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 43 cols
[2024-05-31 19:25:58] [INFO ] Computed 11 invariants in 0 ms
[2024-05-31 19:25:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 19:25:58] [INFO ] Invariant cache hit.
[2024-05-31 19:25:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:25:58] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2024-05-31 19:25:58] [INFO ] Invariant cache hit.
[2024-05-31 19:25:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/79 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 55 constraints, problems are : Problem set: 0 solved, 23 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 36/79 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 78 constraints, problems are : Problem set: 0 solved, 23 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 1219ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1221ms
Finished structural reductions in LTL mode , in 1 iterations and 1380 ms. Remains : 43/43 places, 36/36 transitions.
Treatment of property AutoFlight-PT-02b-LTLFireability-06 finished in 13598 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||G(F(p1))) U p2))'
[2024-05-31 19:25:59] [INFO ] Flatten gal took : 25 ms
[2024-05-31 19:25:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-31 19:25:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 170 transitions and 410 arcs took 8 ms.
Total runtime 479510 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-02b-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-02b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-02b-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-02b-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717184054046

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-02b-LTLFireability-01
ltl formula formula --ltl=/tmp/3977/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 175 places, 170 transitions and 410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3977/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3977/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3977/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3977/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 176 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 176, there are 456 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~39 levels ~10000 states ~22300 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14159
pnml2lts-mc( 0/ 4): unique states count: 14159
pnml2lts-mc( 0/ 4): unique transitions count: 31879
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18443
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 14810
pnml2lts-mc( 0/ 4): - cum. max stack depth: 153
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14810 states 34303 transitions, fanout: 2.316
pnml2lts-mc( 0/ 4): Total exploration time 0.210 sec (0.210 sec minimum, 0.210 sec on average)
pnml2lts-mc( 0/ 4): States per second: 70524, Transitions per second: 163348
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 16.7 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 170 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-02b-LTLFireability-05
ltl formula formula --ltl=/tmp/3977/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 175 places, 170 transitions and 410 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3977/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3977/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3977/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3977/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 177 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 176, there are 232 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~113 levels ~10000 states ~22740 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~20000 states ~45132 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~40000 states ~102540 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~80000 states ~222076 transitions
pnml2lts-mc( 2/ 4): ~107 levels ~160000 states ~476704 transitions
pnml2lts-mc( 2/ 4): ~107 levels ~320000 states ~1003480 transitions
pnml2lts-mc( 2/ 4): ~107 levels ~640000 states ~2095140 transitions
pnml2lts-mc( 2/ 4): ~107 levels ~1280000 states ~4401160 transitions
pnml2lts-mc( 1/ 4): ~109 levels ~2560000 states ~9841724 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~5120000 states ~18906436 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~10240000 states ~38702868 transitions
pnml2lts-mc( 0/ 4): ~113 levels ~20480000 states ~82363172 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33552867
pnml2lts-mc( 0/ 4): unique states count: 33553160
pnml2lts-mc( 0/ 4): unique transitions count: 189219760
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 155665366
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553179
pnml2lts-mc( 0/ 4): - cum. max stack depth: 444
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553179 states 189219797 transitions, fanout: 5.639
pnml2lts-mc( 0/ 4): Total exploration time 152.740 sec (152.720 sec minimum, 152.730 sec on average)
pnml2lts-mc( 0/ 4): States per second: 219675, Transitions per second: 1238836
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 268.6MB, 8.4 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/19.0%
pnml2lts-mc( 0/ 4): Stored 170 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 268.6MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-02b-LTLFireability-06
ltl formula formula --ltl=/tmp/3977/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 175 places, 170 transitions and 410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3977/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3977/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3977/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3977/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 176 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 176, there are 211 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~110 levels ~10000 states ~40016 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~20000 states ~87660 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~40000 states ~187692 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~80000 states ~413232 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~160000 states ~852136 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~320000 states ~1788324 transitions
pnml2lts-mc( 3/ 4): ~137 levels ~640000 states ~3530680 transitions
pnml2lts-mc( 3/ 4): ~137 levels ~1280000 states ~7522504 transitions
pnml2lts-mc( 3/ 4): ~2988 levels ~2560000 states ~15996720 transitions
pnml2lts-mc( 3/ 4): ~16944 levels ~5120000 states ~34430224 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~10240000 states ~67088672 transitions
pnml2lts-mc( 0/ 4): ~58251 levels ~20480000 states ~204670288 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32943890
pnml2lts-mc( 0/ 4): unique states count: 33399334
pnml2lts-mc( 0/ 4): unique transitions count: 374441040
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 338857977
pnml2lts-mc( 0/ 4): - claim found count: 1870173
pnml2lts-mc( 0/ 4): - claim success count: 33399799
pnml2lts-mc( 0/ 4): - cum. max stack depth: 134061
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33400033 states 374447777 transitions, fanout: 11.211
pnml2lts-mc( 0/ 4): Total exploration time 183.660 sec (183.600 sec minimum, 183.633 sec on average)
pnml2lts-mc( 0/ 4): States per second: 181858, Transitions per second: 2038810
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.9MB, 8.1 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 170 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.9MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-02b-LTLFireability-10
ltl formula formula --ltl=/tmp/3977/ltl_3_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 175 places, 170 transitions and 410 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3977/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3977/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3977/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3977/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 177 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 176, there are 179 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~106 levels ~10000 states ~24736 transitions
pnml2lts-mc( 1/ 4): ~106 levels ~20000 states ~49100 transitions
pnml2lts-mc( 1/ 4): ~106 levels ~40000 states ~101392 transitions
pnml2lts-mc( 1/ 4): ~106 levels ~80000 states ~219576 transitions
pnml2lts-mc( 1/ 4): ~106 levels ~160000 states ~473260 transitions
pnml2lts-mc( 1/ 4): ~106 levels ~320000 states ~990360 transitions
pnml2lts-mc( 1/ 4): ~125 levels ~640000 states ~2243168 transitions
pnml2lts-mc( 1/ 4): ~549 levels ~1280000 states ~5729580 transitions
pnml2lts-mc( 1/ 4): ~1766 levels ~2560000 states ~13431340 transitions
pnml2lts-mc( 1/ 4): ~4876 levels ~5120000 states ~30475960 transitions
pnml2lts-mc( 1/ 4): ~13884 levels ~10240000 states ~65869232 transitions
pnml2lts-mc( 1/ 4): ~29360 levels ~20480000 states ~138224792 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32429676
pnml2lts-mc( 0/ 4): unique states count: 33260609
pnml2lts-mc( 0/ 4): unique transitions count: 237622110
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 200908857
pnml2lts-mc( 0/ 4): - claim found count: 2654649
pnml2lts-mc( 0/ 4): - claim success count: 33260680
pnml2lts-mc( 0/ 4): - cum. max stack depth: 325936
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33260690 states 237622464 transitions, fanout: 7.144
pnml2lts-mc( 0/ 4): Total exploration time 155.740 sec (155.710 sec minimum, 155.718 sec on average)
pnml2lts-mc( 0/ 4): States per second: 213565, Transitions per second: 1525764
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.4MB, 8.1 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 170 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b 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 ;