About the Execution of ITS-Tools for AirplaneLD-PT-0050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 68054.00 | 0.00 | 0.00 | TTFFFTFTFFFFFFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853728600092.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 AirplaneLD-PT-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853728600092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 135K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 560K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 150K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 219K 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 AirplaneLD-PT-0050-LTLFireability-00
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-01
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-02
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-03
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-04
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-05
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-06
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-07
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-08
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-09
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-10
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-11
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-12
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-13
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-14
FORMULA_NAME AirplaneLD-PT-0050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748538929029
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 17:15:30] [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-29 17:15:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:15:30] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2025-05-29 17:15:30] [INFO ] Transformed 369 places.
[2025-05-29 17:15:30] [INFO ] Transformed 408 transitions.
[2025-05-29 17:15:30] [INFO ] Found NUPN structural information;
[2025-05-29 17:15:30] [INFO ] Parsed PT model containing 369 places and 408 transitions and 1553 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 152 places and 0 transitions.
FORMULA AirplaneLD-PT-0050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 188 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 408/408 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 214 transition count 408
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 189 transition count 383
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 189 transition count 383
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 78 place count 189 transition count 358
Applied a total of 78 rules in 30 ms. Remains 189 /217 variables (removed 28) and now considering 358/408 (removed 50) transitions.
// Phase 1: matrix 358 rows 189 cols
[2025-05-29 17:15:30] [INFO ] Computed 1 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:30] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-29 17:15:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:15:31] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2025-05-29 17:15:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (OVERLAPS) 358/543 variables, 185/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 4/547 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/547 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 190 constraints, problems are : Problem set: 0 solved, 179 unsolved in 18000 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (OVERLAPS) 358/543 variables, 185/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 4/547 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 369 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48244ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 48404ms
Starting structural reductions in LTL mode, iteration 1 : 189/217 places, 358/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48839 ms. Remains : 189/217 places, 358/408 transitions.
Support contains 188 out of 189 places after structural reductions.
[2025-05-29 17:16:19] [INFO ] Flatten gal took : 46 ms
[2025-05-29 17:16:19] [INFO ] Flatten gal took : 27 ms
[2025-05-29 17:16:19] [INFO ] Input system was already deterministic with 358 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (5092 resets) in 2254 ms. (17 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (126 resets) in 367 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (102 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (103 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (106 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (103 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
[2025-05-29 17:16:20] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 3/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 211/272 variables, 61/62 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 226/498 variables, 103/165 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 49/547 variables, 25/190 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/547 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 190 constraints, problems are : Problem set: 1 solved, 4 unsolved in 567 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 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: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 171/231 variables, 49/58 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 202/433 variables, 77/135 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 104/537 variables, 52/187 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 7/544 variables, 4/191 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/546 variables, 1/192 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/547 variables, 2/194 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/547 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 194 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1080 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1662ms problems are : Problem set: 1 solved, 4 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 4 properties in 37 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 189 stabilizing places and 358 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 189 transition count 358
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(F(!p0))||(!p1&&F(!p0)))))'
Support contains 26 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Graph (complete) has 237 edges and 189 vertex of which 137 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.2 ms
Discarding 52 places :
Also discarding 100 output transitions
Drop transitions (Output transitions of discarded places.) removed 100 transitions
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 39 transition count 160
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 39 transition count 160
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 39 transition count 62
Applied a total of 295 rules in 15 ms. Remains 39 /189 variables (removed 150) and now considering 62/358 (removed 296) transitions.
// Phase 1: matrix 62 rows 39 cols
[2025-05-29 17:16:23] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:23] [INFO ] Implicit Places using invariants in 29 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/189 places, 62/358 transitions.
Graph (complete) has 36 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 36 transition count 60
Applied a total of 3 rules in 3 ms. Remains 36 /38 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 36 cols
[2025-05-29 17:16:23] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-05-29 17:16:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:23] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/189 places, 60/358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 36/189 places, 60/358 transitions.
Stuttering acceptance computed with spot in 217 ms :[p0, p0]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-00
Product exploration explored 100000 steps with 25116 reset in 280 ms.
Product exploration explored 100000 steps with 25076 reset in 220 ms.
Computed a total of 36 stabilizing places and 60 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 36 transition count 60
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0050-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLFireability-00 finished in 952 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(F(p0)))||((p1 U p2) U X(!p1))))'
Support contains 28 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 43 transition count 212
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 43 transition count 212
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 0 with 146 rules applied. Total rules applied 438 place count 43 transition count 66
Applied a total of 438 rules in 4 ms. Remains 43 /189 variables (removed 146) and now considering 66/358 (removed 292) transitions.
// Phase 1: matrix 66 rows 43 cols
[2025-05-29 17:16:23] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:23] [INFO ] Implicit Places using invariants in 28 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/189 places, 66/358 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 42/189 places, 66/358 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Computed a total of 42 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT p1))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 13 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0050-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLFireability-01 finished in 814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (X(p2)&&p1)))'
Support contains 52 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 67 transition count 236
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 67 transition count 236
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 0 with 122 rules applied. Total rules applied 366 place count 67 transition count 114
Applied a total of 366 rules in 4 ms. Remains 67 /189 variables (removed 122) and now considering 114/358 (removed 244) transitions.
// Phase 1: matrix 114 rows 67 cols
[2025-05-29 17:16:24] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:24] [INFO ] Implicit Places using invariants in 28 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/189 places, 114/358 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 66/189 places, 114/358 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (AND p0 p1 (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-02 finished in 248 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(F(!p0))||(p1&&F(!p0)))) U ((!p1&&F(G(p2))) U X(p2))))'
Support contains 53 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 68 transition count 237
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 68 transition count 237
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 363 place count 68 transition count 116
Applied a total of 363 rules in 6 ms. Remains 68 /189 variables (removed 121) and now considering 116/358 (removed 242) transitions.
// Phase 1: matrix 116 rows 68 cols
[2025-05-29 17:16:25] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:25] [INFO ] Implicit Places using invariants in 33 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/189 places, 116/358 transitions.
Applied a total of 0 rules in 0 ms. Remains 67 /67 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 67/189 places, 116/358 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-03
Stuttering criterion allowed to conclude after 39 steps with 7 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-03 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||X(!p1)) U (G((F(p2) U p0)) U X(p3)))))'
Support contains 55 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 121 places :
Symmetric choice reduction at 0 with 121 rule applications. Total rules 121 place count 68 transition count 237
Iterating global reduction 0 with 121 rules applied. Total rules applied 242 place count 68 transition count 237
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 363 place count 68 transition count 116
Applied a total of 363 rules in 6 ms. Remains 68 /189 variables (removed 121) and now considering 116/358 (removed 242) transitions.
// Phase 1: matrix 116 rows 68 cols
[2025-05-29 17:16:25] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-29 17:16:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2025-05-29 17:16:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 116/180 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 4/184 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 69 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2605 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 116/180 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 58/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 4/184 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 127 constraints, problems are : Problem set: 0 solved, 58 unsolved in 3786 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6417ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 6418ms
Starting structural reductions in LTL mode, iteration 1 : 68/189 places, 116/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6513 ms. Remains : 68/189 places, 116/358 transitions.
Stuttering acceptance computed with spot in 417 ms :[(NOT p3), (NOT p3), (NOT p3), (AND p1 (NOT p3)), (NOT p2), (NOT p0), (NOT p0), (NOT p3)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-04 finished in 6964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U (G(p1)||X(X(X(F(p2)))))))'
Support contains 55 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 69 transition count 238
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 69 transition count 238
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 360 place count 69 transition count 118
Applied a total of 360 rules in 5 ms. Remains 69 /189 variables (removed 120) and now considering 118/358 (removed 240) transitions.
// Phase 1: matrix 118 rows 69 cols
[2025-05-29 17:16:32] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:32] [INFO ] Implicit Places using invariants in 36 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/189 places, 118/358 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 68/189 places, 118/358 transitions.
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-05
Product exploration explored 100000 steps with 20944 reset in 605 ms.
Product exploration explored 100000 steps with 20905 reset in 632 ms.
Computed a total of 68 stabilizing places and 118 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 118
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0050-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLFireability-05 finished in 1796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p0 U X(X(G(!p0))))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 19 transition count 188
Iterating global reduction 0 with 170 rules applied. Total rules applied 340 place count 19 transition count 188
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 170 transitions.
Iterating post reduction 0 with 170 rules applied. Total rules applied 510 place count 19 transition count 18
Applied a total of 510 rules in 5 ms. Remains 19 /189 variables (removed 170) and now considering 18/358 (removed 340) transitions.
// Phase 1: matrix 18 rows 19 cols
[2025-05-29 17:16:34] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-29 17:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-29 17:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 9 unsolved in 113 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 232ms
Starting structural reductions in LTL mode, iteration 1 : 19/189 places, 18/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 19/189 places, 18/358 transitions.
Stuttering acceptance computed with spot in 176 ms :[p0, p0, true, p0, p0, p0]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-06
Entered a terminal (fully accepting) state of product in 13 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-06 finished in 512 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(p0)&&G(p1))))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 168 places :
Symmetric choice reduction at 0 with 168 rule applications. Total rules 168 place count 21 transition count 190
Iterating global reduction 0 with 168 rules applied. Total rules applied 336 place count 21 transition count 190
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 504 place count 21 transition count 22
Applied a total of 504 rules in 3 ms. Remains 21 /189 variables (removed 168) and now considering 22/358 (removed 336) transitions.
// Phase 1: matrix 22 rows 21 cols
[2025-05-29 17:16:34] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:34] [INFO ] Implicit Places using invariants in 37 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/189 places, 22/358 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 20/189 places, 22/358 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-09 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(!((p0 U p1)&&p2)))) U p1)))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 19 transition count 188
Iterating global reduction 0 with 170 rules applied. Total rules applied 340 place count 19 transition count 188
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 170 transitions.
Iterating post reduction 0 with 170 rules applied. Total rules applied 510 place count 19 transition count 18
Applied a total of 510 rules in 5 ms. Remains 19 /189 variables (removed 170) and now considering 18/358 (removed 340) transitions.
// Phase 1: matrix 18 rows 19 cols
[2025-05-29 17:16:34] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-29 17:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-05-29 17:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 110 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 9 unsolved in 141 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 257ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 257ms
Starting structural reductions in LTL mode, iteration 1 : 19/189 places, 18/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 19/189 places, 18/358 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p2), (AND p1 p2)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-10 finished in 516 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)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 169 place count 20 transition count 189
Iterating global reduction 0 with 169 rules applied. Total rules applied 338 place count 20 transition count 189
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 0 with 169 rules applied. Total rules applied 507 place count 20 transition count 20
Applied a total of 507 rules in 2 ms. Remains 20 /189 variables (removed 169) and now considering 20/358 (removed 338) transitions.
// Phase 1: matrix 20 rows 20 cols
[2025-05-29 17:16:35] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:35] [INFO ] Implicit Places using invariants in 22 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/189 places, 20/358 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 19/189 places, 20/358 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-11 finished in 129 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((G((p0||F(p1)))||X(F(p1)))))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Graph (complete) has 237 edges and 189 vertex of which 111 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.2 ms
Discarding 78 places :
Also discarding 100 output transitions
Drop transitions (Output transitions of discarded places.) removed 100 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 111 transition count 209
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 148 place count 13 transition count 111
Iterating global reduction 1 with 98 rules applied. Total rules applied 246 place count 13 transition count 111
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 344 place count 13 transition count 13
Applied a total of 344 rules in 10 ms. Remains 13 /189 variables (removed 176) and now considering 13/358 (removed 345) transitions.
// Phase 1: matrix 13 rows 13 cols
[2025-05-29 17:16:35] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:35] [INFO ] Implicit Places using invariants in 25 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/189 places, 13/358 transitions.
Graph (complete) has 9 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 11
Applied a total of 3 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 11/13 (removed 2) transitions.
// Phase 1: matrix 11 rows 10 cols
[2025-05-29 17:16:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-29 17:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:35] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/189 places, 11/358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 10/189 places, 11/358 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-12 finished in 186 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) U G((p1 U !p2)))&&F(p1))))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 169 place count 20 transition count 189
Iterating global reduction 0 with 169 rules applied. Total rules applied 338 place count 20 transition count 189
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Iterating post reduction 0 with 169 rules applied. Total rules applied 507 place count 20 transition count 20
Applied a total of 507 rules in 11 ms. Remains 20 /189 variables (removed 169) and now considering 20/358 (removed 338) transitions.
// Phase 1: matrix 20 rows 20 cols
[2025-05-29 17:16:35] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:35] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-29 17:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 17:16:35] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-05-29 17:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/40 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 159 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/40 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 300ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/189 places, 20/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374 ms. Remains : 20/189 places, 20/358 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), p2, p2]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0050-LTLFireability-13 finished in 559 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 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 358/358 transitions.
Discarding 168 places :
Symmetric choice reduction at 0 with 168 rule applications. Total rules 168 place count 21 transition count 190
Iterating global reduction 0 with 168 rules applied. Total rules applied 336 place count 21 transition count 190
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 504 place count 21 transition count 22
Applied a total of 504 rules in 8 ms. Remains 21 /189 variables (removed 168) and now considering 22/358 (removed 336) transitions.
// Phase 1: matrix 22 rows 21 cols
[2025-05-29 17:16:36] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:36] [INFO ] Implicit Places using invariants in 30 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/189 places, 22/358 transitions.
Graph (complete) has 18 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 18 transition count 20
Applied a total of 3 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 18 cols
[2025-05-29 17:16:36] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-29 17:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:16:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/189 places, 20/358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 18/189 places, 20/358 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0050-LTLFireability-14
Product exploration explored 100000 steps with 14444 reset in 131 ms.
Product exploration explored 100000 steps with 14498 reset in 151 ms.
Computed a total of 18 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 13 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0050-LTLFireability-14 finished in 460 ms.
All properties solved by simple procedures.
Total runtime 66461 ms.
BK_STOP 1748538997083
--------------------
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="AirplaneLD-PT-0050"
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 AirplaneLD-PT-0050, 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-174853728600092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0050.tgz
mv AirplaneLD-PT-0050 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 '
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 ;