Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729400508.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-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729400508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.5K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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.6K 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 36K 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-05a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748625573659

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-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 17:19:34] [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 17:19:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:19:35] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2025-05-30 17:19:35] [INFO ] Transformed 132 places.
[2025-05-30 17:19:35] [INFO ] Transformed 130 transitions.
[2025-05-30 17:19:35] [INFO ] Found NUPN structural information;
[2025-05-30 17:19:35] [INFO ] Parsed PT model containing 132 places and 130 transitions and 420 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA AutoFlight-PT-05a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2025-05-30 17:19:35] [INFO ] Computed 34 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:35] [INFO ] Implicit Places using invariants in 419 ms returned [28, 38, 41, 44, 47, 50, 77, 111, 117, 123]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 458 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/132 places, 105/105 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 102
Applied a total of 6 rules in 12 ms. Remains 119 /122 variables (removed 3) and now considering 102/105 (removed 3) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:19:35] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-30 17:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-05-30 17:19:35] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/132 places, 102/105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 703 ms. Remains : 119/132 places, 102/105 transitions.
Support contains 41 out of 119 places after structural reductions.
[2025-05-30 17:19:36] [INFO ] Flatten gal took : 31 ms
[2025-05-30 17:19:36] [INFO ] Flatten gal took : 12 ms
[2025-05-30 17:19:36] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 40000 steps (1199 resets) in 1513 ms. (26 steps per ms) remains 3/31 properties
BEST_FIRST walk for 40002 steps (167 resets) in 191 ms. (208 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (176 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (166 resets) in 120 ms. (330 steps per ms) remains 1/2 properties
[2025-05-30 17:19:36] [INFO ] Invariant cache hit.
[2025-05-30 17:19:36] [INFO ] State equation strengthened by 16 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, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 75/221 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 3/24 constraints, State Equation: 0/119 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AutoFlight-PT-05a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 1 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(X((p0&&F(p1)))))'
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-30 17:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:40] [INFO ] Implicit Places using invariants in 89 ms returned [7, 14, 21, 34, 92, 98, 116, 118]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 91 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/119 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 108 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 103 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 102 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 102 transition count 93
Applied a total of 18 rules in 28 ms. Remains 102 /111 variables (removed 9) and now considering 93/102 (removed 9) transitions.
// Phase 1: matrix 93 rows 102 cols
[2025-05-30 17:19:40] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-30 17:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:40] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/119 places, 93/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 250 ms. Remains : 102/119 places, 93/102 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-00 finished in 1860 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||F(G(p1))))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:19:40] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:40] [INFO ] Implicit Places using invariants in 79 ms returned [7, 14, 21, 92, 98, 116, 118]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 80 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 104 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 103 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 103 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 102 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 102 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 101 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 100 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 99 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 98 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 97 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 96 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 95 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 95 transition count 85
Applied a total of 34 rules in 25 ms. Remains 95 /112 variables (removed 17) and now considering 85/102 (removed 17) transitions.
// Phase 1: matrix 85 rows 95 cols
[2025-05-30 17:19:40] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 17:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 17:19:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/119 places, 85/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 277 ms. Remains : 95/119 places, 85/102 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-01
Product exploration explored 100000 steps with 3066 reset in 284 ms.
Stack based approach found an accepted trace after 236 steps with 5 reset with depth 51 and stack size 51 in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-01 finished in 705 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(F((F(p0)&&X((X((G(!p1)||(!p1&&F(!p2)))) U (X(G((G(!p1)||(!p1&&F(!p2)))))||(p3&&X((G(!p1)||(!p1&&F(!p2))))))))))))'
Support contains 7 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:19:41] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:41] [INFO ] Implicit Places using invariants in 197 ms returned [14, 21, 92, 98, 116, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 198 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/119 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 90
Applied a total of 24 rules in 27 ms. Remains 101 /113 variables (removed 12) and now considering 90/102 (removed 12) transitions.
// Phase 1: matrix 90 rows 101 cols
[2025-05-30 17:19:41] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-30 17:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 17:19:41] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/119 places, 90/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 101/119 places, 90/102 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), p1, p1, (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-04
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-04 finished in 920 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 (F(p1)||X(X(X(p2)))))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:19:42] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:42] [INFO ] Implicit Places using invariants in 102 ms returned [14, 21, 34, 92, 98, 116, 118]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 105 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 104 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 103 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 103 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 102 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 102 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 101 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 100 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 99 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 99 transition count 89
Applied a total of 26 rules in 44 ms. Remains 99 /112 variables (removed 13) and now considering 89/102 (removed 13) transitions.
// Phase 1: matrix 89 rows 99 cols
[2025-05-30 17:19:42] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-30 17:19:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 17:19:42] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/119 places, 89/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 99/119 places, 89/102 transitions.
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-06
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-06 finished in 763 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||G(p1)))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 119 transition count 89
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 106 transition count 89
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 106 transition count 75
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 92 transition count 75
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 74 place count 82 transition count 65
Applied a total of 74 rules in 24 ms. Remains 82 /119 variables (removed 37) and now considering 65/102 (removed 37) transitions.
// Phase 1: matrix 65 rows 82 cols
[2025-05-30 17:19:43] [INFO ] Computed 24 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:43] [INFO ] Implicit Places using invariants in 65 ms returned [5, 10, 15, 24, 25, 26, 31, 60, 65, 79, 81]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 66 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/119 places, 65/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 71 transition count 47
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 53 transition count 47
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 50 transition count 44
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 50 transition count 44
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 2 with 4 rules applied. Total rules applied 46 place count 48 transition count 42
Applied a total of 46 rules in 5 ms. Remains 48 /71 variables (removed 23) and now considering 42/65 (removed 23) transitions.
// Phase 1: matrix 42 rows 48 cols
[2025-05-30 17:19:43] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-30 17:19:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:19:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/119 places, 42/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 48/119 places, 42/102 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-07
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-07 finished in 259 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((G(p0)||X(((p2 U (p3||G(p2)))||p1))))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:19:43] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:43] [INFO ] Implicit Places using invariants in 75 ms returned [7, 14, 21, 34, 92, 98, 118]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 83 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 102/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 108 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 108 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 107 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 106 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 106 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 105 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 105 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 104 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 104 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 103 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 103 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 102 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 102 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 101 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 101 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 100 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 99 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 99 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 98 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 98 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 97 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 96 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 95 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 95 transition count 85
Applied a total of 34 rules in 26 ms. Remains 95 /112 variables (removed 17) and now considering 85/102 (removed 17) transitions.
// Phase 1: matrix 85 rows 95 cols
[2025-05-30 17:19:43] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 17:19:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:43] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 95/119 places, 85/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 95/119 places, 85/102 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 239 ms.
Product exploration explored 100000 steps with 25000 reset in 195 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 3869 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[true, (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1250 resets) in 207 ms. (192 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40002 steps (171 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (138 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (128 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (187 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
[2025-05-30 17:19:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 56/61 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 34/95 variables, 13/17 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 85/180 variables, 95/112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 112 constraints, problems are : Problem set: 2 solved, 2 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Int declared 61/180 variables, and 4 constraints, problems are : Problem set: 4 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 4/17 constraints, State Equation: 0/95 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), (G (OR p0 p1 p2 p3)), (G (OR p0 p1 (NOT p2) p3)), (G (OR p0 (NOT p2) p3)), (G (OR p0 p2 p3))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p1 p2 p3))), (F (NOT p1)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p0)), (F (NOT (AND (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR (NOT p2) p3))), (F p3), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3)))]
Knowledge based reduction with 5 factoid took 477 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 326 ms :[true, (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2025-05-30 17:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 17:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:50] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-05-30 17:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/180 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 112 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2454 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 85/180 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 84/196 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:53] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 197 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3233 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5702ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 5703ms
Finished structural reductions in LTL mode , in 1 iterations and 5821 ms. Remains : 95/95 places, 85/85 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
RANDOM walk for 13294 steps (410 resets) in 78 ms. (168 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p1 (NOT p2) p3))), (F p2), (F p3), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 273 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[true, (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 315 ms :[true, (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 301 ms :[true, (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Applying partial POR strategy [true, false, true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 325 ms :[true, (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))]
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 85/85 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 95 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 23 place count 95 transition count 85
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 95 transition count 85
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 44 place count 79 transition count 69
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 60 place count 79 transition count 69
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 79 transition count 69
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 76 transition count 66
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 76 transition count 66
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 76 rules in 19 ms. Remains 76 /95 variables (removed 19) and now considering 66/85 (removed 19) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:19:58] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
// Phase 1: matrix 66 rows 76 cols
[2025-05-30 17:19:58] [INFO ] Computed 17 invariants in 0 ms
[2025-05-30 17:19:58] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/76 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:58] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:59] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:59] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:59] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:59] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:19:59] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 15/32 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 66/142 variables, 76/108 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 13/121 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/121 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/121 constraints. Problems are: Problem set: 19 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 121 constraints, problems are : Problem set: 19 solved, 46 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 76/76 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 20/76 variables, 17/17 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 15/32 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 66/142 variables, 76/108 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 13/121 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 46/167 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/167 constraints. Problems are: Problem set: 19 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/167 constraints. Problems are: Problem set: 19 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 167 constraints, problems are : Problem set: 19 solved, 46 unsolved in 1535 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 76/76 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 46/65 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3192ms problems are : Problem set: 19 solved, 46 unsolved
Search for dead transitions found 19 dead transitions in 3194ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 76/95 places, 47/85 transitions.
Graph (complete) has 140 edges and 76 vertex of which 57 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 57 /76 variables (removed 19) and now considering 47/47 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/95 places, 47/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3226 ms. Remains : 57/95 places, 47/85 transitions.
Built C files in :
/tmp/ltsmin6295037769865656955
[2025-05-30 17:20:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6295037769865656955
Running compilation step : cd /tmp/ltsmin6295037769865656955;'/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 263 ms.
Running link step : cd /tmp/ltsmin6295037769865656955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6295037769865656955;'/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/stateBased13659550447012906559.hoa' '--buchi-type=spotba'
LTSmin run took 219 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLFireability-09 finished in 19189 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(p1)&&(!p2||F(G(!p3)))) U (G((F(p1)&&(!p2||F(G(!p3)))))||(!p2&&F(p1))))||p0))))'
Support contains 7 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:20:02] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:02] [INFO ] Implicit Places using invariants in 62 ms returned [7, 14, 92, 98, 116, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 63 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/119 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 100 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 99 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 99 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 98 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 98 transition count 87
Applied a total of 30 rules in 13 ms. Remains 98 /113 variables (removed 15) and now considering 87/102 (removed 15) transitions.
// Phase 1: matrix 87 rows 98 cols
[2025-05-30 17:20:02] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 17:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 17:20:02] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/119 places, 87/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 98/119 places, 87/102 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (NOT p1), p3, (AND p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-10
Product exploration explored 100000 steps with 3046 reset in 133 ms.
Product exploration explored 100000 steps with 3041 reset in 150 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 85 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (NOT p1), p3, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (1256 resets) in 211 ms. (188 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (166 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (165 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2025-05-30 17:20:03] [INFO ] Invariant cache hit.
[2025-05-30 17:20:03] [INFO ] State equation strengthened by 6 read => feed constraints.
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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/63 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/98 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/185 variables, 98/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 6/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 122 constraints, problems are : Problem set: 1 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 98/98 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 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: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/98 variables, 15/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/185 variables, 98/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 6/122 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 123 constraints, problems are : Problem set: 1 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 98/98 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F p3), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 283 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 87/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 98 transition count 71
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 82 transition count 71
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 82 transition count 63
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 74 transition count 63
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 70 place count 63 transition count 52
Applied a total of 70 rules in 9 ms. Remains 63 /98 variables (removed 35) and now considering 52/87 (removed 35) transitions.
// Phase 1: matrix 52 rows 63 cols
[2025-05-30 17:20:04] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:04] [INFO ] Implicit Places using invariants in 42 ms returned [25, 26, 27, 28, 29]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 43 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/98 places, 52/87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 58 transition count 47
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 53 transition count 47
Applied a total of 10 rules in 2 ms. Remains 53 /58 variables (removed 5) and now considering 47/52 (removed 5) transitions.
// Phase 1: matrix 47 rows 53 cols
[2025-05-30 17:20:04] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 17:20:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-05-30 17:20:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/98 places, 47/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 53/98 places, 47/87 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (1944 resets) in 90 ms. (439 steps per ms) remains 1/3 properties
BEST_FIRST walk for 20704 steps (162 resets) in 13 ms. (1478 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4833 reset in 100 ms.
Product exploration explored 100000 steps with 4894 reset in 108 ms.
Built C files in :
/tmp/ltsmin14064856381881397493
[2025-05-30 17:20:05] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2025-05-30 17:20:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:20:05] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2025-05-30 17:20:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:20:05] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2025-05-30 17:20:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:20:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14064856381881397493
Running compilation step : cd /tmp/ltsmin14064856381881397493;'/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 128 ms.
Running link step : cd /tmp/ltsmin14064856381881397493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14064856381881397493;'/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/stateBased4103582475245439755.hoa' '--buchi-type=spotba'
LTSmin run took 309 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLFireability-10 finished in 3219 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((p0&&X(p1)&&F(p2)))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:20:05] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:05] [INFO ] Implicit Places using invariants in 78 ms returned [7, 14, 21, 34, 92, 98, 116, 118]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 79 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/119 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 108 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 108 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 107 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 107 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 106 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 106 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 105 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 105 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 104 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 104 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 103 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 103 transition count 94
Applied a total of 16 rules in 5 ms. Remains 103 /111 variables (removed 8) and now considering 94/102 (removed 8) transitions.
// Phase 1: matrix 94 rows 103 cols
[2025-05-30 17:20:05] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:05] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 17:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/119 places, 94/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 204 ms. Remains : 103/119 places, 94/102 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (AND p0 (NOT p1)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-11 finished in 430 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)||G(p1))))'
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 119 transition count 89
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 106 transition count 89
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 26 place count 106 transition count 73
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 90 transition count 73
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 82 transition count 65
Applied a total of 74 rules in 12 ms. Remains 82 /119 variables (removed 37) and now considering 65/102 (removed 37) transitions.
// Phase 1: matrix 65 rows 82 cols
[2025-05-30 17:20:06] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:06] [INFO ] Implicit Places using invariants in 69 ms returned [5, 11, 16, 26, 27, 28, 29, 30, 31, 60, 65, 79, 81]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 73 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/119 places, 65/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 69 transition count 45
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 49 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 46 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 46 transition count 42
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 2 with 4 rules applied. Total rules applied 50 place count 44 transition count 40
Applied a total of 50 rules in 4 ms. Remains 44 /69 variables (removed 25) and now considering 40/65 (removed 25) transitions.
// Phase 1: matrix 40 rows 44 cols
[2025-05-30 17:20:06] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 17:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 17:20:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/119 places, 40/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 44/119 places, 40/102 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-13
Product exploration explored 100000 steps with 5384 reset in 153 ms.
Stack based approach found an accepted trace after 23718 steps with 1270 reset with depth 9 and stack size 9 in 39 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-13 finished in 416 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 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 119 transition count 89
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 106 transition count 89
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 26 place count 106 transition count 73
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 90 transition count 73
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 78 place count 80 transition count 63
Applied a total of 78 rules in 12 ms. Remains 80 /119 variables (removed 39) and now considering 63/102 (removed 39) transitions.
// Phase 1: matrix 63 rows 80 cols
[2025-05-30 17:20:06] [INFO ] Computed 24 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:06] [INFO ] Implicit Places using invariants in 71 ms returned [5, 10, 15, 24, 25, 26, 27, 28, 29, 58, 77, 79]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 72 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/119 places, 63/102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 68 transition count 49
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 54 transition count 44
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 49 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 49 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 48 transition count 43
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 46 transition count 41
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 46 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 45 transition count 40
Applied a total of 46 rules in 6 ms. Remains 45 /68 variables (removed 23) and now considering 40/63 (removed 23) transitions.
// Phase 1: matrix 40 rows 45 cols
[2025-05-30 17:20:06] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 17:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-30 17:20:06] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/119 places, 40/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 45/119 places, 40/102 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-14
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLFireability-14 finished in 327 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((G(F(!p0)) U p1))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 119 cols
[2025-05-30 17:20:06] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:06] [INFO ] Implicit Places using invariants in 89 ms returned [7, 21, 34, 98, 116, 118]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 90 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/119 places, 102/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 100
Applied a total of 4 rules in 1 ms. Remains 111 /113 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 111 cols
[2025-05-30 17:20:06] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 17:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 17:20:07] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/119 places, 100/102 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 111/119 places, 100/102 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Running random walk in product with property : AutoFlight-PT-05a-LTLFireability-15
Product exploration explored 100000 steps with 8772 reset in 202 ms.
Product exploration explored 100000 steps with 8767 reset in 160 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 (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
RANDOM walk for 463 steps (15 resets) in 7 ms. (57 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
[2025-05-30 17:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 17:20:08] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2025-05-30 17:20:08] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-05-30 17:20:08] [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 17:20:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2025-05-30 17:20:08] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-30 17:20:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 17:20:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-05-30 17:20:08] [INFO ] Computed and/alt/rep : 99/194/99 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-30 17:20:09] [INFO ] Added : 73 causal constraints over 17 iterations in 218 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-05-30 17:20:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:09] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-30 17:20:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:20:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 17:20:09] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2025-05-30 17:20:09] [INFO ] Invariant cache hit.
[2025-05-30 17:20:09] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/211 variables, 111/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 133 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3202 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/211 variables, 111/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 99/232 constraints. Problems are: Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:13] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:13] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:14] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:14] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:14] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:14] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:14] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 239 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4812 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 111/111 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8023ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8023ms
Finished structural reductions in LTL mode , in 1 iterations and 8152 ms. Remains : 111/111 places, 100/100 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 : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
RANDOM walk for 321 steps (7 resets) in 10 ms. (29 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
[2025-05-30 17:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 17:20:18] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2025-05-30 17:20:18] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-30 17:20:18] [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 17:20:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2025-05-30 17:20:18] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-05-30 17:20:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 17:20:18] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-05-30 17:20:18] [INFO ] Computed and/alt/rep : 99/194/99 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-30 17:20:18] [INFO ] Added : 73 causal constraints over 17 iterations in 194 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Product exploration explored 100000 steps with 8801 reset in 126 ms.
Product exploration explored 100000 steps with 8837 reset in 125 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), p0, p0]
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 100/100 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 111 transition count 100
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 29 place count 111 transition count 100
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 39 place count 111 transition count 100
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 63 place count 87 transition count 76
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 87 place count 87 transition count 76
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 98 place count 87 transition count 76
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 98 rules in 9 ms. Remains 87 /111 variables (removed 24) and now considering 76/100 (removed 24) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:20:19] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
// Phase 1: matrix 76 rows 87 cols
[2025-05-30 17:20:19] [INFO ] Computed 18 invariants in 1 ms
[2025-05-30 17:20:19] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:20:20] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 16/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 76/163 variables, 87/121 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 22/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 143 constraints, problems are : Problem set: 26 solved, 49 unsolved in 1892 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 87/87 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 27/87 variables, 18/18 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 16/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/34 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 76/163 variables, 87/121 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 22/143 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 49/192 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/192 constraints. Problems are: Problem set: 26 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/192 constraints. Problems are: Problem set: 26 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 192 constraints, problems are : Problem set: 26 solved, 49 unsolved in 2013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 87/87 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 49/75 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3914ms problems are : Problem set: 26 solved, 49 unsolved
Search for dead transitions found 26 dead transitions in 3914ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/111 places, 50/100 transitions.
Graph (complete) has 153 edges and 87 vertex of which 61 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 61 /87 variables (removed 26) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/111 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3936 ms. Remains : 61/111 places, 50/100 transitions.
Built C files in :
/tmp/ltsmin7802177803240356292
[2025-05-30 17:20:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7802177803240356292
Running compilation step : cd /tmp/ltsmin7802177803240356292;'/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 165 ms.
Running link step : cd /tmp/ltsmin7802177803240356292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7802177803240356292;'/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/stateBased3834409894868408732.hoa' '--buchi-type=spotba'
LTSmin run took 128 ms.
FORMULA AutoFlight-PT-05a-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLFireability-15 finished in 16819 ms.
All properties solved by simple procedures.
Total runtime 48821 ms.

BK_STOP 1748625623728

--------------------
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-05a"
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-05a, 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-174853729400508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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