MCC'2024- Execution of r468-smll-171620167000115

About the Execution of LTSMin+red for AutoFlight-PT-04b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
601.292	1819503.00	4848852.00	3150.00	TFFFFFTFFTFFFFTF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167000115.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-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167000115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 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 91K 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-04b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717185171262

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-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:52:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:52:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:52:53] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2024-05-31 19:52:53] [INFO ] Transformed 390 places.
[2024-05-31 19:52:53] [INFO ] Transformed 388 transitions.
[2024-05-31 19:52:53] [INFO ] Found NUPN structural information;
[2024-05-31 19:52:53] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-04b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 350 transition count 348
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 350 transition count 348
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 350 transition count 342
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 102 place count 334 transition count 326
Iterating global reduction 1 with 16 rules applied. Total rules applied 118 place count 334 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 330 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 330 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 327 transition count 319
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 327 transition count 319
Applied a total of 132 rules in 171 ms. Remains 327 /390 variables (removed 63) and now considering 319/388 (removed 69) transitions.
// Phase 1: matrix 319 rows 327 cols
[2024-05-31 19:52:54] [INFO ] Computed 28 invariants in 45 ms
[2024-05-31 19:52:54] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-31 19:52:54] [INFO ] Invariant cache hit.
[2024-05-31 19:52:55] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2024-05-31 19:52:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:00] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 43 ms to minimize.
[2024-05-31 19:53:00] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 4 ms to minimize.
[2024-05-31 19:53:00] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 4 ms to minimize.
[2024-05-31 19:53:01] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 4 ms to minimize.
[2024-05-31 19:53:01] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 4 ms to minimize.
[2024-05-31 19:53:01] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:53:01] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 4 ms to minimize.
[2024-05-31 19:53:01] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:53:01] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:53:01] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:53:02] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:53:02] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:53:02] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:53:02] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:53:02] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:53:02] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:53:02] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:53:03] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:53:03] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:53:03] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 4 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:53:06] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 3 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 6 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:53:07] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:53:08] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:53:08] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:53:08] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:08] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:53:09] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:53:09] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 4 ms to minimize.
[2024-05-31 19:53:09] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:53:09] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:53:09] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:53:09] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:53:10] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 3 ms to minimize.
[2024-05-31 19:53:10] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:53:10] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:53:10] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 4 ms to minimize.
[2024-05-31 19:53:10] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 3 ms to minimize.
[2024-05-31 19:53:11] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:53:11] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 3 ms to minimize.
[2024-05-31 19:53:11] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:53:11] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:53:11] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 5 ms to minimize.
[2024-05-31 19:53:11] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:53:11] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:13] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:53:13] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:53:13] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:53:13] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:53:14] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 3 ms to minimize.
[2024-05-31 19:53:14] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:53:15] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:53:15] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:53:15] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:53:15] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:53:15] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:53:16] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:19] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:53:19] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:53:20] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-31 19:53:20] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:23] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:53:23] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:53:24] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:53:24] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 327/646 variables, and 107 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/327 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/326 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/327 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/327 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 79/107 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:28] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:53:28] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:53:28] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-31 19:53:29] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:53:29] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:31] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 19:53:31] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:53:31] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:53:32] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:53:32] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:53:32] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:53:32] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 3 ms to minimize.
[2024-05-31 19:53:33] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (OVERLAPS) 319/646 variables, 327/447 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 318/765 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:38] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-31 19:53:38] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-05-31 19:53:38] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:53:38] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:53:39] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:53:39] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:53:39] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-31 19:53:39] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:53:40] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:53:41] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:53:41] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:53:42] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:53:42] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:53:42] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:53:42] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:53:43] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:53:44] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 17/782 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2024-05-31 19:53:50] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:53:50] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:53:51] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:53:52] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:53:54] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/646 variables, and 787 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 114/114 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 327/390 places, 319/388 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61510 ms. Remains : 327/390 places, 319/388 transitions.
Support contains 49 out of 327 places after structural reductions.
[2024-05-31 19:53:55] [INFO ] Flatten gal took : 74 ms
[2024-05-31 19:53:55] [INFO ] Flatten gal took : 31 ms
[2024-05-31 19:53:55] [INFO ] Input system was already deterministic with 319 transitions.
Support contains 45 out of 327 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (194 resets) in 2035 ms. (19 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40003 steps (18 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (19 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (17 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (17 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
[2024-05-31 19:53:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 182/194 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 111/305 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/327 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 319/646 variables, 327/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/646 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 355 constraints, problems are : Problem set: 0 solved, 5 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 182/194 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:53:57] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-31 19:53:57] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
[2024-05-31 19:53:57] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 111/305 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:53:57] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-31 19:53:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 22/327 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:53:57] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:53:58] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 319/646 variables, 327/370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:53:59] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:53:59] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:53:59] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:53:59] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 4 ms to minimize.
[2024-05-31 19:54:00] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/646 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 380 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 20/20 constraints]
After SMT, in 3516ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 3211 ms.
Support contains 10 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 319/319 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 327 transition count 212
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 119 rules applied. Total rules applied 226 place count 220 transition count 200
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 233 place count 214 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 213 transition count 199
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 234 place count 213 transition count 160
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 312 place count 174 transition count 160
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 320 place count 166 transition count 152
Iterating global reduction 4 with 8 rules applied. Total rules applied 328 place count 166 transition count 152
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 328 place count 166 transition count 147
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 338 place count 161 transition count 147
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 446 place count 107 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 107 transition count 85
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 462 place count 107 transition count 70
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 477 place count 92 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 478 place count 91 transition count 69
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 19 rules applied. Total rules applied 497 place count 80 transition count 61
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 505 place count 72 transition count 61
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 505 place count 72 transition count 49
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 529 place count 60 transition count 49
Applied a total of 529 rules in 111 ms. Remains 60 /327 variables (removed 267) and now considering 49/319 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 60/327 places, 49/319 transitions.
RANDOM walk for 40000 steps (1387 resets) in 506 ms. (78 steps per ms) remains 0/4 properties
FORMULA AutoFlight-PT-04b-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-04b-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 86 stabilizing places and 86 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 326 transition count 204
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 129 rules applied. Total rules applied 243 place count 212 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 251 place count 204 transition count 189
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 251 place count 204 transition count 149
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 331 place count 164 transition count 149
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 342 place count 153 transition count 138
Iterating global reduction 3 with 11 rules applied. Total rules applied 353 place count 153 transition count 138
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 353 place count 153 transition count 132
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 365 place count 147 transition count 132
Performed 53 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 471 place count 94 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 472 place count 93 transition count 71
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 482 place count 86 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 485 place count 83 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 485 place count 83 transition count 64
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 493 place count 79 transition count 64
Applied a total of 493 rules in 54 ms. Remains 79 /327 variables (removed 248) and now considering 64/319 (removed 255) transitions.
// Phase 1: matrix 64 rows 79 cols
[2024-05-31 19:54:04] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 19:54:04] [INFO ] Implicit Places using invariants in 89 ms returned [32, 46, 60, 64, 68, 73, 78]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 92 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/327 places, 64/319 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 67 transition count 59
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 64 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 63 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 63 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 62 transition count 54
Applied a total of 20 rules in 20 ms. Remains 62 /72 variables (removed 10) and now considering 54/64 (removed 10) transitions.
// Phase 1: matrix 54 rows 62 cols
[2024-05-31 19:54:04] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 19:54:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 19:54:04] [INFO ] Invariant cache hit.
[2024-05-31 19:54:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:54:04] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/327 places, 54/319 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 364 ms. Remains : 62/327 places, 54/319 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-02
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-02 finished in 637 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((X(p0)||F((X(p2)||p1)))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 313 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 306 transition count 297
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 306 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 305 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 305 transition count 296
Applied a total of 45 rules in 36 ms. Remains 305 /327 variables (removed 22) and now considering 296/319 (removed 23) transitions.
// Phase 1: matrix 296 rows 305 cols
[2024-05-31 19:54:04] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 19:54:04] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 19:54:04] [INFO ] Invariant cache hit.
[2024-05-31 19:54:05] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 19:54:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:09] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
[2024-05-31 19:54:09] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 4 ms to minimize.
[2024-05-31 19:54:09] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:54:09] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:54:10] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:54:10] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:54:10] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-05-31 19:54:10] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:54:10] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:54:10] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:54:10] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:54:11] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:54:11] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:54:11] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:54:11] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:54:11] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:54:12] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:54:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:54:12] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:16] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:54:16] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:54:16] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:54:16] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:54:17] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:54:17] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:54:17] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:54:17] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:54:17] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:54:17] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:19] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:54:19] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:54:19] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:54:20] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:21] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:54:22] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:54:23] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:26] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 296/601 variables, 305/370 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:33] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:54:33] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:54:34] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/601 variables, and 373 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:38] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 3 ms to minimize.
[2024-05-31 19:54:38] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 2 ms to minimize.
[2024-05-31 19:54:38] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:54:38] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 3 ms to minimize.
[2024-05-31 19:54:38] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:54:39] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:54:39] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:54:39] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:54:39] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:54:39] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:54:40] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 296/601 variables, 305/384 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 295/679 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:44] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:54:45] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-05-31 19:54:45] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:54:45] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-31 19:54:45] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:54:46] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:54:46] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:54:46] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:54:46] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:54:47] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:54:47] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 11/690 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:54:56] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 692 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 64/64 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 305/327 places, 296/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 305/327 places, 296/319 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-03
Product exploration explored 100000 steps with 622 reset in 384 ms.
Product exploration explored 100000 steps with 616 reset in 297 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 18858 steps (91 resets) in 240 ms. (78 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 263 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 305 /305 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-31 19:55:07] [INFO ] Invariant cache hit.
[2024-05-31 19:55:07] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-31 19:55:07] [INFO ] Invariant cache hit.
[2024-05-31 19:55:07] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 19:55:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:11] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 4 ms to minimize.
[2024-05-31 19:55:11] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:55:12] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:55:12] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:55:12] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 4 ms to minimize.
[2024-05-31 19:55:12] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:55:12] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:55:12] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:55:12] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:55:13] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:55:13] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:55:13] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:55:13] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2024-05-31 19:55:13] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:55:13] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 3 ms to minimize.
[2024-05-31 19:55:14] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:55:14] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:55:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:55:15] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:18] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:55:18] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-05-31 19:55:19] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:55:19] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:55:19] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:55:19] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:55:19] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-31 19:55:19] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:55:19] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 3 ms to minimize.
[2024-05-31 19:55:20] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:21] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:55:21] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:55:21] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:55:22] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:23] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:55:24] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:55:25] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:28] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 296/601 variables, 305/370 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:35] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:55:35] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:55:36] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/601 variables, and 373 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:40] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:55:40] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 3 ms to minimize.
[2024-05-31 19:55:40] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:55:40] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:55:41] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:55:41] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:55:41] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:55:41] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:55:41] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:55:41] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:55:42] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 296/601 variables, 305/384 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 295/679 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:46] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:55:47] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:55:47] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-31 19:55:47] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:55:47] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:55:48] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 3 ms to minimize.
[2024-05-31 19:55:48] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 3 ms to minimize.
[2024-05-31 19:55:48] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:55:49] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:55:49] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:55:49] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 11/690 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:55:58] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 692 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 64/64 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 305/305 places, 296/296 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 24140 steps (117 resets) in 112 ms. (213 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 620 reset in 164 ms.
Product exploration explored 100000 steps with 616 reset in 404 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 296/296 transitions.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 305 transition count 296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 96 place count 305 transition count 292
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 96 place count 305 transition count 292
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 137 place count 305 transition count 292
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 209 place count 233 transition count 220
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 281 place count 233 transition count 220
Performed 72 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 353 place count 233 transition count 212
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 398 place count 188 transition count 167
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 443 place count 188 transition count 167
Deduced a syphon composed of 88 places in 1 ms
Applied a total of 443 rules in 59 ms. Remains 188 /305 variables (removed 117) and now considering 167/296 (removed 129) transitions.
[2024-05-31 19:56:09] [INFO ] Redundant transitions in 6 ms returned []
Running 166 sub problems to find dead transitions.
// Phase 1: matrix 167 rows 188 cols
[2024-05-31 19:56:09] [INFO ] Computed 28 invariants in 3 ms
[2024-05-31 19:56:09] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 19:56:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 20/48 constraints. Problems are: Problem set: 70 solved, 96 unsolved
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-31 19:56:12] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-31 19:56:13] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-31 19:56:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-31 19:56:13] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-31 19:56:13] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 7/55 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/55 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 167/355 variables, 188/243 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 27/270 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/270 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/355 variables, 0/270 constraints. Problems are: Problem set: 88 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 270 constraints, problems are : Problem set: 88 solved, 78 unsolved in 6683 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 188/188 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 88 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 84/183 variables, 26/26 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 27/53 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/53 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 5/188 variables, 2/55 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/55 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 167/355 variables, 188/243 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 27/270 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 78/348 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/348 constraints. Problems are: Problem set: 88 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/355 variables, 0/348 constraints. Problems are: Problem set: 88 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 348 constraints, problems are : Problem set: 88 solved, 78 unsolved in 4661 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 188/188 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/166 constraints, Known Traps: 27/27 constraints]
After SMT, in 11461ms problems are : Problem set: 88 solved, 78 unsolved
Search for dead transitions found 88 dead transitions in 11464ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 188/305 places, 79/296 transitions.
Graph (complete) has 247 edges and 188 vertex of which 100 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.2 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 100 /188 variables (removed 88) and now considering 79/79 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/305 places, 79/296 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11550 ms. Remains : 100/305 places, 79/296 transitions.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 296/296 transitions.
Applied a total of 0 rules in 8 ms. Remains 305 /305 variables (removed 0) and now considering 296/296 (removed 0) transitions.
// Phase 1: matrix 296 rows 305 cols
[2024-05-31 19:56:21] [INFO ] Computed 28 invariants in 3 ms
[2024-05-31 19:56:21] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-31 19:56:21] [INFO ] Invariant cache hit.
[2024-05-31 19:56:21] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 19:56:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:25] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 4 ms to minimize.
[2024-05-31 19:56:25] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 4 ms to minimize.
[2024-05-31 19:56:26] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:56:26] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2024-05-31 19:56:26] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:56:26] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:56:26] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:56:26] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:56:26] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:56:27] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:56:27] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:56:27] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:56:27] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:56:27] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:56:27] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-05-31 19:56:28] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:56:28] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:56:28] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-31 19:56:29] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:32] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:56:32] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:56:33] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-05-31 19:56:33] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-31 19:56:33] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:56:33] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:56:33] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:56:33] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:56:34] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-31 19:56:34] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:35] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:56:35] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:56:35] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:56:37] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:38] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2024-05-31 19:56:38] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:56:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:42] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 296/601 variables, 305/370 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:49] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:56:50] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:56:50] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/601 variables, and 373 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 40/68 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:56:54] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:56:54] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-31 19:56:54] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:56:54] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:56:55] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-31 19:56:55] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:56:55] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:56:55] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:56:55] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:56:55] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:56:56] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (OVERLAPS) 296/601 variables, 305/384 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 295/679 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:57:00] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:57:01] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:57:01] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-05-31 19:57:01] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:57:01] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:57:02] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:57:02] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:57:02] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:57:02] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:57:03] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:57:03] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 11/690 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:57:12] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 19:57:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:57:21] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
SMT process timed out in 60128ms, After SMT, problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in LTL mode , in 1 iterations and 60592 ms. Remains : 305/305 places, 296/296 transitions.
Treatment of property AutoFlight-PT-04b-LTLCardinality-03 finished in 197049 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 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 326 transition count 207
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 126 rules applied. Total rules applied 237 place count 215 transition count 192
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 246 place count 207 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 206 transition count 191
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 247 place count 206 transition count 151
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 166 transition count 151
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 337 place count 156 transition count 141
Iterating global reduction 4 with 10 rules applied. Total rules applied 347 place count 156 transition count 141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 347 place count 156 transition count 135
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 359 place count 150 transition count 135
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 467 place count 96 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 468 place count 95 transition count 73
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 10 rules applied. Total rules applied 478 place count 88 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 481 place count 85 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 481 place count 85 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 489 place count 81 transition count 66
Applied a total of 489 rules in 47 ms. Remains 81 /327 variables (removed 246) and now considering 66/319 (removed 253) transitions.
// Phase 1: matrix 66 rows 81 cols
[2024-05-31 19:57:21] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 19:57:21] [INFO ] Implicit Places using invariants in 86 ms returned [32, 46, 62, 66, 70, 75, 80]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 89 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/327 places, 66/319 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 69 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 69 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 68 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 68 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 67 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 67 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 66 transition count 58
Applied a total of 16 rules in 12 ms. Remains 66 /74 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 66 cols
[2024-05-31 19:57:21] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 19:57:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 19:57:22] [INFO ] Invariant cache hit.
[2024-05-31 19:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:57:22] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/327 places, 58/319 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 66/327 places, 58/319 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-04
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-04 finished in 369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 312 transition count 304
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 312 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 312 transition count 302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 305 transition count 295
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 305 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 304 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 304 transition count 294
Applied a total of 48 rules in 31 ms. Remains 304 /327 variables (removed 23) and now considering 294/319 (removed 25) transitions.
// Phase 1: matrix 294 rows 304 cols
[2024-05-31 19:57:22] [INFO ] Computed 28 invariants in 3 ms
[2024-05-31 19:57:22] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-31 19:57:22] [INFO ] Invariant cache hit.
[2024-05-31 19:57:22] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-31 19:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 3 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 3 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:57:28] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:57:28] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:57:28] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:57:28] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:57:28] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:57:28] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:57:29] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:57:29] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:57:29] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:57:29] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:57:29] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:57:31] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:57:31] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:57:31] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:57:31] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:57:32] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-31 19:57:32] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
[2024-05-31 19:57:32] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:57:32] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 3 ms to minimize.
[2024-05-31 19:57:32] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 3 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-31 19:57:33] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:57:34] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:57:34] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2024-05-31 19:57:34] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 3 ms to minimize.
[2024-05-31 19:57:34] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:57:34] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:57:35] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:57:35] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:57:35] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:57:35] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:57:35] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:57:36] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:57:36] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:57:36] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:57:36] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-31 19:57:37] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:57:37] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:57:37] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:57:37] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-31 19:57:37] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:57:37] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 3 ms to minimize.
[2024-05-31 19:57:37] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:57:38] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:57:38] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:57:38] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:57:38] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-31 19:57:39] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-31 19:57:39] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:57:43] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:57:43] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-31 19:57:45] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-05-31 19:57:45] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-31 19:57:46] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
[2024-05-31 19:57:46] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 293 unsolved
(s276 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 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 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.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 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.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 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 293 unsolved
SMT process timed out in 30059ms, After SMT, problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 30062ms
Starting structural reductions in LTL mode, iteration 1 : 304/327 places, 294/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30573 ms. Remains : 304/327 places, 294/319 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 106 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-05 finished in 30712 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((X(F(p1))||p0))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 326 transition count 204
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 129 rules applied. Total rules applied 243 place count 212 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 251 place count 204 transition count 189
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 251 place count 204 transition count 150
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 329 place count 165 transition count 150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 339 place count 155 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 349 place count 155 transition count 140
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 349 place count 155 transition count 133
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 363 place count 148 transition count 133
Performed 53 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 469 place count 95 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 470 place count 94 transition count 72
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 480 place count 87 transition count 69
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 483 place count 84 transition count 69
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 483 place count 84 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 491 place count 80 transition count 65
Applied a total of 491 rules in 35 ms. Remains 80 /327 variables (removed 247) and now considering 65/319 (removed 254) transitions.
// Phase 1: matrix 65 rows 80 cols
[2024-05-31 19:57:52] [INFO ] Computed 21 invariants in 1 ms
[2024-05-31 19:57:53] [INFO ] Implicit Places using invariants in 144 ms returned [33, 47, 61, 65, 69, 74, 79]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 155 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/327 places, 65/319 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 68 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 68 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 67 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 67 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 66 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 66 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 65 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 65 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 64 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 64 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 63 transition count 55
Applied a total of 20 rules in 8 ms. Remains 63 /73 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 63 cols
[2024-05-31 19:57:53] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 19:57:53] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 19:57:53] [INFO ] Invariant cache hit.
[2024-05-31 19:57:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:57:53] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/327 places, 55/319 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 457 ms. Remains : 63/327 places, 55/319 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-06
Product exploration explored 100000 steps with 4844 reset in 204 ms.
Product exploration explored 100000 steps with 4842 reset in 469 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 515 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1906 resets) in 114 ms. (347 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (221 resets) in 273 ms. (146 steps per ms) remains 1/1 properties
[2024-05-31 19:57:54] [INFO ] Invariant cache hit.
[2024-05-31 19:57:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/118 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/63 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-04b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-04b-LTLCardinality-06 finished in 2075 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 (G(p0)||(p0&&G((F(!p1)||X(X(!p2)))))))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 312 transition count 304
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 312 transition count 304
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 312 transition count 302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 305 transition count 295
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 305 transition count 295
Applied a total of 46 rules in 13 ms. Remains 305 /327 variables (removed 22) and now considering 295/319 (removed 24) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-31 19:57:54] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 19:57:55] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-31 19:57:55] [INFO ] Invariant cache hit.
[2024-05-31 19:57:55] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 19:57:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:58:02] [INFO ] Deduced a trap composed of 52 places in 304 ms of which 6 ms to minimize.
[2024-05-31 19:58:02] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 6 ms to minimize.
[2024-05-31 19:58:02] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 5 ms to minimize.
[2024-05-31 19:58:03] [INFO ] Deduced a trap composed of 48 places in 267 ms of which 5 ms to minimize.
[2024-05-31 19:58:03] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 5 ms to minimize.
[2024-05-31 19:58:03] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 5 ms to minimize.
[2024-05-31 19:58:04] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 5 ms to minimize.
[2024-05-31 19:58:04] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 5 ms to minimize.
[2024-05-31 19:58:04] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 4 ms to minimize.
[2024-05-31 19:58:04] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 5 ms to minimize.
[2024-05-31 19:58:04] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 4 ms to minimize.
[2024-05-31 19:58:05] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 4 ms to minimize.
[2024-05-31 19:58:05] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 4 ms to minimize.
[2024-05-31 19:58:05] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 4 ms to minimize.
[2024-05-31 19:58:05] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 4 ms to minimize.
[2024-05-31 19:58:05] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 4 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 4 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 4 ms to minimize.
[2024-05-31 19:58:06] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:58:10] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 4 ms to minimize.
[2024-05-31 19:58:10] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 4 ms to minimize.
[2024-05-31 19:58:10] [INFO ] Deduced a trap composed of 18 places in 213 ms of which 5 ms to minimize.
[2024-05-31 19:58:11] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 4 ms to minimize.
[2024-05-31 19:58:11] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 4 ms to minimize.
[2024-05-31 19:58:11] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 3 ms to minimize.
[2024-05-31 19:58:12] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 4 ms to minimize.
[2024-05-31 19:58:12] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-05-31 19:58:12] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:58:12] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 4 ms to minimize.
[2024-05-31 19:58:12] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:58:13] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 4 ms to minimize.
[2024-05-31 19:58:13] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 4 ms to minimize.
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 4 ms to minimize.
[2024-05-31 19:58:14] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 4 ms to minimize.
[2024-05-31 19:58:15] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-05-31 19:58:15] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:58:18] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 4 ms to minimize.
[2024-05-31 19:58:18] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 294 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 1.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 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 294 unsolved
SMT process timed out in 30059ms, After SMT, problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 30065ms
Starting structural reductions in LTL mode, iteration 1 : 305/327 places, 295/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30723 ms. Remains : 305/327 places, 295/319 transitions.
Stuttering acceptance computed with spot in 502 ms :[(NOT p0), (AND p1 (NOT p0) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-09
Product exploration explored 100000 steps with 695 reset in 342 ms.
Product exploration explored 100000 steps with 714 reset in 327 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p1), (X (X (AND p1 p0 p2))), (X (X p2)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 159 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
RANDOM walk for 25887 steps (126 resets) in 345 ms. (74 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p1), (X (X (AND p1 p0 p2))), (X (X p2)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 p0 p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 642 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 468 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 458 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 7 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-31 19:58:29] [INFO ] Invariant cache hit.
[2024-05-31 19:58:29] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-31 19:58:29] [INFO ] Invariant cache hit.
[2024-05-31 19:58:29] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 19:58:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:58:36] [INFO ] Deduced a trap composed of 52 places in 295 ms of which 5 ms to minimize.
[2024-05-31 19:58:36] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 5 ms to minimize.
[2024-05-31 19:58:37] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 5 ms to minimize.
[2024-05-31 19:58:37] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 5 ms to minimize.
[2024-05-31 19:58:37] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 5 ms to minimize.
[2024-05-31 19:58:37] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 5 ms to minimize.
[2024-05-31 19:58:38] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 5 ms to minimize.
[2024-05-31 19:58:38] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 4 ms to minimize.
[2024-05-31 19:58:38] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 5 ms to minimize.
[2024-05-31 19:58:38] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 5 ms to minimize.
[2024-05-31 19:58:38] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 4 ms to minimize.
[2024-05-31 19:58:39] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 4 ms to minimize.
[2024-05-31 19:58:39] [INFO ] Deduced a trap composed of 53 places in 195 ms of which 4 ms to minimize.
[2024-05-31 19:58:39] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 4 ms to minimize.
[2024-05-31 19:58:39] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 4 ms to minimize.
[2024-05-31 19:58:40] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 4 ms to minimize.
[2024-05-31 19:58:40] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 3 ms to minimize.
[2024-05-31 19:58:40] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 4 ms to minimize.
[2024-05-31 19:58:40] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 4 ms to minimize.
[2024-05-31 19:58:40] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:58:44] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 4 ms to minimize.
[2024-05-31 19:58:44] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 5 ms to minimize.
[2024-05-31 19:58:45] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 4 ms to minimize.
[2024-05-31 19:58:45] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 4 ms to minimize.
[2024-05-31 19:58:45] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
[2024-05-31 19:58:46] [INFO ] Deduced a trap composed of 56 places in 200 ms of which 4 ms to minimize.
[2024-05-31 19:58:46] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:58:46] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 3 ms to minimize.
[2024-05-31 19:58:46] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 4 ms to minimize.
[2024-05-31 19:58:46] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 3 ms to minimize.
[2024-05-31 19:58:46] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 3 ms to minimize.
[2024-05-31 19:58:47] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 4 ms to minimize.
[2024-05-31 19:58:48] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:58:48] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-31 19:58:48] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:58:48] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 4 ms to minimize.
[2024-05-31 19:58:49] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 4 ms to minimize.
[2024-05-31 19:58:49] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
[2024-05-31 19:58:49] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:58:52] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 4 ms to minimize.
[2024-05-31 19:58:53] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 294 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 1.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 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 294 unsolved
SMT process timed out in 30055ms, After SMT, problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 30061ms
Finished structural reductions in LTL mode , in 1 iterations and 30763 ms. Remains : 305/305 places, 295/295 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X p1), (X (X (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 255 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
RANDOM walk for 29250 steps (142 resets) in 568 ms. (51 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X p1), (X (X (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 682 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 471 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 363 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Product exploration explored 100000 steps with 712 reset in 189 ms.
Product exploration explored 100000 steps with 709 reset in 216 ms.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 4 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-31 19:59:03] [INFO ] Invariant cache hit.
[2024-05-31 19:59:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 19:59:03] [INFO ] Invariant cache hit.
[2024-05-31 19:59:03] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 19:59:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:59:08] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 4 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 4 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 4 ms to minimize.
[2024-05-31 19:59:09] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 5 ms to minimize.
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 4 ms to minimize.
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 4 ms to minimize.
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 4 ms to minimize.
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 4 ms to minimize.
[2024-05-31 19:59:10] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 4 ms to minimize.
[2024-05-31 19:59:11] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 4 ms to minimize.
[2024-05-31 19:59:11] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 4 ms to minimize.
[2024-05-31 19:59:11] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 3 ms to minimize.
[2024-05-31 19:59:11] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 4 ms to minimize.
[2024-05-31 19:59:11] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 3 ms to minimize.
[2024-05-31 19:59:12] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 4 ms to minimize.
[2024-05-31 19:59:12] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 4 ms to minimize.
[2024-05-31 19:59:12] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-05-31 19:59:12] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 4 ms to minimize.
[2024-05-31 19:59:12] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:59:15] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 5 ms to minimize.
[2024-05-31 19:59:15] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 5 ms to minimize.
[2024-05-31 19:59:16] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 4 ms to minimize.
[2024-05-31 19:59:16] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 4 ms to minimize.
[2024-05-31 19:59:16] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 4 ms to minimize.
[2024-05-31 19:59:17] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 3 ms to minimize.
[2024-05-31 19:59:17] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 4 ms to minimize.
[2024-05-31 19:59:17] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-05-31 19:59:17] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 4 ms to minimize.
[2024-05-31 19:59:17] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 4 ms to minimize.
[2024-05-31 19:59:17] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:59:18] [INFO ] Deduced a trap composed of 55 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:59:19] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 4 ms to minimize.
[2024-05-31 19:59:19] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2024-05-31 19:59:19] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:59:19] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 4 ms to minimize.
[2024-05-31 19:59:20] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 4 ms to minimize.
[2024-05-31 19:59:20] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:59:20] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:59:24] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 4 ms to minimize.
[2024-05-31 19:59:24] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 295/600 variables, 305/374 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/600 variables, and 374 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 41/69 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:59:38] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 4 ms to minimize.
[2024-05-31 19:59:38] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:59:38] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 4 ms to minimize.
[2024-05-31 19:59:38] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 3 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 4 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 4 ms to minimize.
[2024-05-31 19:59:39] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:59:43] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
[2024-05-31 19:59:43] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:59:43] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:59:43] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:59:43] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:59:47] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:59:47] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:59:47] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:59:47] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-05-31 19:59:48] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:59:48] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:59:49] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 4 ms to minimize.
[2024-05-31 19:59:49] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 4 ms to minimize.
[2024-05-31 19:59:49] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 19:59:53] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 295/600 variables, 305/398 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 294/692 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:00:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:00:01] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:00:01] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 4 ms to minimize.
[2024-05-31 20:00:02] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 4 ms to minimize.
[2024-05-31 20:00:02] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 697 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 70/70 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in LTL mode , in 1 iterations and 60514 ms. Remains : 305/305 places, 295/295 transitions.
Treatment of property AutoFlight-PT-04b-LTLCardinality-09 finished in 129129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p0)||X(G(p1)))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 313 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 307 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 306 transition count 296
Applied a total of 44 rules in 33 ms. Remains 306 /327 variables (removed 21) and now considering 296/319 (removed 23) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-31 20:00:04] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:00:04] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-31 20:00:04] [INFO ] Invariant cache hit.
[2024-05-31 20:00:04] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 20:00:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:11] [INFO ] Deduced a trap composed of 48 places in 287 ms of which 5 ms to minimize.
[2024-05-31 20:00:11] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 5 ms to minimize.
[2024-05-31 20:00:11] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 5 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 4 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 4 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 54 places in 224 ms of which 5 ms to minimize.
[2024-05-31 20:00:12] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 5 ms to minimize.
[2024-05-31 20:00:13] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 4 ms to minimize.
[2024-05-31 20:00:13] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 5 ms to minimize.
[2024-05-31 20:00:13] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 4 ms to minimize.
[2024-05-31 20:00:13] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:00:14] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 5 ms to minimize.
[2024-05-31 20:00:14] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 5 ms to minimize.
[2024-05-31 20:00:14] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:00:15] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 4 ms to minimize.
[2024-05-31 20:00:15] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 4 ms to minimize.
[2024-05-31 20:00:15] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 5 ms to minimize.
[2024-05-31 20:00:16] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:00:16] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 4 ms to minimize.
[2024-05-31 20:00:16] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:20] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:00:21] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-31 20:00:21] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 4 ms to minimize.
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:00:24] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:00:25] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 4 ms to minimize.
[2024-05-31 20:00:26] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:00:26] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 4 ms to minimize.
[2024-05-31 20:00:26] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 4 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 5 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 3 ms to minimize.
[2024-05-31 20:00:27] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2024-05-31 20:00:28] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 2 ms to minimize.
[2024-05-31 20:00:28] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 3 ms to minimize.
[2024-05-31 20:00:28] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:30] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/602 variables, and 67 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:38] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:00:39] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:00:39] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:00:39] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:00:39] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:00:40] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 4 ms to minimize.
[2024-05-31 20:00:40] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:43] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:46] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:00:47] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 4 ms to minimize.
[2024-05-31 20:00:48] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:51] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:00:52] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:00:52] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:00:55] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (OVERLAPS) 296/602 variables, 306/388 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 295/683 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:01:03] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:01:03] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 6 ms to minimize.
[2024-05-31 20:01:04] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 3 ms to minimize.
SMT process timed out in 60214ms, After SMT, problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 306/327 places, 296/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60906 ms. Remains : 306/327 places, 296/319 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 164 steps with 4 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-10 finished in 61221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(X(p1))&&G(p2)))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 316 transition count 308
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 316 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 316 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 310 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 310 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 309 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 309 transition count 300
Applied a total of 37 rules in 35 ms. Remains 309 /327 variables (removed 18) and now considering 300/319 (removed 19) transitions.
// Phase 1: matrix 300 rows 309 cols
[2024-05-31 20:01:05] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:01:05] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-31 20:01:05] [INFO ] Invariant cache hit.
[2024-05-31 20:01:06] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-05-31 20:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:12] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 5 ms to minimize.
[2024-05-31 20:01:12] [INFO ] Deduced a trap composed of 55 places in 248 ms of which 5 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 16 places in 256 ms of which 4 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 4 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 5 ms to minimize.
[2024-05-31 20:01:13] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:01:14] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:01:14] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:01:14] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:01:14] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 4 ms to minimize.
[2024-05-31 20:01:14] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 5 ms to minimize.
[2024-05-31 20:01:15] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 5 ms to minimize.
[2024-05-31 20:01:15] [INFO ] Deduced a trap composed of 56 places in 219 ms of which 5 ms to minimize.
[2024-05-31 20:01:15] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:01:15] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 4 ms to minimize.
[2024-05-31 20:01:16] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 4 ms to minimize.
[2024-05-31 20:01:16] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 4 ms to minimize.
[2024-05-31 20:01:16] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 5 ms to minimize.
[2024-05-31 20:01:16] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:01:17] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:20] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:01:20] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:01:21] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 3 ms to minimize.
[2024-05-31 20:01:21] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 3 ms to minimize.
[2024-05-31 20:01:21] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
[2024-05-31 20:01:21] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 3 ms to minimize.
[2024-05-31 20:01:22] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:01:22] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:01:22] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 5 ms to minimize.
[2024-05-31 20:01:22] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 4 ms to minimize.
[2024-05-31 20:01:23] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:01:23] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 3 ms to minimize.
[2024-05-31 20:01:24] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:01:24] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-31 20:01:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:26] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:01:27] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 4 ms to minimize.
[2024-05-31 20:01:27] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:01:27] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:01:27] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:01:27] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:01:27] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 3 ms to minimize.
[2024-05-31 20:01:28] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:01:28] [INFO ] Deduced a trap composed of 61 places in 145 ms of which 3 ms to minimize.
[2024-05-31 20:01:28] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 4 ms to minimize.
[2024-05-31 20:01:28] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 4 ms to minimize.
[2024-05-31 20:01:29] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:01:30] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:01:30] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 3 ms to minimize.
[2024-05-31 20:01:30] [INFO ] Deduced a trap composed of 63 places in 204 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:32] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:01:32] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:01:32] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:01:33] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/609 variables, and 82 constraints, problems are : Problem set: 0 solved, 299 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/309 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 54/82 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:40] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 4 ms to minimize.
[2024-05-31 20:01:41] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:01:41] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:44] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:01:45] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:48] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 5 ms to minimize.
[2024-05-31 20:01:48] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 4 ms to minimize.
[2024-05-31 20:01:49] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 5 ms to minimize.
[2024-05-31 20:01:49] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:01:49] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 4 ms to minimize.
[2024-05-31 20:01:49] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:01:50] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:01:50] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:01:50] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 3 ms to minimize.
[2024-05-31 20:01:50] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:01:50] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:01:51] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:01:51] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 4 ms to minimize.
[2024-05-31 20:01:52] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 4 ms to minimize.
[2024-05-31 20:01:52] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:56] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-05-31 20:01:58] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:01:58] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 4 ms to minimize.
[2024-05-31 20:01:58] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 4 ms to minimize.
[2024-05-31 20:01:58] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 4 ms to minimize.
[2024-05-31 20:01:59] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 4 ms to minimize.
[2024-05-31 20:01:59] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:02:00] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 299 unsolved
SMT process timed out in 60069ms, After SMT, problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 309/327 places, 300/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 309/327 places, 300/319 transitions.
Stuttering acceptance computed with spot in 519 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-11 finished in 61369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 313 transition count 303
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 307 transition count 297
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 306 transition count 296
Applied a total of 44 rules in 28 ms. Remains 306 /327 variables (removed 21) and now considering 296/319 (removed 23) transitions.
// Phase 1: matrix 296 rows 306 cols
[2024-05-31 20:02:06] [INFO ] Computed 28 invariants in 6 ms
[2024-05-31 20:02:06] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-31 20:02:06] [INFO ] Invariant cache hit.
[2024-05-31 20:02:07] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 295 sub problems to find dead transitions.
[2024-05-31 20:02:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:14] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 5 ms to minimize.
[2024-05-31 20:02:14] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 5 ms to minimize.
[2024-05-31 20:02:14] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 5 ms to minimize.
[2024-05-31 20:02:15] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 5 ms to minimize.
[2024-05-31 20:02:15] [INFO ] Deduced a trap composed of 63 places in 280 ms of which 5 ms to minimize.
[2024-05-31 20:02:15] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:02:15] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 5 ms to minimize.
[2024-05-31 20:02:16] [INFO ] Deduced a trap composed of 52 places in 249 ms of which 5 ms to minimize.
[2024-05-31 20:02:16] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 5 ms to minimize.
[2024-05-31 20:02:16] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 4 ms to minimize.
[2024-05-31 20:02:16] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 4 ms to minimize.
[2024-05-31 20:02:17] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:02:17] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 4 ms to minimize.
[2024-05-31 20:02:17] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 4 ms to minimize.
[2024-05-31 20:02:18] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 5 ms to minimize.
[2024-05-31 20:02:18] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:02:18] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 4 ms to minimize.
[2024-05-31 20:02:18] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 4 ms to minimize.
[2024-05-31 20:02:18] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:02:19] [INFO ] Deduced a trap composed of 52 places in 200 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:23] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 4 ms to minimize.
[2024-05-31 20:02:23] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 4 ms to minimize.
[2024-05-31 20:02:23] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 4 ms to minimize.
[2024-05-31 20:02:23] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 4 ms to minimize.
[2024-05-31 20:02:24] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-05-31 20:02:24] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:02:24] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:02:24] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:02:24] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:02:24] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:02:25] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:02:25] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 4 ms to minimize.
[2024-05-31 20:02:25] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 4 ms to minimize.
[2024-05-31 20:02:26] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:02:26] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:29] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:02:29] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 4 ms to minimize.
[2024-05-31 20:02:29] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:33] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/602 variables, and 67 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (OVERLAPS) 1/306 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 39/67 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:41] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:02:41] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:02:41] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:02:41] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:02:42] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 4 ms to minimize.
[2024-05-31 20:02:42] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:02:42] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:02:42] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 4 ms to minimize.
[2024-05-31 20:02:42] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-31 20:02:43] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 3 ms to minimize.
[2024-05-31 20:02:43] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:02:43] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 3 ms to minimize.
[2024-05-31 20:02:43] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:02:44] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:47] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-31 20:02:48] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:51] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 4 ms to minimize.
[2024-05-31 20:02:52] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:02:54] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 4 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:02:55] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 296/602 variables, 306/396 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 295/691 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 4 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 4 ms to minimize.
[2024-05-31 20:03:04] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-31 20:03:05] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 4 ms to minimize.
[2024-05-31 20:03:06] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/602 variables, and 697 constraints, problems are : Problem set: 0 solved, 295 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 68/68 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 306/327 places, 296/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 306/327 places, 296/319 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-13 finished in 61100 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((X(G(p1))||p0)))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 313 transition count 305
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 313 transition count 305
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 313 transition count 303
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 306 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 305 transition count 295
Applied a total of 46 rules in 28 ms. Remains 305 /327 variables (removed 22) and now considering 295/319 (removed 24) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-31 20:03:07] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:03:08] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-31 20:03:08] [INFO ] Invariant cache hit.
[2024-05-31 20:03:08] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 20:03:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:15] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 5 ms to minimize.
[2024-05-31 20:03:15] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 5 ms to minimize.
[2024-05-31 20:03:15] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 4 ms to minimize.
[2024-05-31 20:03:15] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 5 ms to minimize.
[2024-05-31 20:03:16] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 5 ms to minimize.
[2024-05-31 20:03:16] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:03:16] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 4 ms to minimize.
[2024-05-31 20:03:16] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 4 ms to minimize.
[2024-05-31 20:03:17] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:03:17] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 5 ms to minimize.
[2024-05-31 20:03:17] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 4 ms to minimize.
[2024-05-31 20:03:17] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 3 ms to minimize.
[2024-05-31 20:03:17] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 4 ms to minimize.
[2024-05-31 20:03:18] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 4 ms to minimize.
[2024-05-31 20:03:18] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 5 ms to minimize.
[2024-05-31 20:03:18] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 4 ms to minimize.
[2024-05-31 20:03:19] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 4 ms to minimize.
[2024-05-31 20:03:19] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-05-31 20:03:19] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:03:19] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:22] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 4 ms to minimize.
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 4 ms to minimize.
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:03:23] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 4 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 4 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-05-31 20:03:24] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 4 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 4 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:03:25] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 3 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 4 ms to minimize.
[2024-05-31 20:03:26] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:03:27] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:28] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 3 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:03:30] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 4 ms to minimize.
[2024-05-31 20:03:31] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:32] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:03:34] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 4 ms to minimize.
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 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/600 variables, and 75 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 47/75 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:43] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 4 ms to minimize.
[2024-05-31 20:03:43] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 3 ms to minimize.
[2024-05-31 20:03:43] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:03:43] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:03:43] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:03:44] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 4 ms to minimize.
[2024-05-31 20:03:45] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:03:45] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:03:45] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 3 ms to minimize.
[2024-05-31 20:03:46] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:47] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 4 ms to minimize.
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 4 ms to minimize.
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:03:48] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 4 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 4 ms to minimize.
[2024-05-31 20:03:52] [INFO ] Deduced a trap composed of 63 places in 149 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 295/600 variables, 305/398 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 294/692 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:00] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:04:01] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:04:02] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 4 ms to minimize.
[2024-05-31 20:04:02] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 696 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 69/69 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 305/327 places, 295/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60819 ms. Remains : 305/327 places, 295/319 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-14
Product exploration explored 100000 steps with 490 reset in 275 ms.
Product exploration explored 100000 steps with 489 reset in 312 ms.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (196 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2024-05-31 20:04:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 230/283 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 295/600 variables, 305/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/600 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 230/283 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 3 ms to minimize.
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 295/600 variables, 305/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:04:10] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/600 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1075 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1422ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 16 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-31 20:04:11] [INFO ] Invariant cache hit.
[2024-05-31 20:04:11] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-31 20:04:11] [INFO ] Invariant cache hit.
[2024-05-31 20:04:12] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 20:04:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:18] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 5 ms to minimize.
[2024-05-31 20:04:19] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 5 ms to minimize.
[2024-05-31 20:04:19] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 5 ms to minimize.
[2024-05-31 20:04:19] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 5 ms to minimize.
[2024-05-31 20:04:19] [INFO ] Deduced a trap composed of 46 places in 234 ms of which 5 ms to minimize.
[2024-05-31 20:04:19] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:04:20] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 4 ms to minimize.
[2024-05-31 20:04:20] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 4 ms to minimize.
[2024-05-31 20:04:20] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 5 ms to minimize.
[2024-05-31 20:04:20] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:04:21] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 4 ms to minimize.
[2024-05-31 20:04:21] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 4 ms to minimize.
[2024-05-31 20:04:21] [INFO ] Deduced a trap composed of 52 places in 169 ms of which 3 ms to minimize.
[2024-05-31 20:04:21] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:04:21] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 4 ms to minimize.
[2024-05-31 20:04:22] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 5 ms to minimize.
[2024-05-31 20:04:22] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 4 ms to minimize.
[2024-05-31 20:04:22] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 4 ms to minimize.
[2024-05-31 20:04:22] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 3 ms to minimize.
[2024-05-31 20:04:22] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:26] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 4 ms to minimize.
[2024-05-31 20:04:26] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:04:26] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:04:26] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 4 ms to minimize.
[2024-05-31 20:04:27] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:04:27] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 4 ms to minimize.
[2024-05-31 20:04:27] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 4 ms to minimize.
[2024-05-31 20:04:28] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 4 ms to minimize.
[2024-05-31 20:04:28] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 4 ms to minimize.
[2024-05-31 20:04:28] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:04:28] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:04:28] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:04:28] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:04:29] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:04:29] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 4 ms to minimize.
[2024-05-31 20:04:29] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:04:30] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 4 ms to minimize.
[2024-05-31 20:04:30] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:04:30] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-31 20:04:31] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:31] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:04:33] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 4 ms to minimize.
[2024-05-31 20:04:33] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-05-31 20:04:34] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 4 ms to minimize.
[2024-05-31 20:04:34] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:36] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:04:37] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/600 variables, and 75 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 47/75 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:46] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2024-05-31 20:04:46] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:04:46] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:04:46] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 3 ms to minimize.
[2024-05-31 20:04:47] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:04:48] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 3 ms to minimize.
[2024-05-31 20:04:48] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:04:48] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 4 ms to minimize.
[2024-05-31 20:04:48] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:04:49] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:51] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:04:51] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:04:51] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 4 ms to minimize.
[2024-05-31 20:04:51] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-31 20:04:52] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:04:55] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:04:55] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-05-31 20:04:56] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 295/600 variables, 305/398 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 294/692 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 3 ms to minimize.
[2024-05-31 20:05:04] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 4 ms to minimize.
[2024-05-31 20:05:05] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 4 ms to minimize.
[2024-05-31 20:05:05] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 4 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 1)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(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 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 696 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 69/69 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 305/305 places, 295/295 transitions.
Computed a total of 74 stabilizing places and 74 stable transitions
Computed a total of 74 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (193 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (21 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2024-05-31 20:05:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 230/283 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 295/600 variables, 305/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/600 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 230/283 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:05:13] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:05:13] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 295/600 variables, 305/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:05:13] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:05:13] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/600 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/600 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1364ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 489 reset in 271 ms.
Product exploration explored 100000 steps with 490 reset in 310 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 305 transition count 295
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 305 transition count 291
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 102 place count 305 transition count 291
Deduced a syphon composed of 139 places in 1 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 143 place count 305 transition count 291
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 222 place count 226 transition count 212
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 301 place count 226 transition count 212
Performed 68 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 68 rules applied. Total rules applied 369 place count 226 transition count 205
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 414 place count 181 transition count 160
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 459 place count 181 transition count 160
Deduced a syphon composed of 83 places in 0 ms
Applied a total of 459 rules in 60 ms. Remains 181 /305 variables (removed 124) and now considering 160/295 (removed 135) transitions.
[2024-05-31 20:05:15] [INFO ] Redundant transitions in 8 ms returned []
Running 159 sub problems to find dead transitions.
// Phase 1: matrix 160 rows 181 cols
[2024-05-31 20:05:15] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:05:15] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 3 ms to minimize.
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 2 places in 134 ms of which 3 ms to minimize.
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 2 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 3 ms to minimize.
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2024-05-31 20:05:19] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 3 ms to minimize.
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 20/48 constraints. Problems are: Problem set: 51 solved, 108 unsolved
[2024-05-31 20:05:20] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
[2024-05-31 20:05:21] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 10/58 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/58 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 160/341 variables, 181/239 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 29/268 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 83 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 83 solved, 76 unsolved in 10436 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 83 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 81/178 variables, 26/26 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 30/56 constraints. Problems are: Problem set: 83 solved, 76 unsolved
[2024-05-31 20:05:26] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 83 solved, 76 unsolved
[2024-05-31 20:05:27] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/58 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/58 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 3/181 variables, 2/60 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/60 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 160/341 variables, 181/241 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 29/270 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 76/346 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/346 constraints. Problems are: Problem set: 83 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/346 constraints. Problems are: Problem set: 83 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 346 constraints, problems are : Problem set: 83 solved, 76 unsolved in 8424 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/181 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 76/159 constraints, Known Traps: 32/32 constraints]
After SMT, in 18929ms problems are : Problem set: 83 solved, 76 unsolved
Search for dead transitions found 83 dead transitions in 18934ms
Found 83 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 83 transitions
Dead transitions reduction (with SMT) removed 83 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/305 places, 77/295 transitions.
Graph (complete) has 245 edges and 181 vertex of which 98 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.1 ms
Discarding 83 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 98 /181 variables (removed 83) and now considering 77/77 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/305 places, 77/295 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19015 ms. Remains : 98/305 places, 77/295 transitions.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 295/295 transitions.
Applied a total of 0 rules in 7 ms. Remains 305 /305 variables (removed 0) and now considering 295/295 (removed 0) transitions.
// Phase 1: matrix 295 rows 305 cols
[2024-05-31 20:05:34] [INFO ] Computed 28 invariants in 3 ms
[2024-05-31 20:05:34] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-31 20:05:34] [INFO ] Invariant cache hit.
[2024-05-31 20:05:35] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-31 20:05:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:05:41] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 6 ms to minimize.
[2024-05-31 20:05:41] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 5 ms to minimize.
[2024-05-31 20:05:42] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 5 ms to minimize.
[2024-05-31 20:05:42] [INFO ] Deduced a trap composed of 50 places in 255 ms of which 5 ms to minimize.
[2024-05-31 20:05:42] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 5 ms to minimize.
[2024-05-31 20:05:42] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2024-05-31 20:05:43] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 4 ms to minimize.
[2024-05-31 20:05:43] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 4 ms to minimize.
[2024-05-31 20:05:43] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 5 ms to minimize.
[2024-05-31 20:05:43] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:05:43] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 4 ms to minimize.
[2024-05-31 20:05:44] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:05:44] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 4 ms to minimize.
[2024-05-31 20:05:44] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 3 ms to minimize.
[2024-05-31 20:05:44] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 5 ms to minimize.
[2024-05-31 20:05:44] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 5 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 4 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 3 ms to minimize.
[2024-05-31 20:05:45] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 4 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 5 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:05:49] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 3 ms to minimize.
[2024-05-31 20:05:50] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 5 ms to minimize.
[2024-05-31 20:05:50] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:05:50] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 4 ms to minimize.
[2024-05-31 20:05:50] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 4 ms to minimize.
[2024-05-31 20:05:51] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 3 ms to minimize.
[2024-05-31 20:05:51] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:05:51] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:05:51] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:05:51] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-31 20:05:51] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-31 20:05:51] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:05:52] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 4 ms to minimize.
[2024-05-31 20:05:52] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 5 ms to minimize.
[2024-05-31 20:05:52] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-31 20:05:53] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:05:53] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:05:54] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:05:55] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 4 ms to minimize.
[2024-05-31 20:05:56] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:05:58] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 3 ms to minimize.
[2024-05-31 20:05:59] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 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 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.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 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.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 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/600 variables, and 75 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/305 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 47/75 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:06:09] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 4 ms to minimize.
[2024-05-31 20:06:09] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 3 ms to minimize.
[2024-05-31 20:06:10] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:06:10] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 3 ms to minimize.
[2024-05-31 20:06:10] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2024-05-31 20:06:11] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:06:11] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 3 ms to minimize.
[2024-05-31 20:06:12] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 4 ms to minimize.
[2024-05-31 20:06:12] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:06:12] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:06:14] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 4 ms to minimize.
[2024-05-31 20:06:14] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-31 20:06:14] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 5 ms to minimize.
[2024-05-31 20:06:15] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 3 ms to minimize.
[2024-05-31 20:06:15] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:06:18] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 4 ms to minimize.
[2024-05-31 20:06:18] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-31 20:06:19] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 295/600 variables, 305/398 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 294/692 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 20:06:27] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 3 ms to minimize.
[2024-05-31 20:06:27] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-05-31 20:06:28] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 4 ms to minimize.
[2024-05-31 20:06:29] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 696 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 69/69 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in LTL mode , in 1 iterations and 60735 ms. Remains : 305/305 places, 295/295 transitions.
Treatment of property AutoFlight-PT-04b-LTLCardinality-14 finished in 207394 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((X(p0)||F((X(p2)||p1)))))'
Found a Lengthening insensitive property : AutoFlight-PT-04b-LTLCardinality-03
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 326 transition count 213
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 119 rules applied. Total rules applied 224 place count 221 transition count 199
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 234 place count 213 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 236 place count 211 transition count 197
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 236 place count 211 transition count 158
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 314 place count 172 transition count 158
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 324 place count 162 transition count 148
Iterating global reduction 4 with 10 rules applied. Total rules applied 334 place count 162 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 334 place count 162 transition count 141
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 348 place count 155 transition count 141
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 456 place count 101 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 457 place count 100 transition count 79
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 465 place count 94 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 467 place count 92 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 467 place count 92 transition count 73
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 475 place count 88 transition count 73
Applied a total of 475 rules in 37 ms. Remains 88 /327 variables (removed 239) and now considering 73/319 (removed 246) transitions.
// Phase 1: matrix 73 rows 88 cols
[2024-05-31 20:06:35] [INFO ] Computed 22 invariants in 1 ms
[2024-05-31 20:06:35] [INFO ] Implicit Places using invariants in 149 ms returned [33, 49, 65, 82, 87]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 150 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 83/327 places, 73/319 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 79 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 79 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 78 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 78 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 77 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 76 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 76 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 73 transition count 63
Applied a total of 20 rules in 11 ms. Remains 73 /83 variables (removed 10) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 73 cols
[2024-05-31 20:06:35] [INFO ] Computed 17 invariants in 1 ms
[2024-05-31 20:06:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 20:06:35] [INFO ] Invariant cache hit.
[2024-05-31 20:06:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:06:35] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 73/327 places, 63/319 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 465 ms. Remains : 73/327 places, 63/319 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-03
Product exploration explored 100000 steps with 5886 reset in 271 ms.
Stack based approach found an accepted trace after 88394 steps with 5260 reset with depth 14 and stack size 14 in 269 ms.
Treatment of property AutoFlight-PT-04b-LTLCardinality-03 finished in 1392 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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 (G(p0)||(p0&&G((F(!p1)||X(X(!p2)))))))))'
Found a Lengthening insensitive property : AutoFlight-PT-04b-LTLCardinality-09
Stuttering acceptance computed with spot in 466 ms :[(NOT p0), (AND p1 (NOT p0) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 326 transition count 207
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 123 rules applied. Total rules applied 234 place count 215 transition count 195
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 241 place count 209 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 208 transition count 194
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 242 place count 208 transition count 153
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 324 place count 167 transition count 153
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 335 place count 156 transition count 142
Iterating global reduction 4 with 11 rules applied. Total rules applied 346 place count 156 transition count 142
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 346 place count 156 transition count 135
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 360 place count 149 transition count 135
Performed 49 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 458 place count 100 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 459 place count 100 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 460 place count 99 transition count 78
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 8 rules applied. Total rules applied 468 place count 93 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 470 place count 91 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 470 place count 91 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 478 place count 87 transition count 72
Applied a total of 478 rules in 29 ms. Remains 87 /327 variables (removed 240) and now considering 72/319 (removed 247) transitions.
// Phase 1: matrix 72 rows 87 cols
[2024-05-31 20:06:37] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 20:06:37] [INFO ] Implicit Places using invariants in 190 ms returned [36, 50, 64, 68, 74, 86]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 192 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 81/327 places, 72/319 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 77 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 77 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 76 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 76 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 75 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 75 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 74 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 74 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 73 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 73 transition count 64
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 20 place count 71 transition count 62
Applied a total of 20 rules in 8 ms. Remains 71 /81 variables (removed 10) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 71 cols
[2024-05-31 20:06:37] [INFO ] Computed 16 invariants in 0 ms
[2024-05-31 20:06:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 20:06:37] [INFO ] Invariant cache hit.
[2024-05-31 20:06:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 20:06:37] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 71/327 places, 62/319 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 484 ms. Remains : 71/327 places, 62/319 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-09
Product exploration explored 100000 steps with 5714 reset in 206 ms.
Product exploration explored 100000 steps with 5783 reset in 222 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 10 factoid took 341 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
RANDOM walk for 3579 steps (143 resets) in 61 ms. (57 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p2)), (X (X (NOT p2))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 p0 p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 856 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 473 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-31 20:06:40] [INFO ] Invariant cache hit.
[2024-05-31 20:06:40] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 20:06:40] [INFO ] Invariant cache hit.
[2024-05-31 20:06:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 20:06:41] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-31 20:06:41] [INFO ] Invariant cache hit.
[2024-05-31 20:06:41] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/71 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-31 20:06:41] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/133 variables, 71/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1836 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 71/71 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/133 variables, 71/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 53/153 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-31 20:06:43] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 154 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2630 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 71/71 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 2/2 constraints]
After SMT, in 4480ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 4482ms
Finished structural reductions in LTL mode , in 1 iterations and 4767 ms. Remains : 71/71 places, 62/62 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 10 factoid took 433 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 476 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
RANDOM walk for 2378 steps (92 resets) in 62 ms. (37 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 821 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 462 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Stuttering acceptance computed with spot in 461 ms :[(AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1), (AND p1 (NOT p0) p2)]
Product exploration explored 100000 steps with 5689 reset in 420 ms.
Product exploration explored 100000 steps with 5722 reset in 508 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 71 /71 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-31 20:06:49] [INFO ] Invariant cache hit.
[2024-05-31 20:06:49] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-31 20:06:49] [INFO ] Invariant cache hit.
[2024-05-31 20:06:50] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 20:06:50] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-31 20:06:50] [INFO ] Invariant cache hit.
[2024-05-31 20:06:50] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/71 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-31 20:06:50] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/133 variables, 71/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 100 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 71/71 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 62/133 variables, 71/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 53/153 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-31 20:06:52] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 154 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2763 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 71/71 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 2/2 constraints]
After SMT, in 4458ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 4459ms
Finished structural reductions in LTL mode , in 1 iterations and 4655 ms. Remains : 71/71 places, 62/62 transitions.
Treatment of property AutoFlight-PT-04b-LTLCardinality-09 finished in 17983 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((X(G(p1))||p0)))'
Found a Lengthening insensitive property : AutoFlight-PT-04b-LTLCardinality-14
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 319/319 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 326 transition count 204
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 128 rules applied. Total rules applied 242 place count 212 transition count 190
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 250 place count 204 transition count 190
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 250 place count 204 transition count 151
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 328 place count 165 transition count 151
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 155 transition count 141
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 155 transition count 141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 348 place count 155 transition count 135
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 360 place count 149 transition count 135
Performed 50 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 460 place count 99 transition count 78
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 99 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 462 place count 98 transition count 77
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 10 rules applied. Total rules applied 472 place count 91 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 475 place count 88 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 475 place count 88 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 483 place count 84 transition count 70
Applied a total of 483 rules in 28 ms. Remains 84 /327 variables (removed 243) and now considering 70/319 (removed 249) transitions.
// Phase 1: matrix 70 rows 84 cols
[2024-05-31 20:06:54] [INFO ] Computed 21 invariants in 0 ms
[2024-05-31 20:06:54] [INFO ] Implicit Places using invariants in 76 ms returned [69, 73, 78, 83]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 78 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 80/327 places, 70/319 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 78 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 78 transition count 68
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 75 transition count 65
Applied a total of 10 rules in 4 ms. Remains 75 /80 variables (removed 5) and now considering 65/70 (removed 5) transitions.
// Phase 1: matrix 65 rows 75 cols
[2024-05-31 20:06:54] [INFO ] Computed 17 invariants in 0 ms
[2024-05-31 20:06:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 20:06:54] [INFO ] Invariant cache hit.
[2024-05-31 20:06:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 20:06:55] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 75/327 places, 65/319 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 276 ms. Remains : 75/327 places, 65/319 transitions.
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-14
Product exploration explored 100000 steps with 5139 reset in 145 ms.
Product exploration explored 100000 steps with 5152 reset in 175 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2063 resets) in 79 ms. (500 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (310 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-31 20:06:55] [INFO ] Invariant cache hit.
[2024-05-31 20:06:55] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/107 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/139 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/140 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/107 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:06:55] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/139 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/140 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 236ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-31 20:06:56] [INFO ] Invariant cache hit.
[2024-05-31 20:06:56] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-31 20:06:56] [INFO ] Invariant cache hit.
[2024-05-31 20:06:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 20:06:56] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-31 20:06:56] [INFO ] Invariant cache hit.
[2024-05-31 20:06:56] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-31 20:06:56] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/75 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-31 20:06:57] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 65/140 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 101 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/75 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 65/140 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 50/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 151 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
After SMT, in 3540ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 3542ms
Finished structural reductions in LTL mode , in 1 iterations and 3763 ms. Remains : 75/75 places, 65/65 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 338 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2050 resets) in 95 ms. (416 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (308 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2024-05-31 20:07:00] [INFO ] Invariant cache hit.
[2024-05-31 20:07:00] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/107 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 32/139 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/140 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/107 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:07:00] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/139 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/140 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 338 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5153 reset in 198 ms.
Product exploration explored 100000 steps with 5171 reset in 173 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-31 20:07:02] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-31 20:07:02] [INFO ] Invariant cache hit.
[2024-05-31 20:07:02] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-31 20:07:02] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/75 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-31 20:07:03] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 65/140 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 101 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2508 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/75 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 65/140 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 50/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 151 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
After SMT, in 4590ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 4591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4601 ms. Remains : 75/75 places, 65/65 transitions.
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-31 20:07:06] [INFO ] Invariant cache hit.
[2024-05-31 20:07:07] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 20:07:07] [INFO ] Invariant cache hit.
[2024-05-31 20:07:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-31 20:07:07] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-31 20:07:07] [INFO ] Invariant cache hit.
[2024-05-31 20:07:07] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-31 20:07:07] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/75 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-31 20:07:08] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 65/140 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 101 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/75 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 65/140 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 50/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 151 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1962 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 75/75 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 2/2 constraints]
After SMT, in 4490ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 4492ms
Finished structural reductions in LTL mode , in 1 iterations and 4808 ms. Remains : 75/75 places, 65/65 transitions.
Treatment of property AutoFlight-PT-04b-LTLCardinality-14 finished in 17191 ms.
[2024-05-31 20:07:11] [INFO ] Flatten gal took : 34 ms
[2024-05-31 20:07:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-31 20:07:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 319 transitions and 768 arcs took 8 ms.
Total runtime 858598 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-04b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-04b-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutoFlight-PT-04b-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717186990765

--------------------
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
mcc2024
ltl formula name AutoFlight-PT-04b-LTLCardinality-03
ltl formula formula --ltl=/tmp/5357/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 319 transitions and 768 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5357/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5357/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5357/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5357/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 329 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 404 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~225 levels ~10000 states ~42236 transitions
pnml2lts-mc( 1/ 4): ~225 levels ~20000 states ~89512 transitions
pnml2lts-mc( 1/ 4): ~225 levels ~40000 states ~193800 transitions
pnml2lts-mc( 0/ 4): ~201 levels ~80000 states ~340240 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~160000 states ~682100 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~320000 states ~1399736 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~640000 states ~3199968 transitions
pnml2lts-mc( 0/ 4): ~202 levels ~1280000 states ~6546448 transitions
pnml2lts-mc( 1/ 4): ~242 levels ~2560000 states ~15098104 transitions
pnml2lts-mc( 3/ 4): ~199 levels ~5120000 states ~24513808 transitions
pnml2lts-mc( 3/ 4): ~199 levels ~10240000 states ~52941388 transitions
pnml2lts-mc( 3/ 4): ~199 levels ~20480000 states ~108254512 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33548879
pnml2lts-mc( 0/ 4): unique states count: 33549618
pnml2lts-mc( 0/ 4): unique transitions count: 217656558
pnml2lts-mc( 0/ 4): - self-loop count: 40
pnml2lts-mc( 0/ 4): - claim dead count: 184102101
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33549634
pnml2lts-mc( 0/ 4): - cum. max stack depth: 839
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549634 states 217656586 transitions, fanout: 6.488
pnml2lts-mc( 0/ 4): Total exploration time 295.960 sec (295.920 sec minimum, 295.932 sec on average)
pnml2lts-mc( 0/ 4): States per second: 113359, Transitions per second: 735426
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.5MB, 8.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.5MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-04b-LTLCardinality-09
ltl formula formula --ltl=/tmp/5357/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 319 transitions and 768 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5357/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5357/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5357/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5357/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 328 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 423 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~196 levels ~10000 states ~59844 transitions
pnml2lts-mc( 3/ 4): ~196 levels ~20000 states ~132720 transitions
pnml2lts-mc( 1/ 4): ~196 levels ~40000 states ~306456 transitions
pnml2lts-mc( 2/ 4): ~200 levels ~80000 states ~618220 transitions
pnml2lts-mc( 2/ 4): ~200 levels ~160000 states ~1344632 transitions
pnml2lts-mc( 0/ 4): ~197 levels ~320000 states ~2587552 transitions
pnml2lts-mc( 2/ 4): ~200 levels ~640000 states ~6266736 transitions
pnml2lts-mc( 2/ 4): ~200 levels ~1280000 states ~13330064 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~2560000 states ~29179112 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~5120000 states ~59198680 transitions
pnml2lts-mc( 3/ 4): ~213 levels ~10240000 states ~121133052 transitions
pnml2lts-mc( 0/ 4): ~197 levels ~20480000 states ~258441964 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33542985
pnml2lts-mc( 0/ 4): unique states count: 33543694
pnml2lts-mc( 0/ 4): unique transitions count: 463708534
pnml2lts-mc( 0/ 4): - self-loop count: 28
pnml2lts-mc( 0/ 4): - claim dead count: 430152310
pnml2lts-mc( 0/ 4): - claim found count: 28
pnml2lts-mc( 0/ 4): - claim success count: 33543706
pnml2lts-mc( 0/ 4): - cum. max stack depth: 806
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33543706 states 463708579 transitions, fanout: 13.824
pnml2lts-mc( 0/ 4): Total exploration time 363.330 sec (363.290 sec minimum, 363.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 92323, Transitions per second: 1276274
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.2MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.2MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-04b-LTLCardinality-14
ltl formula formula --ltl=/tmp/5357/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 327 places, 319 transitions and 768 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5357/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5357/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5357/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5357/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 329 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 328, there are 332 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~195 levels ~10000 states ~35396 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~20000 states ~75844 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~40000 states ~169524 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~80000 states ~357444 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~160000 states ~733516 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~320000 states ~1608900 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~640000 states ~3399288 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~1280000 states ~6993740 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~2560000 states ~15254932 transitions
pnml2lts-mc( 2/ 4): ~195 levels ~5120000 states ~31782640 transitions
pnml2lts-mc( 0/ 4): ~199 levels ~10240000 states ~66006172 transitions
pnml2lts-mc( 0/ 4): ~199 levels ~20480000 states ~134625948 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33548965
pnml2lts-mc( 0/ 4): unique states count: 33549694
pnml2lts-mc( 0/ 4): unique transitions count: 241947164
pnml2lts-mc( 0/ 4): - self-loop count: 23
pnml2lts-mc( 0/ 4): - claim dead count: 208392703
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33549711
pnml2lts-mc( 0/ 4): - cum. max stack depth: 843
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549711 states 241947194 transitions, fanout: 7.212
pnml2lts-mc( 0/ 4): Total exploration time 297.740 sec (297.690 sec minimum, 297.708 sec on average)
pnml2lts-mc( 0/ 4): States per second: 112681, Transitions per second: 812612
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.7MB, 8.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 322 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-04b"
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-04b, 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-171620167000115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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