Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729500548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is AutoFlight-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729500548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 266K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748631453939

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 18:57:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 18:57:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 18:57:35] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-05-30 18:57:35] [INFO ] Transformed 1126 places.
[2025-05-30 18:57:35] [INFO ] Transformed 1124 transitions.
[2025-05-30 18:57:35] [INFO ] Found NUPN structural information;
[2025-05-30 18:57:35] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutoFlight-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 144 places :
Symmetric choice reduction at 0 with 144 rule applications. Total rules 144 place count 982 transition count 980
Iterating global reduction 0 with 144 rules applied. Total rules applied 288 place count 982 transition count 980
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 310 place count 982 transition count 958
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 373 place count 919 transition count 895
Iterating global reduction 1 with 63 rules applied. Total rules applied 436 place count 919 transition count 895
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 446 place count 909 transition count 885
Iterating global reduction 1 with 10 rules applied. Total rules applied 456 place count 909 transition count 885
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 465 place count 900 transition count 876
Iterating global reduction 1 with 9 rules applied. Total rules applied 474 place count 900 transition count 876
Applied a total of 474 rules in 389 ms. Remains 900 /1126 variables (removed 226) and now considering 876/1124 (removed 248) transitions.
// Phase 1: matrix 876 rows 900 cols
[2025-05-30 18:57:36] [INFO ] Computed 76 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:57:36] [INFO ] Implicit Places using invariants in 607 ms returned []
[2025-05-30 18:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:57:37] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Running 875 sub problems to find dead transitions.
[2025-05-30 18:57:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/899 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 875 unsolved
SMT process timed out in 30234ms, After SMT, problems are : Problem set: 0 solved, 875 unsolved
Search for dead transitions found 0 dead transitions in 30248ms
Starting structural reductions in LTL mode, iteration 1 : 900/1126 places, 876/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32107 ms. Remains : 900/1126 places, 876/1124 transitions.
Support contains 32 out of 900 places after structural reductions.
[2025-05-30 18:58:07] [INFO ] Flatten gal took : 79 ms
[2025-05-30 18:58:07] [INFO ] Flatten gal took : 42 ms
[2025-05-30 18:58:08] [INFO ] Input system was already deterministic with 876 transitions.
Support contains 30 out of 900 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (71 resets) in 1609 ms. (24 steps per ms) remains 11/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
[2025-05-30 18:58:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 252/267 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 570/837 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/837 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 63/900 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:09] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:09] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:10] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:10] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:10] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:10] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:10] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:11] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:11] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:11] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:11] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:11] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:12] [INFO ] Deduced a trap composed of 77 places in 183 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:12] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:12] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:12] [INFO ] Deduced a trap composed of 85 places in 183 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:12] [INFO ] Deduced a trap composed of 86 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:13] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:13] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:13] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:13] [INFO ] Deduced a trap composed of 90 places in 210 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:14] [INFO ] Deduced a trap composed of 102 places in 199 ms of which 58 ms to minimize.
SMT process timed out in 5096ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 876/876 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 900 transition count 566
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 344 rules applied. Total rules applied 654 place count 590 transition count 532
Reduce places removed 22 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 26 rules applied. Total rules applied 680 place count 568 transition count 528
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 687 place count 564 transition count 525
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 688 place count 563 transition count 525
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 104 Pre rules applied. Total rules applied 688 place count 563 transition count 421
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 5 with 208 rules applied. Total rules applied 896 place count 459 transition count 421
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 900 place count 455 transition count 417
Iterating global reduction 5 with 4 rules applied. Total rules applied 904 place count 455 transition count 417
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 904 place count 455 transition count 414
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 910 place count 452 transition count 414
Performed 171 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 5 with 342 rules applied. Total rules applied 1252 place count 281 transition count 222
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1255 place count 281 transition count 219
Free-agglomeration rule applied 47 times.
Iterating global reduction 5 with 47 rules applied. Total rules applied 1302 place count 281 transition count 172
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1349 place count 234 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1350 place count 233 transition count 171
Reduce places removed 49 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 6 with 116 rules applied. Total rules applied 1466 place count 184 transition count 104
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 68 rules applied. Total rules applied 1534 place count 117 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1535 place count 116 transition count 103
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 26 Pre rules applied. Total rules applied 1535 place count 116 transition count 77
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 1587 place count 90 transition count 77
Applied a total of 1587 rules in 153 ms. Remains 90 /900 variables (removed 810) and now considering 77/876 (removed 799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 90/900 places, 77/876 transitions.
RANDOM walk for 40000 steps (446 resets) in 910 ms. (43 steps per ms) remains 1/11 properties
BEST_FIRST walk for 4580 steps (10 resets) in 14 ms. (305 steps per ms) remains 0/1 properties
Computed a total of 225 stabilizing places and 225 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 883 transition count 859
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 883 transition count 859
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 883 transition count 857
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 877 transition count 851
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 874 transition count 848
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 874 transition count 848
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 872 transition count 846
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 872 transition count 846
Applied a total of 58 rules in 144 ms. Remains 872 /900 variables (removed 28) and now considering 846/876 (removed 30) transitions.
// Phase 1: matrix 846 rows 872 cols
[2025-05-30 18:58:15] [INFO ] Computed 76 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:58:15] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-05-30 18:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:58:16] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2025-05-30 18:58:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (OVERLAPS) 1/872 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 845 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:45] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:46] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 19 ms to minimize.
SMT process timed out in 30261ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30264ms
Starting structural reductions in LTL mode, iteration 1 : 872/900 places, 846/876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31545 ms. Remains : 872/900 places, 846/876 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-01
Product exploration explored 100000 steps with 183 reset in 331 ms.
Product exploration explored 100000 steps with 182 reset in 331 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (72 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443736 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 443736 steps, saw 100353 distinct states, run finished after 3006 ms. (steps per millisecond=147 ) properties seen :0
[2025-05-30 18:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 727/809 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/872 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 846/1718 variables, 872/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1718 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 948 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 81/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 727/809 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:51] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/872 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:51] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:51] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:51] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:52] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:52] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:52] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:52] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:52] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:53] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:53] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:53] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:53] [INFO ] Deduced a trap composed of 83 places in 192 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:54] [INFO ] Deduced a trap composed of 90 places in 176 ms of which 40 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/872 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/872 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 846/1718 variables, 872/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1718 variables, 1/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:54] [INFO ] Deduced a trap composed of 92 places in 188 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:58:54] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 37 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1718 variables, 2/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1718 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1718 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 965 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3851 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4277ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 778 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=129 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-01 finished in 40198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 884 transition count 860
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 884 transition count 860
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 884 transition count 858
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 879 transition count 853
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 879 transition count 853
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 876 transition count 850
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 874 transition count 848
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 874 transition count 848
Applied a total of 54 rules in 147 ms. Remains 874 /900 variables (removed 26) and now considering 848/876 (removed 28) transitions.
// Phase 1: matrix 848 rows 874 cols
[2025-05-30 18:58:55] [INFO ] Computed 76 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:58:55] [INFO ] Implicit Places using invariants in 392 ms returned []
[2025-05-30 18:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:58:56] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2025-05-30 18:58:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:59:26] [INFO ] Deduced a trap composed of 35 places in 308 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:59:26] [INFO ] Deduced a trap composed of 80 places in 318 ms of which 55 ms to minimize.
SMT process timed out in 30259ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30263ms
Starting structural reductions in LTL mode, iteration 1 : 874/900 places, 848/876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31550 ms. Remains : 874/900 places, 848/876 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-02 finished in 31880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 899 transition count 553
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 363 rules applied. Total rules applied 685 place count 577 transition count 512
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 709 place count 553 transition count 512
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 709 place count 553 transition count 408
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 917 place count 449 transition count 408
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 930 place count 436 transition count 395
Iterating global reduction 3 with 13 rules applied. Total rules applied 943 place count 436 transition count 395
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 943 place count 436 transition count 386
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 961 place count 427 transition count 386
Performed 165 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 1291 place count 262 transition count 200
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1292 place count 261 transition count 199
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 32 rules applied. Total rules applied 1324 place count 239 transition count 189
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1334 place count 229 transition count 189
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1334 place count 229 transition count 177
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1358 place count 217 transition count 177
Applied a total of 1358 rules in 81 ms. Remains 217 /900 variables (removed 683) and now considering 177/876 (removed 699) transitions.
// Phase 1: matrix 177 rows 217 cols
[2025-05-30 18:59:26] [INFO ] Computed 54 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:59:27] [INFO ] Implicit Places using invariants in 136 ms returned [89, 127, 165, 169, 174, 178, 182, 186, 190, 194, 199, 203, 207, 211, 216]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 138 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/900 places, 177/876 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 189 transition count 164
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 179 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 178 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 178 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 177 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 177 transition count 152
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 52 place count 176 transition count 151
Applied a total of 52 rules in 51 ms. Remains 176 /202 variables (removed 26) and now considering 151/177 (removed 26) transitions.
// Phase 1: matrix 151 rows 176 cols
[2025-05-30 18:59:27] [INFO ] Computed 39 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:59:27] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 18:59:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:59:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 18:59:27] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 176/900 places, 151/876 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 558 ms. Remains : 176/900 places, 151/876 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-04
Product exploration explored 100000 steps with 2242 reset in 247 ms.
Product exploration explored 100000 steps with 2239 reset in 338 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 : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 90 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 151/151 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2025-05-30 18:59:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:59:28] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 18:59:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:59:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 18:59:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:59:28] [INFO ] Redundant transitions in 5 ms returned []
Running 88 sub problems to find dead transitions.
[2025-05-30 18:59:28] [INFO ] Invariant cache hit.
[2025-05-30 18:59:28] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 2/176 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:59:29] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 151/327 variables, 176/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 217 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4695 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 176/176 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 2/176 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 151/327 variables, 176/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 88/305 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 305 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4492 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 176/176 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9197ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 9197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9502 ms. Remains : 176/176 places, 151/151 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 105 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2231 reset in 231 ms.
Product exploration explored 100000 steps with 2218 reset in 244 ms.
Built C files in :
/tmp/ltsmin433724624138047274
[2025-05-30 18:59:39] [INFO ] Computing symmetric may disable matrix : 151 transitions.
[2025-05-30 18:59:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:59:39] [INFO ] Computing symmetric may enable matrix : 151 transitions.
[2025-05-30 18:59:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:59:39] [INFO ] Computing Do-Not-Accords matrix : 151 transitions.
[2025-05-30 18:59:39] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 18:59:39] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin433724624138047274
Running compilation step : cd /tmp/ltsmin433724624138047274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin433724624138047274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin433724624138047274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6167157001054015747.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 151/151 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2025-05-30 18:59:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:59:54] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 18:59:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 18:59:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 18:59:54] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 18:59:54] [INFO ] Redundant transitions in 4 ms returned []
Running 88 sub problems to find dead transitions.
[2025-05-30 18:59:54] [INFO ] Invariant cache hit.
[2025-05-30 18:59:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 2/176 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 18:59:55] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 151/327 variables, 176/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 217 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4625 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 176/176 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 2/176 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 151/327 variables, 176/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 88/305 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 305 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 176/176 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9121ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 9122ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9442 ms. Remains : 176/176 places, 151/151 transitions.
Built C files in :
/tmp/ltsmin16868694633626721046
[2025-05-30 19:00:03] [INFO ] Computing symmetric may disable matrix : 151 transitions.
[2025-05-30 19:00:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:00:03] [INFO ] Computing symmetric may enable matrix : 151 transitions.
[2025-05-30 19:00:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:00:03] [INFO ] Computing Do-Not-Accords matrix : 151 transitions.
[2025-05-30 19:00:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:00:03] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16868694633626721046
Running compilation step : cd /tmp/ltsmin16868694633626721046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 291 ms.
Running link step : cd /tmp/ltsmin16868694633626721046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16868694633626721046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2476640216674467218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 19:00:18] [INFO ] Flatten gal took : 7 ms
[2025-05-30 19:00:18] [INFO ] Flatten gal took : 6 ms
[2025-05-30 19:00:18] [INFO ] Time to serialize gal into /tmp/LTL2020201593264394343.gal : 2 ms
[2025-05-30 19:00:18] [INFO ] Time to serialize properties into /tmp/LTL10224819009571671556.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2020201593264394343.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16379447898984066821.hoa' '-atoms' '/tmp/LTL10224819009571671556.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10224819009571671556.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16379447898984066821.hoa
Reverse transition relation is NOT exact ! Due to transitions t115.t191, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/to...172
Computing Next relation with stutter on 385024 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
879 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.831,292864,1,0,704,1.23564e+06,330,617,4832,2.41803e+06,1324
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-12b-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property AutoFlight-PT-12b-LTLFireability-04 finished in 63639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1||G(!p0)))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 884 transition count 860
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 884 transition count 860
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 884 transition count 858
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 879 transition count 853
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 879 transition count 853
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 876 transition count 850
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 874 transition count 848
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 874 transition count 848
Applied a total of 54 rules in 108 ms. Remains 874 /900 variables (removed 26) and now considering 848/876 (removed 28) transitions.
// Phase 1: matrix 848 rows 874 cols
[2025-05-30 19:00:30] [INFO ] Computed 76 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:00:31] [INFO ] Implicit Places using invariants in 393 ms returned []
[2025-05-30 19:00:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:00:31] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2025-05-30 19:00:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/1722 variables, and 76 constraints, problems are : Problem set: 0 solved, 847 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/874 constraints, PredecessorRefiner: 847/847 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:22] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:23] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:23] [INFO ] Deduced a trap composed of 80 places in 308 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:23] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:24] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:24] [INFO ] Deduced a trap composed of 81 places in 300 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:24] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:24] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:25] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:25] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:25] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:25] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:26] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:26] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:26] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:26] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:26] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:27] [INFO ] Deduced a trap composed of 48 places in 214 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:27] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:27] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/874 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:29] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:29] [INFO ] Deduced a trap composed of 85 places in 289 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:29] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:29] [INFO ] Deduced a trap composed of 87 places in 267 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:30] [INFO ] Deduced a trap composed of 87 places in 280 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:30] [INFO ] Deduced a trap composed of 87 places in 272 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:30] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:31] [INFO ] Deduced a trap composed of 123 places in 226 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:31] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:01:32] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 23 ms to minimize.
SMT process timed out in 60208ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 874/900 places, 848/876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61481 ms. Remains : 874/900 places, 848/876 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), true]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-05 finished in 61682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(F(p1))) U p2))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 899 transition count 553
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 360 rules applied. Total rules applied 682 place count 577 transition count 515
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 705 place count 555 transition count 514
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 708 place count 554 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 709 place count 553 transition count 512
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 103 Pre rules applied. Total rules applied 709 place count 553 transition count 409
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 5 with 206 rules applied. Total rules applied 915 place count 450 transition count 409
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 927 place count 438 transition count 397
Iterating global reduction 5 with 12 rules applied. Total rules applied 939 place count 438 transition count 397
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 939 place count 438 transition count 389
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 955 place count 430 transition count 389
Performed 166 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 5 with 332 rules applied. Total rules applied 1287 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1288 place count 263 transition count 201
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 5 with 31 rules applied. Total rules applied 1319 place count 241 transition count 192
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1328 place count 232 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1328 place count 232 transition count 180
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 1352 place count 220 transition count 180
Applied a total of 1352 rules in 76 ms. Remains 220 /900 variables (removed 680) and now considering 180/876 (removed 696) transitions.
// Phase 1: matrix 180 rows 220 cols
[2025-05-30 19:01:32] [INFO ] Computed 54 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:01:32] [INFO ] Implicit Places using invariants in 138 ms returned [90, 128, 166, 170, 175, 179, 183, 189, 193, 197, 202, 206, 210, 214, 219]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 139 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/900 places, 180/876 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 192 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 192 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 191 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 155
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 52 place count 179 transition count 154
Applied a total of 52 rules in 36 ms. Remains 179 /205 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 179 cols
[2025-05-30 19:01:32] [INFO ] Computed 39 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:01:32] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 19:01:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 19:01:32] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 179/900 places, 154/876 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 568 ms. Remains : 179/900 places, 154/876 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-07
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-07 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(X(p1)))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 885 transition count 861
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 885 transition count 861
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 885 transition count 859
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 879 transition count 853
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 879 transition count 853
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 876 transition count 850
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 876 transition count 850
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 874 transition count 848
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 874 transition count 848
Applied a total of 54 rules in 133 ms. Remains 874 /900 variables (removed 26) and now considering 848/876 (removed 28) transitions.
// Phase 1: matrix 848 rows 874 cols
[2025-05-30 19:01:33] [INFO ] Computed 76 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:01:33] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-05-30 19:01:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:01:34] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2025-05-30 19:01:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:04] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:04] [INFO ] Deduced a trap composed of 108 places in 177 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:04] [INFO ] Deduced a trap composed of 109 places in 162 ms of which 43 ms to minimize.
SMT process timed out in 30216ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Starting structural reductions in LTL mode, iteration 1 : 874/900 places, 848/876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31589 ms. Remains : 874/900 places, 848/876 transitions.
Stuttering acceptance computed with spot in 466 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-08
Stuttering criterion allowed to conclude after 542 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-08 finished in 32077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1)&&F(p2))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 885 transition count 861
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 885 transition count 861
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 885 transition count 860
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 880 transition count 855
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 880 transition count 855
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 877 transition count 852
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 877 transition count 852
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 875 transition count 850
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 875 transition count 850
Applied a total of 51 rules in 110 ms. Remains 875 /900 variables (removed 25) and now considering 850/876 (removed 26) transitions.
// Phase 1: matrix 850 rows 875 cols
[2025-05-30 19:02:05] [INFO ] Computed 76 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:02:05] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-05-30 19:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:02:06] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2025-05-30 19:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/875 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/875 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 875/1725 variables, and 76 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/875 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/875 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/875 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:56] [INFO ] Deduced a trap composed of 20 places in 281 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:56] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:57] [INFO ] Deduced a trap composed of 80 places in 300 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:57] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:57] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:58] [INFO ] Deduced a trap composed of 81 places in 290 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:58] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:58] [INFO ] Deduced a trap composed of 85 places in 286 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:59] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:59] [INFO ] Deduced a trap composed of 86 places in 275 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:59] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:02:59] [INFO ] Deduced a trap composed of 87 places in 275 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:00] [INFO ] Deduced a trap composed of 87 places in 271 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:00] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:00] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:01] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:01] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:01] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:01] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:02] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/875 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:03] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:03] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:04] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:04] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:04] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:04] [INFO ] Deduced a trap composed of 43 places in 226 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:05] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:05] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:05] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:05] [INFO ] Deduced a trap composed of 123 places in 232 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:06] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:06] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:06] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 15 ms to minimize.
SMT process timed out in 60202ms, After SMT, problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 875/900 places, 850/876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61460 ms. Remains : 875/900 places, 850/876 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-09
Product exploration explored 100000 steps with 387 reset in 319 ms.
Product exploration explored 100000 steps with 379 reset in 290 ms.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Detected a total of 212/875 stabilizing places and 212/850 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 262 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
RANDOM walk for 1771 steps (0 resets) in 11 ms. (147 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT p2))]
Knowledge based reduction with 17 factoid took 643 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
[2025-05-30 19:03:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:03:08] [INFO ] [Real]Absence check using 75 positive place invariants in 63 ms returned sat
[2025-05-30 19:03:08] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 48 ms returned sat
[2025-05-30 19:03:17] [INFO ] [Real]Absence check using state equation in 8804 ms returned sat
[2025-05-30 19:03:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:03:18] [INFO ] [Nat]Absence check using 75 positive place invariants in 109 ms returned sat
[2025-05-30 19:03:18] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 19 ms returned sat
[2025-05-30 19:03:20] [INFO ] [Nat]Absence check using state equation in 2356 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:03:20] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 26 ms to minimize.
[2025-05-30 19:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2025-05-30 19:03:20] [INFO ] Computed and/alt/rep : 847/1180/847 causal constraints (skipped 2 transitions) in 44 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-30 19:03:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 875 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 875/875 places, 850/850 transitions.
Applied a total of 0 rules in 21 ms. Remains 875 /875 variables (removed 0) and now considering 850/850 (removed 0) transitions.
[2025-05-30 19:03:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:03:33] [INFO ] Implicit Places using invariants in 396 ms returned []
[2025-05-30 19:03:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:03:33] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2025-05-30 19:03:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/875 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/875 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 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 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.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 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.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 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.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 1.0)
(s136 0.0)
(s137 0.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 1.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 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.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 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.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 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.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 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.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 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 875/1725 variables, and 76 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/875 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/875 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/875 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:24] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:24] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:25] [INFO ] Deduced a trap composed of 80 places in 312 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:25] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:25] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:26] [INFO ] Deduced a trap composed of 81 places in 301 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:26] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:26] [INFO ] Deduced a trap composed of 85 places in 305 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:27] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:27] [INFO ] Deduced a trap composed of 86 places in 281 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:27] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:28] [INFO ] Deduced a trap composed of 87 places in 285 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:28] [INFO ] Deduced a trap composed of 87 places in 286 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:28] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:28] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:29] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:29] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:29] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:29] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:30] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/875 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:31] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:32] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:32] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:32] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:32] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:33] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:33] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:33] [INFO ] Deduced a trap composed of 45 places in 228 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:33] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:34] [INFO ] Deduced a trap composed of 123 places in 233 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:34] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 15 ms to minimize.
SMT process timed out in 60262ms, After SMT, problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in LTL mode , in 1 iterations and 61437 ms. Remains : 875/875 places, 850/850 transitions.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Detected a total of 212/875 stabilizing places and 212/850 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X p0)), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 260 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
RANDOM walk for 4940 steps (6 resets) in 34 ms. (141 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X p0)), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT p2))]
Knowledge based reduction with 17 factoid took 677 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
[2025-05-30 19:04:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:04:35] [INFO ] [Real]Absence check using 75 positive place invariants in 60 ms returned sat
[2025-05-30 19:04:36] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 42 ms returned sat
[2025-05-30 19:04:44] [INFO ] [Real]Absence check using state equation in 8812 ms returned sat
[2025-05-30 19:04:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:04:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 108 ms returned sat
[2025-05-30 19:04:45] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 12 ms returned sat
[2025-05-30 19:04:47] [INFO ] [Nat]Absence check using state equation in 2319 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:04:47] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 26 ms to minimize.
[2025-05-30 19:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2025-05-30 19:04:47] [INFO ] Computed and/alt/rep : 847/1180/847 causal constraints (skipped 2 transitions) in 40 ms.
[2025-05-30 19:04:59] [INFO ] Added : 700 causal constraints over 140 iterations in 12047 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 383 reset in 220 ms.
Product exploration explored 100000 steps with 388 reset in 234 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 3 out of 875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 875/875 places, 850/850 transitions.
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 875 transition count 850
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 23 rules applied. Total rules applied 301 place count 875 transition count 838
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 301 place count 875 transition count 838
Deduced a syphon composed of 403 places in 2 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 415 place count 875 transition count 838
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 653 place count 637 transition count 600
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 891 place count 637 transition count 600
Performed 208 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 373 places in 0 ms
Iterating global reduction 2 with 208 rules applied. Total rules applied 1099 place count 637 transition count 577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1100 place count 637 transition count 576
Discarding 134 places :
Symmetric choice reduction at 3 with 134 rule applications. Total rules 1234 place count 503 transition count 442
Deduced a syphon composed of 239 places in 0 ms
Iterating global reduction 3 with 134 rules applied. Total rules applied 1368 place count 503 transition count 442
Deduced a syphon composed of 239 places in 0 ms
Applied a total of 1368 rules in 147 ms. Remains 503 /875 variables (removed 372) and now considering 442/850 (removed 408) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 19:05:00] [INFO ] Redundant transitions in 18 ms returned []
Running 441 sub problems to find dead transitions.
// Phase 1: matrix 442 rows 503 cols
[2025-05-30 19:05:00] [INFO ] Computed 76 invariants in 6 ms
[2025-05-30 19:05:01] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:14] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:14] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:14] [INFO ] Deduced a trap composed of 2 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:14] [INFO ] Deduced a trap composed of 2 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:14] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 7 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 5 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 5 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 2 places in 93 ms of which 5 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 5 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:15] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 4 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 5 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 5 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 5 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 5 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 87 ms of which 5 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 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
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/96 constraints. Problems are: Problem set: 82 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:16] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 5 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 5 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 5 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 5 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 5 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 5 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:17] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 5 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 5 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 4 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 5 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 5 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:18] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 5 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/116 constraints. Problems are: Problem set: 130 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:19] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:20] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 4 ms to minimize.
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:20] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:20] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:20] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 4 ms to minimize.
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:20] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:20] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD421 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/136 constraints. Problems are: Problem set: 185 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 3 ms to minimize.
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 2 ms to minimize.
Problem TDEAD122 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:23] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:24] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:24] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 9 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 18/154 constraints. Problems are: Problem set: 239 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:27] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/155 constraints. Problems are: Problem set: 239 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/945 variables, and 155 constraints, problems are : Problem set: 239 solved, 202 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/503 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 239 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 236/499 variables, 74/74 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 79/153 constraints. Problems are: Problem set: 239 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:05:33] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 1/154 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/499 variables, 0/154 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 4/503 variables, 2/156 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/156 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 442/945 variables, 503/659 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/945 variables, 86/745 constraints. Problems are: Problem set: 239 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/945 variables, 202/947 constraints. Problems are: Problem set: 239 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 945/945 variables, and 947 constraints, problems are : Problem set: 239 solved, 202 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 503/503 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 202/441 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 239 solved, 202 unsolved
Search for dead transitions found 239 dead transitions in 60121ms
Found 239 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 239 transitions
Dead transitions reduction (with SMT) removed 239 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 503/875 places, 203/850 transitions.
Graph (complete) has 683 edges and 503 vertex of which 264 are kept as prefixes of interest. Removing 239 places using SCC suffix rule.2 ms
Discarding 239 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 264 /503 variables (removed 239) and now considering 203/203 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 264/875 places, 203/850 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60317 ms. Remains : 264/875 places, 203/850 transitions.
Built C files in :
/tmp/ltsmin17728538880728746320
[2025-05-30 19:06:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17728538880728746320
Running compilation step : cd /tmp/ltsmin17728538880728746320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1362 ms.
Running link step : cd /tmp/ltsmin17728538880728746320;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17728538880728746320;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2508663047640016944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 875 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 875/875 places, 850/850 transitions.
Applied a total of 0 rules in 24 ms. Remains 875 /875 variables (removed 0) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 875 cols
[2025-05-30 19:06:16] [INFO ] Computed 76 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:06:16] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-05-30 19:06:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:06:17] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2025-05-30 19:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/875 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/875 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 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 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.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 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 875/1725 variables, and 76 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/875 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/874 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/875 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/875 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:09] [INFO ] Deduced a trap composed of 20 places in 321 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:09] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:09] [INFO ] Deduced a trap composed of 80 places in 302 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:09] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:10] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:10] [INFO ] Deduced a trap composed of 81 places in 327 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:10] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:11] [INFO ] Deduced a trap composed of 85 places in 299 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:11] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:11] [INFO ] Deduced a trap composed of 86 places in 288 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:12] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:12] [INFO ] Deduced a trap composed of 87 places in 299 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:12] [INFO ] Deduced a trap composed of 87 places in 293 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:13] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:13] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:13] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:13] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:14] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:14] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:14] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/875 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:16] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:16] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:16] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:16] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:17] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:17] [INFO ] Deduced a trap composed of 43 places in 251 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:07:17] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 34 ms to minimize.
SMT process timed out in 60340ms, After SMT, problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Finished structural reductions in LTL mode , in 1 iterations and 61504 ms. Remains : 875/875 places, 850/850 transitions.
Built C files in :
/tmp/ltsmin4355067993405995271
[2025-05-30 19:07:17] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4355067993405995271
Running compilation step : cd /tmp/ltsmin4355067993405995271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1393 ms.
Running link step : cd /tmp/ltsmin4355067993405995271;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4355067993405995271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7605955555173359306.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 19:07:32] [INFO ] Flatten gal took : 27 ms
[2025-05-30 19:07:33] [INFO ] Flatten gal took : 28 ms
[2025-05-30 19:07:33] [INFO ] Time to serialize gal into /tmp/LTL16534335762736661503.gal : 12 ms
[2025-05-30 19:07:33] [INFO ] Time to serialize properties into /tmp/LTL7189451160969541361.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16534335762736661503.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10740584134616778646.hoa' '-atoms' '/tmp/LTL7189451160969541361.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7189451160969541361.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10740584134616778646.hoa
Detected timeout of ITS tools.
[2025-05-30 19:07:48] [INFO ] Flatten gal took : 26 ms
[2025-05-30 19:07:48] [INFO ] Flatten gal took : 23 ms
[2025-05-30 19:07:48] [INFO ] Time to serialize gal into /tmp/LTL6548697413499395693.gal : 5 ms
[2025-05-30 19:07:48] [INFO ] Time to serialize properties into /tmp/LTL14835845211814508561.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6548697413499395693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14835845211814508561.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(p348==0)")&&(X("(p218==1)")))&&(F("(p547==0)")))))
Formula 0 simplified : G(!"(p348==0)" | X!"(p218==1)" | G!"(p547==0)")
Detected timeout of ITS tools.
[2025-05-30 19:08:03] [INFO ] Flatten gal took : 23 ms
[2025-05-30 19:08:03] [INFO ] Applying decomposition
[2025-05-30 19:08:03] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6741807412195338701.txt' '-o' '/tmp/graph6741807412195338701.bin' '-w' '/tmp/graph6741807412195338701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6741807412195338701.bin' '-l' '-1' '-v' '-w' '/tmp/graph6741807412195338701.weights' '-q' '0' '-e' '0.001'
[2025-05-30 19:08:03] [INFO ] Decomposing Gal with order
[2025-05-30 19:08:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 19:08:03] [INFO ] Removed a total of 165 redundant transitions.
[2025-05-30 19:08:03] [INFO ] Flatten gal took : 85 ms
[2025-05-30 19:08:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-05-30 19:08:03] [INFO ] Time to serialize gal into /tmp/LTL17339617486830918012.gal : 12 ms
[2025-05-30 19:08:03] [INFO ] Time to serialize properties into /tmp/LTL3273588299746220023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17339617486830918012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3273588299746220023.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((("(i9.u100.p348==0)")&&(X("(i3.u68.p218==1)")))&&(F("(i1.u150.p547==0)")))))
Formula 0 simplified : G(!"(i9.u100.p348==0)" | X!"(i3.u68.p218==1)" | G!"(i1.u150.p547==0)")
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-12b-LTLFireability-09 finished in 373693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 320 place count 899 transition count 555
Reduce places removed 320 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 360 rules applied. Total rules applied 680 place count 579 transition count 515
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 704 place count 555 transition count 515
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 704 place count 555 transition count 410
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 914 place count 450 transition count 410
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 925 place count 439 transition count 399
Iterating global reduction 3 with 11 rules applied. Total rules applied 936 place count 439 transition count 399
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 936 place count 439 transition count 392
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 950 place count 432 transition count 392
Performed 167 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 1284 place count 265 transition count 204
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1285 place count 264 transition count 203
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 34 rules applied. Total rules applied 1319 place count 241 transition count 192
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1330 place count 230 transition count 192
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1330 place count 230 transition count 180
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1354 place count 218 transition count 180
Applied a total of 1354 rules in 53 ms. Remains 218 /900 variables (removed 682) and now considering 180/876 (removed 696) transitions.
// Phase 1: matrix 180 rows 218 cols
[2025-05-30 19:08:18] [INFO ] Computed 53 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:08:18] [INFO ] Implicit Places using invariants in 177 ms returned [91, 129, 167, 171, 176, 180, 184, 188, 192, 196, 200, 204, 208, 212, 217]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 178 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/900 places, 180/876 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 190 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 190 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 155
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 52 place count 177 transition count 154
Applied a total of 52 rules in 30 ms. Remains 177 /203 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 177 cols
[2025-05-30 19:08:18] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:08:19] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 19:08:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:08:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 19:08:19] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/900 places, 154/876 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 542 ms. Remains : 177/900 places, 154/876 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-10
Stuttering criterion allowed to conclude after 4104 steps with 171 reset in 14 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-10 finished in 680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U G((p1&&X(G((p1||G(p2))))))) U X(X(p3))))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 886 transition count 862
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 886 transition count 862
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 886 transition count 860
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 882 transition count 856
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 882 transition count 856
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 881 transition count 855
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 881 transition count 855
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 880 transition count 854
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 880 transition count 854
Applied a total of 42 rules in 148 ms. Remains 880 /900 variables (removed 20) and now considering 854/876 (removed 22) transitions.
// Phase 1: matrix 854 rows 880 cols
[2025-05-30 19:08:19] [INFO ] Computed 76 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:08:19] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-05-30 19:08:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:08:20] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Running 853 sub problems to find dead transitions.
[2025-05-30 19:08:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 1 (OVERLAPS) 1/880 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 880/1734 variables, and 76 constraints, problems are : Problem set: 0 solved, 853 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/880 constraints, PredecessorRefiner: 853/853 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 853 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 1 (OVERLAPS) 1/880 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:11] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:12] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:12] [INFO ] Deduced a trap composed of 80 places in 302 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:12] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:13] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:13] [INFO ] Deduced a trap composed of 81 places in 294 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:13] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:13] [INFO ] Deduced a trap composed of 85 places in 297 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:14] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:14] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:14] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:14] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:15] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:15] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:15] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:15] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:16] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:16] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:16] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:16] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:18] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:18] [INFO ] Deduced a trap composed of 87 places in 295 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:18] [INFO ] Deduced a trap composed of 87 places in 285 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:19] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:19] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:19] [INFO ] Deduced a trap composed of 89 places in 288 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:20] [INFO ] Deduced a trap composed of 91 places in 289 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:20] [INFO ] Deduced a trap composed of 91 places in 278 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:20] [INFO ] Deduced a trap composed of 93 places in 264 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:21] [INFO ] Deduced a trap composed of 95 places in 276 ms of which 44 ms to minimize.
SMT process timed out in 60391ms, After SMT, problems are : Problem set: 0 solved, 853 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Starting structural reductions in LTL mode, iteration 1 : 880/900 places, 854/876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61677 ms. Remains : 880/900 places, 854/876 transitions.
Stuttering acceptance computed with spot in 1097 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-11
Product exploration explored 100000 steps with 182 reset in 206 ms.
Product exploration explored 100000 steps with 182 reset in 237 ms.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Detected a total of 215/880 stabilizing places and 215/854 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) p2), (X (X (OR p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 23 states, 73 edges and 4 AP (stutter sensitive) to 20 states, 63 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 931 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (71 resets) in 766 ms. (52 steps per ms) remains 19/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
[2025-05-30 19:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 264/268 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:24] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 549/817 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 63/880 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/880 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 854/1734 variables, 880/957 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:25] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:25] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:26] [INFO ] Deduced a trap composed of 72 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:26] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 21 ms to minimize.
Problem apf11 is UNSAT
Problem apf22 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/1734 variables, 4/961 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1734 variables, 0/961 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:28] [INFO ] Deduced a trap composed of 92 places in 204 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:28] [INFO ] Deduced a trap composed of 92 places in 205 ms of which 55 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1734 variables, 2/963 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 963 constraints, problems are : Problem set: 2 solved, 17 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 880/880 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 17 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 264/268 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 549/817 variables, 71/76 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 3/79 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 63/880 variables, 1/80 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/880 variables, 3/83 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:29] [INFO ] Deduced a trap composed of 91 places in 201 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:30] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:30] [INFO ] Deduced a trap composed of 103 places in 187 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:30] [INFO ] Deduced a trap composed of 105 places in 191 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:30] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:30] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:30] [INFO ] Deduced a trap composed of 140 places in 167 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:31] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:31] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:31] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:31] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:31] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:32] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:32] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:32] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:32] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:32] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:09:33] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 54 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/880 variables, 18/101 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/880 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 854/1734 variables, 880/981 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 998 constraints, problems are : Problem set: 2 solved, 17 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 880/880 constraints, PredecessorRefiner: 17/19 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10034ms problems are : Problem set: 2 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 880/880 places, 854/854 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 880 transition count 543
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 347 rules applied. Total rules applied 658 place count 569 transition count 507
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 683 place count 545 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 684 place count 544 transition count 506
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 684 place count 544 transition count 401
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 894 place count 439 transition count 401
Performed 172 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1238 place count 267 transition count 206
Renaming transitions due to excessive name length > 1024 char.
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 1239 place count 267 transition count 205
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1287 place count 267 transition count 157
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1335 place count 219 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1336 place count 218 transition count 156
Reduce places removed 57 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 5 with 148 rules applied. Total rules applied 1484 place count 161 transition count 65
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 6 with 91 rules applied. Total rules applied 1575 place count 70 transition count 65
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 1575 place count 70 transition count 46
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1613 place count 51 transition count 46
Applied a total of 1613 rules in 47 ms. Remains 51 /880 variables (removed 829) and now considering 46/854 (removed 808) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 51/880 places, 46/854 transitions.
RANDOM walk for 36677 steps (8 resets) in 151 ms. (241 steps per ms) remains 0/17 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) p2), (X (X (OR p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p2 (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 p0 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) p3))), (F (NOT p2)), (F p3), (F (NOT (AND (OR (NOT p1) (NOT p0)) (OR (NOT p2) (NOT p0))))), (F (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F (NOT p1)), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p3))), (F (NOT (AND p1 (NOT p3)))), (F (NOT (AND p1 p2 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 9 factoid took 1125 ms. Reduced automaton from 20 states, 63 edges and 4 AP (stutter sensitive) to 14 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 585 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 605 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1)]
[2025-05-30 19:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:09:37] [INFO ] [Real]Absence check using 75 positive place invariants in 110 ms returned sat
[2025-05-30 19:09:37] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 30 ms returned sat
[2025-05-30 19:09:44] [INFO ] [Real]Absence check using state equation in 7606 ms returned sat
[2025-05-30 19:09:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:09:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 100 ms returned sat
[2025-05-30 19:09:45] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 10 ms returned sat
[2025-05-30 19:09:47] [INFO ] [Nat]Absence check using state equation in 2594 ms returned sat
[2025-05-30 19:09:47] [INFO ] Computed and/alt/rep : 851/1183/851 causal constraints (skipped 2 transitions) in 41 ms.
Could not prove EG (NOT p3)
Support contains 3 out of 880 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 880/880 places, 854/854 transitions.
Applied a total of 0 rules in 40 ms. Remains 880 /880 variables (removed 0) and now considering 854/854 (removed 0) transitions.
[2025-05-30 19:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:10:00] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-05-30 19:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:10:00] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Running 853 sub problems to find dead transitions.
[2025-05-30 19:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 1 (OVERLAPS) 1/880 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 880/1734 variables, and 76 constraints, problems are : Problem set: 0 solved, 853 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/880 constraints, PredecessorRefiner: 853/853 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 853 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/879 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 1 (OVERLAPS) 1/880 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 853 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:51] [INFO ] Deduced a trap composed of 20 places in 302 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:51] [INFO ] Deduced a trap composed of 35 places in 320 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:51] [INFO ] Deduced a trap composed of 80 places in 304 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:52] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:52] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:52] [INFO ] Deduced a trap composed of 81 places in 296 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:53] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:53] [INFO ] Deduced a trap composed of 85 places in 295 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:53] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:53] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:54] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:54] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:54] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:54] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:54] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:55] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:55] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:55] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:55] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:56] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 853 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:57] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:57] [INFO ] Deduced a trap composed of 87 places in 290 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:58] [INFO ] Deduced a trap composed of 87 places in 289 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:58] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:58] [INFO ] Deduced a trap composed of 87 places in 279 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:59] [INFO ] Deduced a trap composed of 89 places in 290 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:59] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:10:59] [INFO ] Deduced a trap composed of 91 places in 282 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:00] [INFO ] Deduced a trap composed of 93 places in 267 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:00] [INFO ] Deduced a trap composed of 95 places in 258 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:00] [INFO ] Deduced a trap composed of 95 places in 271 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:00] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:01] [INFO ] Deduced a trap composed of 95 places in 230 ms of which 39 ms to minimize.
SMT process timed out in 60187ms, After SMT, problems are : Problem set: 0 solved, 853 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Finished structural reductions in LTL mode , in 1 iterations and 61404 ms. Remains : 880/880 places, 854/854 transitions.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Detected a total of 215/880 stabilizing places and 215/854 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 14 states, 30 edges and 3 AP (stutter sensitive) to 14 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 549 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (72 resets) in 198 ms. (201 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 8/8 properties
[2025-05-30 19:11:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:02] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 561/817 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 63/880 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/880 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 854/1734 variables, 880/957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:03] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:03] [INFO ] Deduced a trap composed of 72 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:03] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:03] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:03] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:03] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:04] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 21 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1734 variables, 7/964 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1734 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1734 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 964 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3011 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 880/880 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 561/817 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 63/880 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/880 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:05] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:05] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:05] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:05] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:05] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:06] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:06] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:06] [INFO ] Deduced a trap composed of 92 places in 215 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:06] [INFO ] Deduced a trap composed of 122 places in 174 ms of which 42 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/880 variables, 9/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/880 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 854/1734 variables, 880/973 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1734 variables, 8/981 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:07] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:08] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:11:08] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 33 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1734 variables, 3/984 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1734 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 984 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 880/880 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8031ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 880/880 places, 854/854 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 880 transition count 541
Reduce places removed 313 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 349 rules applied. Total rules applied 662 place count 567 transition count 505
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 687 place count 543 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 688 place count 542 transition count 504
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 688 place count 542 transition count 400
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 896 place count 438 transition count 400
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 897 place count 437 transition count 399
Iterating global reduction 4 with 1 rules applied. Total rules applied 898 place count 437 transition count 399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 898 place count 437 transition count 398
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 900 place count 436 transition count 398
Performed 171 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1242 place count 265 transition count 204
Renaming transitions due to excessive name length > 1024 char.
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 1243 place count 265 transition count 203
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1291 place count 265 transition count 155
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 1339 place count 217 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1340 place count 216 transition count 154
Reduce places removed 58 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 5 with 153 rules applied. Total rules applied 1493 place count 158 transition count 59
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 6 with 95 rules applied. Total rules applied 1588 place count 63 transition count 59
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 1588 place count 63 transition count 40
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 1626 place count 44 transition count 40
Applied a total of 1626 rules in 51 ms. Remains 44 /880 variables (removed 836) and now considering 40/854 (removed 814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 44/880 places, 40/854 transitions.
RANDOM walk for 33340 steps (7 resets) in 71 ms. (463 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (F (NOT (OR p0 p1 p3))), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR p0 p1))), (F p3), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p1 p3))), (F (NOT (AND (NOT p0) p1 (NOT p3))))]
Knowledge based reduction with 2 factoid took 524 ms. Reduced automaton from 14 states, 30 edges and 3 AP (stutter sensitive) to 14 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 553 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 611 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1)]
[2025-05-30 19:11:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:11:12] [INFO ] [Real]Absence check using 75 positive place invariants in 109 ms returned sat
[2025-05-30 19:11:12] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 33 ms returned sat
[2025-05-30 19:11:19] [INFO ] [Real]Absence check using state equation in 7802 ms returned sat
[2025-05-30 19:11:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 19:11:20] [INFO ] [Nat]Absence check using 75 positive place invariants in 96 ms returned sat
[2025-05-30 19:11:20] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 12 ms returned sat
[2025-05-30 19:11:22] [INFO ] [Nat]Absence check using state equation in 2446 ms returned sat
[2025-05-30 19:11:22] [INFO ] Computed and/alt/rep : 851/1183/851 causal constraints (skipped 2 transitions) in 40 ms.
[2025-05-30 19:11:35] [INFO ] Added : 680 causal constraints over 136 iterations in 12154 ms. Result :unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 624 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 38967 steps with 70 reset in 93 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-11 finished in 196439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 899 transition count 553
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 362 rules applied. Total rules applied 684 place count 577 transition count 513
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 708 place count 553 transition count 513
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 708 place count 553 transition count 409
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 916 place count 449 transition count 409
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 928 place count 437 transition count 397
Iterating global reduction 3 with 12 rules applied. Total rules applied 940 place count 437 transition count 397
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 940 place count 437 transition count 389
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 956 place count 429 transition count 389
Performed 166 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 1288 place count 263 transition count 202
Renaming transitions due to excessive name length > 1024 char.
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 1289 place count 263 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1290 place count 262 transition count 201
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 32 rules applied. Total rules applied 1322 place count 240 transition count 191
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1332 place count 230 transition count 191
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1332 place count 230 transition count 180
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1354 place count 219 transition count 180
Applied a total of 1354 rules in 53 ms. Remains 219 /900 variables (removed 681) and now considering 180/876 (removed 696) transitions.
// Phase 1: matrix 180 rows 219 cols
[2025-05-30 19:11:35] [INFO ] Computed 54 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:36] [INFO ] Implicit Places using invariants in 209 ms returned [90, 128, 166, 170, 175, 179, 183, 187, 191, 195, 199, 203, 209, 213, 218]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 210 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/900 places, 180/876 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 191 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 191 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 190 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 190 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 189 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 189 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 188 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 188 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 187 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 179 transition count 155
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 52 place count 178 transition count 154
Applied a total of 52 rules in 27 ms. Remains 178 /204 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 178 cols
[2025-05-30 19:11:36] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 19:11:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 19:11:36] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/900 places, 154/876 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 570 ms. Remains : 178/900 places, 154/876 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-12
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-12 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !p1)))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 899 transition count 554
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 361 rules applied. Total rules applied 682 place count 578 transition count 514
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 26 rules applied. Total rules applied 708 place count 554 transition count 512
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 711 place count 552 transition count 511
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 711 place count 552 transition count 409
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 915 place count 450 transition count 409
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 927 place count 438 transition count 397
Iterating global reduction 4 with 12 rules applied. Total rules applied 939 place count 438 transition count 397
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 939 place count 438 transition count 388
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 957 place count 429 transition count 388
Performed 165 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 1287 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1288 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 33 rules applied. Total rules applied 1321 place count 240 transition count 191
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1331 place count 230 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1331 place count 230 transition count 179
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1355 place count 218 transition count 179
Applied a total of 1355 rules in 46 ms. Remains 218 /900 variables (removed 682) and now considering 179/876 (removed 697) transitions.
// Phase 1: matrix 179 rows 218 cols
[2025-05-30 19:11:36] [INFO ] Computed 53 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:36] [INFO ] Implicit Places using invariants in 143 ms returned [88, 126, 164, 168, 173, 177, 181, 185, 189, 195, 200, 204, 208, 212, 217]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 143 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/900 places, 179/876 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 190 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 190 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 154
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 52 place count 177 transition count 153
Applied a total of 52 rules in 23 ms. Remains 177 /203 variables (removed 26) and now considering 153/179 (removed 26) transitions.
// Phase 1: matrix 153 rows 177 cols
[2025-05-30 19:11:36] [INFO ] Computed 38 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:36] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-30 19:11:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 19:11:36] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/900 places, 153/876 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 526 ms. Remains : 177/900 places, 153/876 transitions.
Stuttering acceptance computed with spot in 69 ms :[p1, true, p1]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-13
Product exploration explored 100000 steps with 2265 reset in 320 ms.
Product exploration explored 100000 steps with 2276 reset in 366 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[p1, true, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (905 resets) in 161 ms. (246 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (35 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
[2025-05-30 19:11:38] [INFO ] Invariant cache hit.
[2025-05-30 19:11:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 91/95 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/202 variables, 95/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 128/330 variables, 82/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 35/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 216 constraints, problems are : Problem set: 1 solved, 2 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 177/177 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/202 variables, 95/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 2/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 128/330 variables, 82/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 35/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 218 constraints, problems are : Problem set: 1 solved, 2 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 177/177 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 11 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-13 finished in 2286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 899 transition count 552
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 363 rules applied. Total rules applied 686 place count 576 transition count 512
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 710 place count 552 transition count 512
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 710 place count 552 transition count 408
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 918 place count 448 transition count 408
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 930 place count 436 transition count 396
Iterating global reduction 3 with 12 rules applied. Total rules applied 942 place count 436 transition count 396
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 942 place count 436 transition count 388
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 958 place count 428 transition count 388
Performed 166 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 3 with 332 rules applied. Total rules applied 1290 place count 262 transition count 201
Renaming transitions due to excessive name length > 1024 char.
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 1291 place count 262 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1292 place count 261 transition count 200
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 34 rules applied. Total rules applied 1326 place count 238 transition count 189
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1337 place count 227 transition count 189
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1337 place count 227 transition count 177
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1361 place count 215 transition count 177
Applied a total of 1361 rules in 56 ms. Remains 215 /900 variables (removed 685) and now considering 177/876 (removed 699) transitions.
// Phase 1: matrix 177 rows 215 cols
[2025-05-30 19:11:38] [INFO ] Computed 53 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:38] [INFO ] Implicit Places using invariants in 140 ms returned [88, 126, 164, 168, 173, 177, 181, 185, 189, 193, 197, 201, 205, 209, 214]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 142 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/900 places, 177/876 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 187 transition count 164
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 187 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 186 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 186 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 184 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 184 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 183 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 183 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 182 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 182 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 181 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 181 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 179 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 179 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 178 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 178 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 177 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 177 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 176 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 176 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 175 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 175 transition count 152
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 52 place count 174 transition count 151
Applied a total of 52 rules in 31 ms. Remains 174 /200 variables (removed 26) and now considering 151/177 (removed 26) transitions.
// Phase 1: matrix 151 rows 174 cols
[2025-05-30 19:11:38] [INFO ] Computed 38 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:39] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-30 19:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 19:11:39] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 174/900 places, 151/876 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 526 ms. Remains : 174/900 places, 151/876 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-14
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-14 finished in 578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 884 transition count 860
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 884 transition count 860
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 884 transition count 858
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 878 transition count 852
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 878 transition count 852
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 875 transition count 849
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 875 transition count 849
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 873 transition count 847
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 873 transition count 847
Applied a total of 56 rules in 138 ms. Remains 873 /900 variables (removed 27) and now considering 847/876 (removed 29) transitions.
// Phase 1: matrix 847 rows 873 cols
[2025-05-30 19:11:39] [INFO ] Computed 76 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:39] [INFO ] Implicit Places using invariants in 364 ms returned []
[2025-05-30 19:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:11:40] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2025-05-30 19:11:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:09] [INFO ] Deduced a trap composed of 35 places in 285 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:09] [INFO ] Deduced a trap composed of 80 places in 314 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:10] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:10] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:10] [INFO ] Deduced a trap composed of 81 places in 307 ms of which 50 ms to minimize.
SMT process timed out in 30297ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30298ms
Starting structural reductions in LTL mode, iteration 1 : 873/900 places, 847/876 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31559 ms. Remains : 873/900 places, 847/876 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-15
Product exploration explored 100000 steps with 793 reset in 228 ms.
Product exploration explored 100000 steps with 733 reset in 345 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Detected a total of 211/873 stabilizing places and 211/847 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 178 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (71 resets) in 163 ms. (243 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2025-05-30 19:12:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 245/247 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:12] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:12] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 563/810 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:12] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/873 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:12] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:12] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:12] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:13] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:13] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:13] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:13] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 847/1720 variables, 873/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1720 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 959 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 245/247 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 563/810 variables, 72/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:12:14] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/873 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 847/1720 variables, 873/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 1/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1720 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1720 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 961 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2817ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 290 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=96 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 422 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 872 transition count 536
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 346 rules applied. Total rules applied 656 place count 562 transition count 500
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 681 place count 538 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 682 place count 537 transition count 499
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 682 place count 537 transition count 395
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 890 place count 433 transition count 395
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1230 place count 263 transition count 201
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1231 place count 262 transition count 200
Reduce places removed 24 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 36 rules applied. Total rules applied 1267 place count 238 transition count 188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1279 place count 226 transition count 188
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1279 place count 226 transition count 176
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1303 place count 214 transition count 176
Applied a total of 1303 rules in 36 ms. Remains 214 /873 variables (removed 659) and now considering 176/847 (removed 671) transitions.
// Phase 1: matrix 176 rows 214 cols
[2025-05-30 19:12:15] [INFO ] Computed 52 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:15] [INFO ] Implicit Places using invariants in 131 ms returned [86, 124, 162, 166, 170, 174, 178, 182, 186, 196, 200, 204, 208, 213]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 132 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/873 places, 176/847 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 188 transition count 164
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 188 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 187 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 179 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 178 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 178 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 177 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 177 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 176 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 176 transition count 152
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 52 place count 174 transition count 150
Applied a total of 52 rules in 26 ms. Remains 174 /200 variables (removed 26) and now considering 150/176 (removed 26) transitions.
// Phase 1: matrix 150 rows 174 cols
[2025-05-30 19:12:15] [INFO ] Computed 38 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:15] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 19:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 19:12:16] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 174/873 places, 150/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 620 ms. Remains : 174/873 places, 150/847 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/174 stabilizing places and 4/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 650 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 161 steps (2 resets) in 5 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 795 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 3797 reset in 247 ms.
Product exploration explored 100000 steps with 3809 reset in 256 ms.
Built C files in :
/tmp/ltsmin14753259787240539059
[2025-05-30 19:12:18] [INFO ] Computing symmetric may disable matrix : 150 transitions.
[2025-05-30 19:12:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:12:18] [INFO ] Computing symmetric may enable matrix : 150 transitions.
[2025-05-30 19:12:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:12:18] [INFO ] Computing Do-Not-Accords matrix : 150 transitions.
[2025-05-30 19:12:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:12:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14753259787240539059
Running compilation step : cd /tmp/ltsmin14753259787240539059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 296 ms.
Running link step : cd /tmp/ltsmin14753259787240539059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14753259787240539059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17322900436870290109.hoa' '--buchi-type=spotba'
LTSmin run took 2090 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 41793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1)&&F(p2))))'
Found a Shortening insensitive property : AutoFlight-PT-12b-LTLFireability-09
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 900/900 places, 876/876 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 899 transition count 553
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 362 rules applied. Total rules applied 684 place count 577 transition count 513
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 709 place count 553 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 710 place count 552 transition count 512
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 710 place count 552 transition count 409
Deduced a syphon composed of 103 places in 1 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 916 place count 449 transition count 409
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 928 place count 437 transition count 397
Iterating global reduction 4 with 12 rules applied. Total rules applied 940 place count 437 transition count 397
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 940 place count 437 transition count 389
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 956 place count 429 transition count 389
Performed 165 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 4 with 330 rules applied. Total rules applied 1286 place count 264 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1287 place count 263 transition count 202
Reduce places removed 21 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 31 rules applied. Total rules applied 1318 place count 242 transition count 192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1328 place count 232 transition count 192
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1328 place count 232 transition count 181
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1350 place count 221 transition count 181
Applied a total of 1350 rules in 54 ms. Remains 221 /900 variables (removed 679) and now considering 181/876 (removed 695) transitions.
// Phase 1: matrix 181 rows 221 cols
[2025-05-30 19:12:21] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:21] [INFO ] Implicit Places using invariants in 146 ms returned [92, 130, 168, 174, 179, 183, 187, 191, 195, 199, 203, 207, 211, 215, 220]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 147 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 206/900 places, 181/876 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 193 transition count 168
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 193 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 192 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 192 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 191 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 181 transition count 156
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 52 place count 180 transition count 155
Applied a total of 52 rules in 31 ms. Remains 180 /206 variables (removed 26) and now considering 155/181 (removed 26) transitions.
// Phase 1: matrix 155 rows 180 cols
[2025-05-30 19:12:21] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:21] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-30 19:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:21] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 19:12:22] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 635 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 179/900 places, 155/876 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 179 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 178 transition count 154
Applied a total of 2 rules in 11 ms. Remains 178 /179 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 178 cols
[2025-05-30 19:12:22] [INFO ] Computed 39 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:22] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-30 19:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:12:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 19:12:22] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 178/900 places, 154/876 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 1564 ms. Remains : 178/900 places, 154/876 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-09
Stuttering criterion allowed to conclude after 14345 steps with 634 reset in 40 ms.
Treatment of property AutoFlight-PT-12b-LTLFireability-09 finished in 1883 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-05-30 19:12:22] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16172551058622196115
[2025-05-30 19:12:22] [INFO ] Computing symmetric may disable matrix : 876 transitions.
[2025-05-30 19:12:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:12:22] [INFO ] Computing symmetric may enable matrix : 876 transitions.
[2025-05-30 19:12:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:12:22] [INFO ] Applying decomposition
[2025-05-30 19:12:23] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17316564791137772278.txt' '-o' '/tmp/graph17316564791137772278.bin' '-w' '/tmp/graph17316564791137772278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17316564791137772278.bin' '-l' '-1' '-v' '-w' '/tmp/graph17316564791137772278.weights' '-q' '0' '-e' '0.001'
[2025-05-30 19:12:23] [INFO ] Decomposing Gal with order
[2025-05-30 19:12:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 19:12:23] [INFO ] Removed a total of 160 redundant transitions.
[2025-05-30 19:12:23] [INFO ] Computing Do-Not-Accords matrix : 876 transitions.
[2025-05-30 19:12:23] [INFO ] Flatten gal took : 44 ms
[2025-05-30 19:12:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2025-05-30 19:12:23] [INFO ] Time to serialize gal into /tmp/LTLFireability6445058420543504419.gal : 8 ms
[2025-05-30 19:12:23] [INFO ] Time to serialize properties into /tmp/LTLFireability7829988717336256746.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6445058420543504419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7829988717336256746.ltl' '-c' '-stutter-deadlock'
[2025-05-30 19:12:23] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
[2025-05-30 19:12:23] [INFO ] Built C files in 206ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16172551058622196115
Running compilation step : cd /tmp/ltsmin16172551058622196115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F((("(i8.u106.p348==0)")&&(X("(i5.u69.p218==1)")))&&(F("(i14.i1.i0.u159.p547==0)")))))
Formula 0 simplified : G(!"(i8.u106.p348==0)" | X!"(i5.u69.p218==1)" | G!"(i14.i1.i0.u159.p547==0)")
Compilation finished in 2319 ms.
Running link step : cd /tmp/ltsmin16172551058622196115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16172551058622196115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&X((LTLAPp1==true))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 1508 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 891974 ms.

BK_STOP 1748632347146

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-12b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729500548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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