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-171620167100147.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-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 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 134K 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-06b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717188523347

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:48:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:48:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:48:45] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-31 20:48:45] [INFO ] Transformed 574 places.
[2024-05-31 20:48:45] [INFO ] Transformed 572 transitions.
[2024-05-31 20:48:45] [INFO ] Found NUPN structural information;
[2024-05-31 20:48:45] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 93 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 499 transition count 497
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 499 transition count 497
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 162 place count 499 transition count 485
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 193 place count 468 transition count 454
Iterating global reduction 1 with 31 rules applied. Total rules applied 224 place count 468 transition count 454
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 230 place count 462 transition count 448
Iterating global reduction 1 with 6 rules applied. Total rules applied 236 place count 462 transition count 448
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 242 place count 456 transition count 442
Iterating global reduction 1 with 6 rules applied. Total rules applied 248 place count 456 transition count 442
Applied a total of 248 rules in 243 ms. Remains 456 /574 variables (removed 118) and now considering 442/572 (removed 130) transitions.
// Phase 1: matrix 442 rows 456 cols
[2024-05-31 20:48:46] [INFO ] Computed 40 invariants in 31 ms
[2024-05-31 20:48:46] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-31 20:48:46] [INFO ] Invariant cache hit.
[2024-05-31 20:48:47] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
Running 441 sub problems to find dead transitions.
[2024-05-31 20:48:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/456 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 20:48:57] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 51 ms to minimize.
[2024-05-31 20:48:57] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 6 ms to minimize.
[2024-05-31 20:48:57] [INFO ] Deduced a trap composed of 62 places in 277 ms of which 5 ms to minimize.
[2024-05-31 20:48:58] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 7 ms to minimize.
[2024-05-31 20:48:58] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 5 ms to minimize.
[2024-05-31 20:48:58] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
[2024-05-31 20:48:58] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 5 ms to minimize.
[2024-05-31 20:48:58] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 5 ms to minimize.
[2024-05-31 20:48:59] [INFO ] Deduced a trap composed of 66 places in 343 ms of which 4 ms to minimize.
[2024-05-31 20:48:59] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 4 ms to minimize.
[2024-05-31 20:48:59] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 4 ms to minimize.
[2024-05-31 20:49:00] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 4 ms to minimize.
[2024-05-31 20:49:00] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 4 ms to minimize.
[2024-05-31 20:49:00] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:49:00] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:49:00] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 4 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 5 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 4 ms to minimize.
[2024-05-31 20:49:01] [INFO ] Deduced a trap composed of 73 places in 240 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 20:49:06] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:49:06] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:49:06] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 10 ms to minimize.
[2024-05-31 20:49:07] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:49:07] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 6 ms to minimize.
[2024-05-31 20:49:07] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 4 ms to minimize.
[2024-05-31 20:49:07] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 4 ms to minimize.
[2024-05-31 20:49:08] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:49:08] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 4 ms to minimize.
[2024-05-31 20:49:08] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 4 ms to minimize.
[2024-05-31 20:49:08] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 6 ms to minimize.
[2024-05-31 20:49:09] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:49:09] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:49:09] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:49:10] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
[2024-05-31 20:49:10] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:49:11] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2024-05-31 20:49:11] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-05-31 20:49:11] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:49:12] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 20:49:12] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 4 ms to minimize.
[2024-05-31 20:49:13] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 4 ms to minimize.
[2024-05-31 20:49:13] [INFO ] Deduced a trap composed of 88 places in 215 ms of which 4 ms to minimize.
[2024-05-31 20:49:13] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 4 ms to minimize.
[2024-05-31 20:49:13] [INFO ] Deduced a trap composed of 64 places in 202 ms of which 4 ms to minimize.
[2024-05-31 20:49:14] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 5 ms to minimize.
[2024-05-31 20:49:14] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 6 ms to minimize.
[2024-05-31 20:49:14] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 4 ms to minimize.
[2024-05-31 20:49:15] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-31 20:49:15] [INFO ] Deduced a trap composed of 69 places in 236 ms of which 4 ms to minimize.
[2024-05-31 20:49:16] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:49:16] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:49:16] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:49:16] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:49:16] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:49:16] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:49:16] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:49:17] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/898 variables, and 98 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/456 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/456 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 58/98 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 20:49:23] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:49:23] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 4 ms to minimize.
[2024-05-31 20:49:23] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:49:23] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:49:23] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-31 20:49:23] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:49:23] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:49:24] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 4 ms to minimize.
[2024-05-31 20:49:24] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:49:24] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:49:24] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:49:25] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:49:25] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:49:25] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:49:25] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-31 20:49:25] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-31 20:49:25] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:49:26] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:49:26] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:49:26] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 20:49:27] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:49:27] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:49:27] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:49:27] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 3 ms to minimize.
[2024-05-31 20:49:28] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 3 ms to minimize.
[2024-05-31 20:49:28] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 4 ms to minimize.
[2024-05-31 20:49:29] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:49:29] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:49:29] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:49:30] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:49:31] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:49:32] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 12/130 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 20:49:34] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:49:34] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:49:34] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:49:35] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
[2024-05-31 20:49:35] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:49:35] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 3 ms to minimize.
[2024-05-31 20:49:36] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-31 20:49:36] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 441 unsolved
[2024-05-31 20:49:40] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:49:41] [INFO ] Deduced a trap composed of 99 places in 211 ms of which 4 ms to minimize.
[2024-05-31 20:49:41] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 3 ms to minimize.
[2024-05-31 20:49:41] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:49:41] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:49:41] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:49:42] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:49:43] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:49:44] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 4 ms to minimize.
[2024-05-31 20:49:44] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:49:44] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:49:44] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:49:44] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:49:45] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:49:45] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 4 ms to minimize.
[2024-05-31 20:49:45] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:49:46] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 4 ms to minimize.
[2024-05-31 20:49:46] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:49:46] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/898 variables, and 157 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/456 constraints, PredecessorRefiner: 0/441 constraints, Known Traps: 117/117 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in LTL mode, iteration 1 : 456/574 places, 442/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61896 ms. Remains : 456/574 places, 442/572 transitions.
Support contains 18 out of 456 places after structural reductions.
[2024-05-31 20:49:48] [INFO ] Flatten gal took : 97 ms
[2024-05-31 20:49:48] [INFO ] Flatten gal took : 47 ms
[2024-05-31 20:49:48] [INFO ] Input system was already deterministic with 442 transitions.
RANDOM walk for 40000 steps (136 resets) in 2282 ms. (17 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40003 steps (12 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 143 ms. (277 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2024-05-31 20:49:49] [INFO ] Invariant cache hit.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 373/424 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/456 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 442/898 variables, 456/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/898 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/898 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 898/898 variables, and 496 constraints, problems are : Problem set: 0 solved, 2 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 48/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 373/424 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:49:49] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-31 20:49:50] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 3 ms to minimize.
[2024-05-31 20:49:51] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-05-31 20:49:51] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:49:51] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/456 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:49:51] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 442/898 variables, 456/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/898 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:49:51] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/898 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/898 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 898/898 variables, and 514 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2311 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 2779ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1146 ms.
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 442/442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 456 transition count 283
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 178 rules applied. Total rules applied 337 place count 297 transition count 264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 349 place count 285 transition count 264
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 349 place count 285 transition count 207
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 463 place count 228 transition count 207
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 466 place count 225 transition count 204
Iterating global reduction 3 with 3 rules applied. Total rules applied 469 place count 225 transition count 204
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 469 place count 225 transition count 202
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 473 place count 223 transition count 202
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 641 place count 139 transition count 107
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 665 place count 139 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 689 place count 115 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 690 place count 114 transition count 82
Reduce places removed 17 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 34 rules applied. Total rules applied 724 place count 97 transition count 65
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 741 place count 80 transition count 65
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 741 place count 80 transition count 53
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 765 place count 68 transition count 53
Applied a total of 765 rules in 138 ms. Remains 68 /456 variables (removed 388) and now considering 53/442 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 68/456 places, 53/442 transitions.
RANDOM walk for 222 steps (0 resets) in 8 ms. (24 steps per ms) remains 0/2 properties
FORMULA AutoFlight-PT-06b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 115 stabilizing places and 115 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) U X(G((p1&&F(p2))))))'
Support contains 5 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 451 transition count 437
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 451 transition count 437
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 449 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 449 transition count 435
Applied a total of 14 rules in 62 ms. Remains 449 /456 variables (removed 7) and now considering 435/442 (removed 7) transitions.
// Phase 1: matrix 435 rows 449 cols
[2024-05-31 20:49:53] [INFO ] Computed 40 invariants in 5 ms
[2024-05-31 20:49:53] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-31 20:49:53] [INFO ] Invariant cache hit.
[2024-05-31 20:49:54] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-05-31 20:49:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:50:02] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 5 ms to minimize.
[2024-05-31 20:50:02] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 4 ms to minimize.
[2024-05-31 20:50:03] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 4 ms to minimize.
[2024-05-31 20:50:03] [INFO ] Deduced a trap composed of 68 places in 223 ms of which 3 ms to minimize.
[2024-05-31 20:50:03] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 4 ms to minimize.
[2024-05-31 20:50:03] [INFO ] Deduced a trap composed of 66 places in 208 ms of which 4 ms to minimize.
[2024-05-31 20:50:03] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 4 ms to minimize.
[2024-05-31 20:50:04] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 4 ms to minimize.
[2024-05-31 20:50:04] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:50:04] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 4 ms to minimize.
[2024-05-31 20:50:04] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 4 ms to minimize.
[2024-05-31 20:50:04] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:50:05] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 4 ms to minimize.
[2024-05-31 20:50:05] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 4 ms to minimize.
[2024-05-31 20:50:05] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-05-31 20:50:05] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 4 ms to minimize.
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 4 ms to minimize.
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:50:11] [INFO ] Deduced a trap composed of 73 places in 227 ms of which 4 ms to minimize.
[2024-05-31 20:50:11] [INFO ] Deduced a trap composed of 62 places in 237 ms of which 5 ms to minimize.
[2024-05-31 20:50:11] [INFO ] Deduced a trap composed of 70 places in 229 ms of which 4 ms to minimize.
[2024-05-31 20:50:11] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 5 ms to minimize.
[2024-05-31 20:50:12] [INFO ] Deduced a trap composed of 68 places in 301 ms of which 5 ms to minimize.
[2024-05-31 20:50:12] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 3 ms to minimize.
[2024-05-31 20:50:12] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 3 ms to minimize.
[2024-05-31 20:50:12] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:50:12] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 4 ms to minimize.
[2024-05-31 20:50:13] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:50:13] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 4 ms to minimize.
[2024-05-31 20:50:13] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 5 ms to minimize.
[2024-05-31 20:50:13] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 5 ms to minimize.
[2024-05-31 20:50:13] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:50:14] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:50:14] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 4 ms to minimize.
[2024-05-31 20:50:14] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 4 ms to minimize.
[2024-05-31 20:50:15] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:50:15] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:50:16] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:50:17] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:50:17] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:50:17] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-05-31 20:50:17] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:50:17] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:50:18] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:50:18] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:50:18] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:50:18] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:50:18] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:50:18] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2024-05-31 20:50:19] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:50:19] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:50:19] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:50:19] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:50:19] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:50:19] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:50:21] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 434 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 449/884 variables, and 98 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 58/98 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:50:29] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:50:29] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:50:29] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-31 20:50:30] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:50:30] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:50:30] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 3 ms to minimize.
[2024-05-31 20:50:30] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:50:30] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:50:32] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:50:33] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:50:35] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:50:35] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 3 ms to minimize.
[2024-05-31 20:50:36] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 4 ms to minimize.
[2024-05-31 20:50:36] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 5 ms to minimize.
[2024-05-31 20:50:36] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 5 ms to minimize.
[2024-05-31 20:50:36] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 3 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 4 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 4 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:50:37] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 4 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:50:38] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:50:39] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:50:40] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:50:41] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 3 ms to minimize.
[2024-05-31 20:50:41] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:50:41] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:50:41] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:50:42] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:50:42] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:50:48] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:50:48] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:50:48] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:50:49] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 5 ms to minimize.
[2024-05-31 20:50:51] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/884 variables, and 140 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 100/100 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 449/456 places, 435/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60836 ms. Remains : 449/456 places, 435/442 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-00
Product exploration explored 100000 steps with 33264 reset in 379 ms.
Product exploration explored 100000 steps with 33193 reset in 273 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/449 stabilizing places and 108/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 207 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (136 resets) in 688 ms. (58 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
[2024-05-31 20:50:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 374/416 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/449 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:50:56] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 435/884 variables, 449/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:57] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/884 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/884 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/884 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/884 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1726 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 374/416 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:50:58] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/449 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 435/884 variables, 449/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/884 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/884 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/884 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/884 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 2188ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 435/435 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 449 transition count 276
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 178 rules applied. Total rules applied 337 place count 290 transition count 257
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 349 place count 278 transition count 257
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 349 place count 278 transition count 202
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 459 place count 223 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 460 place count 222 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 222 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 461 place count 222 transition count 200
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 463 place count 221 transition count 200
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 635 place count 135 transition count 103
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 659 place count 135 transition count 79
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 683 place count 111 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 684 place count 110 transition count 78
Reduce places removed 29 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 75 rules applied. Total rules applied 759 place count 81 transition count 32
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 805 place count 35 transition count 32
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 805 place count 35 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 825 place count 25 transition count 22
Applied a total of 825 rules in 77 ms. Remains 25 /449 variables (removed 424) and now considering 22/435 (removed 413) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 25/449 places, 22/435 transitions.
RANDOM walk for 74 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F p0), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 500 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2024-05-31 20:50:59] [INFO ] Invariant cache hit.
[2024-05-31 20:50:59] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-31 20:50:59] [INFO ] Invariant cache hit.
[2024-05-31 20:51:00] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-05-31 20:51:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:51:08] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 5 ms to minimize.
[2024-05-31 20:51:09] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 4 ms to minimize.
[2024-05-31 20:51:09] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 4 ms to minimize.
[2024-05-31 20:51:09] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 4 ms to minimize.
[2024-05-31 20:51:10] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 6 ms to minimize.
[2024-05-31 20:51:10] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 4 ms to minimize.
[2024-05-31 20:51:10] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 4 ms to minimize.
[2024-05-31 20:51:10] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:51:11] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 4 ms to minimize.
[2024-05-31 20:51:11] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 3 ms to minimize.
[2024-05-31 20:51:11] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 3 ms to minimize.
[2024-05-31 20:51:11] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 3 ms to minimize.
[2024-05-31 20:51:11] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:51:12] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 4 ms to minimize.
[2024-05-31 20:51:12] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-05-31 20:51:12] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 4 ms to minimize.
[2024-05-31 20:51:12] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:51:13] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:51:13] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 4 ms to minimize.
[2024-05-31 20:51:13] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:51:18] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 4 ms to minimize.
[2024-05-31 20:51:18] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 4 ms to minimize.
[2024-05-31 20:51:18] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 4 ms to minimize.
[2024-05-31 20:51:18] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 4 ms to minimize.
[2024-05-31 20:51:19] [INFO ] Deduced a trap composed of 68 places in 275 ms of which 6 ms to minimize.
[2024-05-31 20:51:19] [INFO ] Deduced a trap composed of 70 places in 265 ms of which 4 ms to minimize.
[2024-05-31 20:51:19] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 3 ms to minimize.
[2024-05-31 20:51:19] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 3 ms to minimize.
[2024-05-31 20:51:19] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:51:20] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:51:20] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 4 ms to minimize.
[2024-05-31 20:51:20] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:51:20] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 4 ms to minimize.
[2024-05-31 20:51:20] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:51:20] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:51:21] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:51:21] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:51:22] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 4 ms to minimize.
[2024-05-31 20:51:22] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:51:22] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:51:23] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 4 ms to minimize.
[2024-05-31 20:51:24] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:51:24] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:51:24] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:51:24] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 3 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:51:25] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:51:26] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:51:26] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2024-05-31 20:51:26] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:51:26] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:51:28] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/884 variables, and 98 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 58/98 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:51:35] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:51:35] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:51:35] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:51:35] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:51:36] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:51:36] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:51:36] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:51:36] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:51:38] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:51:39] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:51:41] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 4 ms to minimize.
[2024-05-31 20:51:42] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-05-31 20:51:42] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:51:42] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
[2024-05-31 20:51:42] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:51:42] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:51:42] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:51:43] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 4 ms to minimize.
[2024-05-31 20:51:43] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:51:43] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-31 20:51:43] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 4 ms to minimize.
[2024-05-31 20:51:43] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-05-31 20:51:43] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:51:44] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:51:44] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:51:44] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-31 20:51:44] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-31 20:51:44] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:51:44] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:51:44] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:51:46] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:51:46] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:51:47] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
[2024-05-31 20:51:47] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:51:47] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-31 20:51:47] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:51:47] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:51:54] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:51:54] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:51:54] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:51:55] [INFO ] Deduced a trap composed of 22 places in 216 ms of which 4 ms to minimize.
[2024-05-31 20:51:57] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/884 variables, and 140 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 100/100 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 449/449 places, 435/435 transitions.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/449 stabilizing places and 108/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 201 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (136 resets) in 235 ms. (169 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
[2024-05-31 20:52:01] [INFO ] Invariant cache hit.
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) 148/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 265/416 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 33/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 435/884 variables, 449/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/884 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 884/884 variables, and 489 constraints, problems are : Problem set: 0 solved, 3 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 449/449 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
At refinement iteration 1 (OVERLAPS) 148/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:52:01] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 265/416 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 33/449 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:52:01] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:52:01] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 4 ms to minimize.
[2024-05-31 20:52:02] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:52:02] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:52:02] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:52:02] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:52:02] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:52:02] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:52:02] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 435/884 variables, 449/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/884 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/884 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/884 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 884/884 variables, and 502 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1862 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 2307ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 606 ms.
Support contains 1 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 435/435 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 449 transition count 276
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 178 rules applied. Total rules applied 337 place count 290 transition count 257
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 349 place count 278 transition count 257
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 349 place count 278 transition count 202
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 459 place count 223 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 460 place count 222 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 222 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 461 place count 222 transition count 200
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 463 place count 221 transition count 200
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 635 place count 135 transition count 103
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 659 place count 135 transition count 79
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 683 place count 111 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 684 place count 110 transition count 78
Reduce places removed 29 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 75 rules applied. Total rules applied 759 place count 81 transition count 32
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 805 place count 35 transition count 32
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 805 place count 35 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 825 place count 25 transition count 22
Applied a total of 825 rules in 53 ms. Remains 25 /449 variables (removed 424) and now considering 22/435 (removed 413) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 25/449 places, 22/435 transitions.
RANDOM walk for 51 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p0))), (F (NOT p1)), (F p0), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 491 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33468 reset in 155 ms.
Product exploration explored 100000 steps with 33470 reset in 228 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 449 transition count 435
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 150 place count 449 transition count 429
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 150 place count 449 transition count 429
Deduced a syphon composed of 203 places in 2 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 209 place count 449 transition count 429
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 325 place count 333 transition count 313
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 116 rules applied. Total rules applied 441 place count 333 transition count 313
Performed 104 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 2 with 104 rules applied. Total rules applied 545 place count 333 transition count 302
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 611 place count 267 transition count 236
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 677 place count 267 transition count 236
Deduced a syphon composed of 125 places in 0 ms
Applied a total of 677 rules in 140 ms. Remains 267 /449 variables (removed 182) and now considering 236/435 (removed 199) transitions.
[2024-05-31 20:52:06] [INFO ] Redundant transitions in 13 ms returned []
Running 235 sub problems to find dead transitions.
// Phase 1: matrix 236 rows 267 cols
[2024-05-31 20:52:06] [INFO ] Computed 40 invariants in 6 ms
[2024-05-31 20:52:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 2 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 4 ms to minimize.
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:52:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-31 20:52:10] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/60 constraints. Problems are: Problem set: 79 solved, 156 unsolved
[2024-05-31 20:52:11] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:52:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:52:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-31 20:52:11] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 20:52:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-31 20:52:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-31 20:52:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:52:12] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:52:13] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-31 20:52:13] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-31 20:52:13] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-31 20:52:13] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/80 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/80 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 236/503 variables, 267/347 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 41/388 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 0/388 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/503 variables, 0/388 constraints. Problems are: Problem set: 125 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 388 constraints, problems are : Problem set: 125 solved, 110 unsolved in 12549 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 267/267 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 125 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 122/263 variables, 38/38 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 40/78 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/78 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 4/267 variables, 2/80 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/80 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 236/503 variables, 267/347 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 41/388 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 110/498 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/498 constraints. Problems are: Problem set: 125 solved, 110 unsolved
[2024-05-31 20:52:27] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:52:27] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/503 variables, 2/500 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/500 constraints. Problems are: Problem set: 125 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/503 variables, 0/500 constraints. Problems are: Problem set: 125 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 500 constraints, problems are : Problem set: 125 solved, 110 unsolved in 24685 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 267/267 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 110/235 constraints, Known Traps: 42/42 constraints]
After SMT, in 37383ms problems are : Problem set: 125 solved, 110 unsolved
Search for dead transitions found 125 dead transitions in 37387ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 267/449 places, 111/435 transitions.
Graph (complete) has 358 edges and 267 vertex of which 142 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.2 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 142 /267 variables (removed 125) and now considering 111/111 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 142/449 places, 111/435 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37600 ms. Remains : 142/449 places, 111/435 transitions.
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Applied a total of 0 rules in 23 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 449 cols
[2024-05-31 20:52:43] [INFO ] Computed 40 invariants in 4 ms
[2024-05-31 20:52:43] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-31 20:52:43] [INFO ] Invariant cache hit.
[2024-05-31 20:52:44] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-05-31 20:52:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:52:52] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 5 ms to minimize.
[2024-05-31 20:52:52] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 3 ms to minimize.
[2024-05-31 20:52:53] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 3 ms to minimize.
[2024-05-31 20:52:53] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 4 ms to minimize.
[2024-05-31 20:52:53] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 4 ms to minimize.
[2024-05-31 20:52:53] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 4 ms to minimize.
[2024-05-31 20:52:54] [INFO ] Deduced a trap composed of 18 places in 313 ms of which 5 ms to minimize.
[2024-05-31 20:52:54] [INFO ] Deduced a trap composed of 75 places in 283 ms of which 4 ms to minimize.
[2024-05-31 20:52:54] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:52:54] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:52:55] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 5 ms to minimize.
[2024-05-31 20:52:55] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 5 ms to minimize.
[2024-05-31 20:52:55] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:52:55] [INFO ] Deduced a trap composed of 64 places in 225 ms of which 4 ms to minimize.
[2024-05-31 20:52:56] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2024-05-31 20:52:56] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 3 ms to minimize.
[2024-05-31 20:52:56] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:52:56] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:52:57] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:52:57] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:53:01] [INFO ] Deduced a trap composed of 73 places in 235 ms of which 4 ms to minimize.
[2024-05-31 20:53:01] [INFO ] Deduced a trap composed of 62 places in 252 ms of which 6 ms to minimize.
[2024-05-31 20:53:02] [INFO ] Deduced a trap composed of 70 places in 320 ms of which 6 ms to minimize.
[2024-05-31 20:53:02] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:53:02] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 4 ms to minimize.
[2024-05-31 20:53:02] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 3 ms to minimize.
[2024-05-31 20:53:03] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 4 ms to minimize.
[2024-05-31 20:53:03] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:53:03] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:53:03] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-05-31 20:53:03] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:53:03] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:53:04] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-31 20:53:04] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:53:04] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:53:04] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:53:05] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 4 ms to minimize.
[2024-05-31 20:53:05] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 4 ms to minimize.
[2024-05-31 20:53:06] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:53:06] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:53:07] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 4 ms to minimize.
[2024-05-31 20:53:07] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:53:07] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 4 ms to minimize.
[2024-05-31 20:53:07] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 3 ms to minimize.
[2024-05-31 20:53:08] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:53:08] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:53:08] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:53:08] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:53:08] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:53:09] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-31 20:53:09] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:53:09] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-31 20:53:09] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:53:09] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:53:09] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:53:10] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:53:10] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:53:12] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 434 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 449/884 variables, and 98 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 58/98 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:53:19] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:53:19] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-05-31 20:53:19] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:53:19] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:53:20] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
[2024-05-31 20:53:20] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:53:20] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:53:20] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:53:22] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-05-31 20:53:23] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:53:25] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-31 20:53:25] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 4 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 5 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 5 ms to minimize.
[2024-05-31 20:53:26] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:53:27] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 3 ms to minimize.
[2024-05-31 20:53:27] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:53:27] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 3 ms to minimize.
[2024-05-31 20:53:27] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 4 ms to minimize.
[2024-05-31 20:53:27] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:53:27] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:53:28] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:53:28] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:53:28] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:53:28] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:53:28] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-31 20:53:28] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:53:29] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:53:30] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 4 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 3 ms to minimize.
[2024-05-31 20:53:31] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-31 20:53:32] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 7/135 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-31 20:53:37] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:53:38] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 3 ms to minimize.
[2024-05-31 20:53:38] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-31 20:53:39] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 4 ms to minimize.
[2024-05-31 20:53:41] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/884 variables, and 140 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/449 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 100/100 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60855 ms. Remains : 449/449 places, 435/435 transitions.
Treatment of property AutoFlight-PT-06b-LTLCardinality-00 finished in 231072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 450 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 450 transition count 436
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 447 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 447 transition count 433
Applied a total of 18 rules in 29 ms. Remains 447 /456 variables (removed 9) and now considering 433/442 (removed 9) transitions.
// Phase 1: matrix 433 rows 447 cols
[2024-05-31 20:53:44] [INFO ] Computed 40 invariants in 3 ms
[2024-05-31 20:53:44] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-31 20:53:44] [INFO ] Invariant cache hit.
[2024-05-31 20:53:45] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-05-31 20:53:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-31 20:53:53] [INFO ] Deduced a trap composed of 82 places in 365 ms of which 5 ms to minimize.
[2024-05-31 20:53:54] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 4 ms to minimize.
[2024-05-31 20:53:54] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:53:54] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 4 ms to minimize.
[2024-05-31 20:53:55] [INFO ] Deduced a trap composed of 17 places in 378 ms of which 7 ms to minimize.
[2024-05-31 20:53:55] [INFO ] Deduced a trap composed of 69 places in 282 ms of which 5 ms to minimize.
[2024-05-31 20:53:55] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 5 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 6 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 3 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 4 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 4 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 3 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 3 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 4 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:53:58] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:53:58] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:53:58] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-31 20:54:03] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 4 ms to minimize.
[2024-05-31 20:54:03] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 3 ms to minimize.
[2024-05-31 20:54:03] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:54:03] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 3 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:54:04] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:54:05] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:54:05] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 4 ms to minimize.
[2024-05-31 20:54:05] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 3 ms to minimize.
[2024-05-31 20:54:06] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 4 ms to minimize.
[2024-05-31 20:54:07] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 4 ms to minimize.
[2024-05-31 20:54:07] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-31 20:54:07] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:54:08] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 3 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 3 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:54:11] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 3 ms to minimize.
[2024-05-31 20:54:11] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-31 20:54:13] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/880 variables, and 91 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 51/91 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 79 places in 168 ms of which 4 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:54:20] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:54:21] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 3 ms to minimize.
[2024-05-31 20:54:22] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:54:23] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:54:24] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-31 20:54:27] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:54:27] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:54:27] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:54:27] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 3 ms to minimize.
[2024-05-31 20:54:28] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:54:28] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 4 ms to minimize.
[2024-05-31 20:54:28] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:54:28] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:54:28] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:54:29] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:54:29] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-31 20:54:29] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:54:29] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:54:29] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:54:31] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:54:31] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:54:31] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:54:32] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-05-31 20:54:32] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-31 20:54:34] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 3 ms to minimize.
[2024-05-31 20:54:34] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:54:37] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:54:37] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 4 ms to minimize.
[2024-05-31 20:54:37] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 3 ms to minimize.
[2024-05-31 20:54:38] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 4 ms to minimize.
[2024-05-31 20:54:38] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:54:38] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-31 20:54:41] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 3 ms to minimize.
[2024-05-31 20:54:41] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:54:41] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:54:41] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/880 variables, and 137 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/447 constraints, PredecessorRefiner: 0/432 constraints, Known Traps: 97/97 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 447/456 places, 433/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60913 ms. Remains : 447/456 places, 433/442 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-01
Product exploration explored 100000 steps with 470 reset in 233 ms.
Product exploration explored 100000 steps with 473 reset in 309 ms.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (136 resets) in 380 ms. (104 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
[2024-05-31 20:54:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 146/150 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 264/414 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 33/447 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 433/880 variables, 447/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/880 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/880 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 487 constraints, problems are : Problem set: 0 solved, 3 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 447/447 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 146/150 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:54:47] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 264/414 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 33/447 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 20:54:47] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:54:47] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 433/880 variables, 447/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/880 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/880 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/880 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 493 constraints, problems are : Problem set: 0 solved, 3 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 447/447 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 1289ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 229 ms.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 433/433 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 447 transition count 281
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 170 rules applied. Total rules applied 322 place count 295 transition count 263
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 335 place count 283 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 336 place count 282 transition count 262
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 336 place count 282 transition count 206
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 448 place count 226 transition count 206
Performed 88 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 624 place count 138 transition count 106
Free-agglomeration rule applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 647 place count 138 transition count 83
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 670 place count 115 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 671 place count 114 transition count 82
Reduce places removed 27 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 5 with 72 rules applied. Total rules applied 743 place count 87 transition count 37
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 788 place count 42 transition count 37
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 788 place count 42 transition count 26
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 810 place count 31 transition count 26
Applied a total of 810 rules in 37 ms. Remains 31 /447 variables (removed 416) and now considering 26/433 (removed 407) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 31/447 places, 26/433 transitions.
RANDOM walk for 5927 steps (192 resets) in 14 ms. (395 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 297 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 446 transition count 281
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 169 rules applied. Total rules applied 320 place count 295 transition count 263
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 333 place count 283 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 282 transition count 262
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 334 place count 282 transition count 206
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 446 place count 226 transition count 206
Performed 88 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 622 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 623 place count 137 transition count 105
Reduce places removed 10 places and 0 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 4 with 14 rules applied. Total rules applied 637 place count 127 transition count 101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 641 place count 123 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 641 place count 123 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 653 place count 117 transition count 95
Applied a total of 653 rules in 36 ms. Remains 117 /447 variables (removed 330) and now considering 95/433 (removed 338) transitions.
// Phase 1: matrix 95 rows 117 cols
[2024-05-31 20:54:49] [INFO ] Computed 30 invariants in 1 ms
[2024-05-31 20:54:49] [INFO ] Implicit Places using invariants in 131 ms returned [47, 67, 87, 92, 102, 107, 111, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 145 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/447 places, 95/433 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 103 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 103 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 97 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 97 transition count 83
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 28 place count 95 transition count 81
Applied a total of 28 rules in 28 ms. Remains 95 /109 variables (removed 14) and now considering 81/95 (removed 14) transitions.
// Phase 1: matrix 81 rows 95 cols
[2024-05-31 20:54:49] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 20:54:49] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 20:54:49] [INFO ] Invariant cache hit.
[2024-05-31 20:54:49] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/447 places, 81/433 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 472 ms. Remains : 95/447 places, 81/433 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 579 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 6748 steps (224 resets) in 45 ms. (146 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 630 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering criterion allowed to conclude after 1202 steps with 74 reset in 4 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-01 finished in 66956 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 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 455 transition count 285
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 175 rules applied. Total rules applied 331 place count 299 transition count 266
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 343 place count 287 transition count 266
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 343 place count 287 transition count 210
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 455 place count 231 transition count 210
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 459 place count 227 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 463 place count 227 transition count 206
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 463 place count 227 transition count 203
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 469 place count 224 transition count 203
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 641 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 137 transition count 105
Reduce places removed 10 places and 0 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 3 with 14 rules applied. Total rules applied 656 place count 127 transition count 101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 660 place count 123 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 660 place count 123 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 672 place count 117 transition count 95
Applied a total of 672 rules in 48 ms. Remains 117 /456 variables (removed 339) and now considering 95/442 (removed 347) transitions.
// Phase 1: matrix 95 rows 117 cols
[2024-05-31 20:54:51] [INFO ] Computed 30 invariants in 1 ms
[2024-05-31 20:54:52] [INFO ] Implicit Places using invariants in 528 ms returned [69, 89, 94, 98, 102, 107, 111, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 530 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/456 places, 95/442 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 103 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 103 transition count 89
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 16 place count 101 transition count 87
Applied a total of 16 rules in 9 ms. Remains 101 /109 variables (removed 8) and now considering 87/95 (removed 8) transitions.
// Phase 1: matrix 87 rows 101 cols
[2024-05-31 20:54:52] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:54:52] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 20:54:52] [INFO ] Invariant cache hit.
[2024-05-31 20:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:54:52] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/456 places, 87/442 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 813 ms. Remains : 101/456 places, 87/442 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-09
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-09 finished in 863 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&&G(p1)))) U (!p0&&F(!p2))))'
Support contains 5 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 455 transition count 283
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 177 rules applied. Total rules applied 335 place count 297 transition count 264
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 347 place count 285 transition count 264
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 347 place count 285 transition count 207
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 461 place count 228 transition count 207
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 465 place count 224 transition count 203
Iterating global reduction 3 with 4 rules applied. Total rules applied 469 place count 224 transition count 203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 469 place count 224 transition count 201
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 473 place count 222 transition count 201
Performed 79 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 631 place count 143 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 632 place count 143 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 634 place count 142 transition count 110
Applied a total of 634 rules in 36 ms. Remains 142 /456 variables (removed 314) and now considering 110/442 (removed 332) transitions.
// Phase 1: matrix 110 rows 142 cols
[2024-05-31 20:54:52] [INFO ] Computed 40 invariants in 1 ms
[2024-05-31 20:54:52] [INFO ] Implicit Places using invariants in 137 ms returned [50, 51, 52, 53, 54, 57, 58, 59, 60, 61, 116, 122, 128, 134, 141]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 140 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/456 places, 110/442 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 100
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 117 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 114 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 114 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 109 transition count 92
Applied a total of 36 rules in 11 ms. Remains 109 /127 variables (removed 18) and now considering 92/110 (removed 18) transitions.
// Phase 1: matrix 92 rows 109 cols
[2024-05-31 20:54:52] [INFO ] Computed 25 invariants in 1 ms
[2024-05-31 20:54:52] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 20:54:52] [INFO ] Invariant cache hit.
[2024-05-31 20:54:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:54:52] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/456 places, 92/442 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 455 ms. Remains : 109/456 places, 92/442 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR p0 p2), (OR (NOT p1) (NOT p0)), p2, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-11
Product exploration explored 100000 steps with 9072 reset in 157 ms.
Stack based approach found an accepted trace after 6692 steps with 623 reset with depth 5 and stack size 5 in 12 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-11 finished in 810 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) U X(G((p1&&F(p2))))))'
Found a Lengthening insensitive property : AutoFlight-PT-06b-LTLCardinality-00
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 456 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 456/456 places, 442/442 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 455 transition count 288
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 171 rules applied. Total rules applied 324 place count 302 transition count 270
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 337 place count 290 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 289 transition count 269
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 338 place count 289 transition count 212
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 452 place count 232 transition count 212
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 455 place count 229 transition count 209
Iterating global reduction 4 with 3 rules applied. Total rules applied 458 place count 229 transition count 209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 458 place count 229 transition count 208
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 460 place count 228 transition count 208
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 628 place count 144 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 629 place count 144 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 630 place count 143 transition count 112
Reduce places removed 10 places and 0 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 4 with 14 rules applied. Total rules applied 644 place count 133 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 648 place count 129 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 648 place count 129 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 660 place count 123 transition count 102
Applied a total of 660 rules in 34 ms. Remains 123 /456 variables (removed 333) and now considering 102/442 (removed 340) transitions.
// Phase 1: matrix 102 rows 123 cols
[2024-05-31 20:54:53] [INFO ] Computed 30 invariants in 1 ms
[2024-05-31 20:54:53] [INFO ] Implicit Places using invariants in 120 ms returned [50, 70, 97, 107, 112, 122]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 121 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/456 places, 102/442 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 109 transition count 94
Applied a total of 16 rules in 5 ms. Remains 109 /117 variables (removed 8) and now considering 94/102 (removed 8) transitions.
// Phase 1: matrix 94 rows 109 cols
[2024-05-31 20:54:53] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 20:54:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 20:54:53] [INFO ] Invariant cache hit.
[2024-05-31 20:54:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:54:53] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 109/456 places, 94/442 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 430 ms. Remains : 109/456 places, 94/442 transitions.
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-00
Stuttering criterion allowed to conclude after 17590 steps with 5031 reset in 51 ms.
Treatment of property AutoFlight-PT-06b-LTLCardinality-00 finished in 810 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-31 20:54:53] [INFO ] Flatten gal took : 28 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 368898 ms.
ITS solved all properties within timeout

BK_STOP 1717188894055

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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-06b"
export BK_EXAMINATION="LTLCardinality"
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-06b, examination is LTLCardinality"
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-171620167100147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;