Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118200276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AirplaneLD-PT-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118200276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 111K Apr 12 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 382K Apr 12 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 70K Apr 12 03:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 424K Apr 12 03:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 60K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 250K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 148K Apr 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 553K Apr 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 12 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 872K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717250045452

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:54:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:54:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:54:08] [INFO ] Load time of PNML (sax parser for PT used): 617 ms
[2024-06-01 13:54:08] [INFO ] Transformed 1419 places.
[2024-06-01 13:54:09] [INFO ] Transformed 1608 transitions.
[2024-06-01 13:54:09] [INFO ] Found NUPN structural information;
[2024-06-01 13:54:09] [INFO ] Parsed PT model containing 1419 places and 1608 transitions and 6128 arcs in 888 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 602 places and 0 transitions.
FORMULA AirplaneLD-PT-0200-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 318 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 814 transition count 1608
Discarding 492 places :
Symmetric choice reduction at 1 with 492 rule applications. Total rules 495 place count 322 transition count 1116
Iterating global reduction 1 with 492 rules applied. Total rules applied 987 place count 322 transition count 1116
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Iterating post reduction 1 with 492 rules applied. Total rules applied 1479 place count 322 transition count 624
Applied a total of 1479 rules in 141 ms. Remains 322 /817 variables (removed 495) and now considering 624/1608 (removed 984) transitions.
// Phase 1: matrix 624 rows 322 cols
[2024-06-01 13:54:09] [INFO ] Computed 1 invariants in 99 ms
[2024-06-01 13:54:10] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-06-01 13:54:10] [INFO ] Invariant cache hit.
[2024-06-01 13:54:10] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-06-01 13:54:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 624/942 variables, 318/319 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/942 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 4/946 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 323 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 624/942 variables, 318/319 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/942 variables, 312/631 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/942 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 4/946 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 635 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints]
After SMT, in 61817ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 61859ms
Starting structural reductions in LTL mode, iteration 1 : 322/817 places, 624/1608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63188 ms. Remains : 322/817 places, 624/1608 transitions.
Support contains 318 out of 322 places after structural reductions.
[2024-06-01 13:55:13] [INFO ] Flatten gal took : 252 ms
[2024-06-01 13:55:13] [INFO ] Flatten gal took : 133 ms
[2024-06-01 13:55:14] [INFO ] Input system was already deterministic with 624 transitions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (5113 resets) in 4528 ms. (8 steps per ms) remains 3/25 properties
BEST_FIRST walk for 40004 steps (85 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (85 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (84 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
[2024-06-01 13:55:15] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/215 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 506/721 variables, 203/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/721 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 213/934 variables, 105/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/934 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/946 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/946 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 946/946 variables, and 323 constraints, problems are : Problem set: 0 solved, 3 unsolved in 487 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 208/215 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 506/721 variables, 203/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/721 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/721 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 213/934 variables, 105/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/934 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/946 variables, 7/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/946 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/946 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 946/946 variables, and 326 constraints, problems are : Problem set: 0 solved, 3 unsolved in 867 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1410ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 58 ms.
Computed a total of 322 stabilizing places and 624 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 322 transition count 624
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(!X(p0))) U p1)&&X(p2)))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 19 transition count 321
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 19 transition count 321
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 0 with 303 rules applied. Total rules applied 909 place count 19 transition count 18
Applied a total of 909 rules in 18 ms. Remains 19 /322 variables (removed 303) and now considering 18/624 (removed 606) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-06-01 13:55:17] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 13:55:17] [INFO ] Invariant cache hit.
[2024-06-01 13:55:17] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 13:55:17] [INFO ] Invariant cache hit.
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 211 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
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 185 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 401ms
Starting structural reductions in LTL mode, iteration 1 : 19/322 places, 18/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 19/322 places, 18/624 transitions.
Stuttering acceptance computed with spot in 512 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) p0), true, p0]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-00
Entered a terminal (fully accepting) state of product in 15 steps with 7 reset in 3 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-00 finished in 1151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 204 places :
Symmetric choice reduction at 0 with 204 rule applications. Total rules 204 place count 118 transition count 420
Iterating global reduction 0 with 204 rules applied. Total rules applied 408 place count 118 transition count 420
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Iterating post reduction 0 with 204 rules applied. Total rules applied 612 place count 118 transition count 216
Applied a total of 612 rules in 33 ms. Remains 118 /322 variables (removed 204) and now considering 216/624 (removed 408) transitions.
// Phase 1: matrix 216 rows 118 cols
[2024-06-01 13:55:18] [INFO ] Computed 1 invariants in 7 ms
[2024-06-01 13:55:18] [INFO ] Implicit Places using invariants in 79 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/322 places, 216/624 transitions.
Graph (complete) has 115 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 116 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 115 transition count 214
Applied a total of 3 rules in 27 ms. Remains 115 /117 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 115 cols
[2024-06-01 13:55:18] [INFO ] Computed 0 invariants in 6 ms
[2024-06-01 13:55:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 13:55:18] [INFO ] Invariant cache hit.
[2024-06-01 13:55:19] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/322 places, 214/624 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 115/322 places, 214/624 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-01 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 100 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 205 place count 117 transition count 419
Iterating global reduction 0 with 205 rules applied. Total rules applied 410 place count 117 transition count 419
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 0 with 205 rules applied. Total rules applied 615 place count 117 transition count 214
Applied a total of 615 rules in 12 ms. Remains 117 /322 variables (removed 205) and now considering 214/624 (removed 410) transitions.
// Phase 1: matrix 214 rows 117 cols
[2024-06-01 13:55:19] [INFO ] Computed 1 invariants in 10 ms
[2024-06-01 13:55:19] [INFO ] Implicit Places using invariants in 81 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/322 places, 214/624 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 116/322 places, 214/624 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-02 finished in 237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||(p2&&(!p0 U (G(!p0)||(!p0&&G(!p1)))))))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 19 transition count 321
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 19 transition count 321
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 0 with 303 rules applied. Total rules applied 909 place count 19 transition count 18
Applied a total of 909 rules in 14 ms. Remains 19 /322 variables (removed 303) and now considering 18/624 (removed 606) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-06-01 13:55:19] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 13:55:19] [INFO ] Invariant cache hit.
[2024-06-01 13:55:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 13:55:19] [INFO ] Invariant cache hit.
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 196 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
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 192 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 394ms
Starting structural reductions in LTL mode, iteration 1 : 19/322 places, 18/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 515 ms. Remains : 19/322 places, 18/624 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, p0, p1, (AND p1 p0), p0, p0]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-04
Product exploration explored 100000 steps with 12596 reset in 569 ms.
Product exploration explored 100000 steps with 12599 reset in 275 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 18
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)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 2125 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 417 ms :[true, (AND p0 p1), p1, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (5045 resets) in 276 ms. (144 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (1105 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
[2024-06-01 13:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 13/37 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p2), (F (NOT (OR p1 p0 (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 9 factoid took 3866 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 8 states, 26 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[true, p1, (AND p1 p0), p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 336 ms :[true, p1, (AND p1 p0), p0, p0, p0, p0, p0]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Graph (complete) has 17 edges and 19 vertex of which 8 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /19 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-06-01 13:55:28] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 13:55:28] [INFO ] Invariant cache hit.
[2024-06-01 13:55:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 13:55:28] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 13:55:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 73 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 89 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/19 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 8/19 places, 8/18 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
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)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 2444 ms. Reduced automaton from 8 states, 26 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (AND p1 p0 p2), p0, (AND p0 p1), p1]
RANDOM walk for 40000 steps (8890 resets) in 297 ms. (134 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40002 steps (3806 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3636 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
[2024-06-01 13:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 13/16 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (G (OR (NOT p1) (NOT p0))), (G (OR (NOT p1) (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND p1 (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0 (NOT p2)))), (F p0), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 12 factoid took 5152 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 228 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Stuttering acceptance computed with spot in 236 ms :[true, p0, (AND p0 p1 p2), (AND p0 p1), p1]
Product exploration explored 100000 steps with 22221 reset in 209 ms.
Product exploration explored 100000 steps with 22226 reset in 232 ms.
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 13:55:38] [INFO ] Invariant cache hit.
[2024-06-01 13:55:38] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 13:55:38] [INFO ] Invariant cache hit.
[2024-06-01 13:55:38] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 13:55:38] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 13:55:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 177 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/15 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 102 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 8/8 places, 8/8 transitions.
Treatment of property AirplaneLD-PT-0200-LTLFireability-04 finished in 19414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))||G(p2)))'
Support contains 104 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 120 transition count 422
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 120 transition count 422
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Iterating post reduction 0 with 202 rules applied. Total rules applied 606 place count 120 transition count 220
Applied a total of 606 rules in 32 ms. Remains 120 /322 variables (removed 202) and now considering 220/624 (removed 404) transitions.
// Phase 1: matrix 220 rows 120 cols
[2024-06-01 13:55:38] [INFO ] Computed 1 invariants in 6 ms
[2024-06-01 13:55:39] [INFO ] Implicit Places using invariants in 191 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/322 places, 220/624 transitions.
Graph (complete) has 117 edges and 119 vertex of which 118 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 118 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 117 transition count 218
Applied a total of 3 rules in 10 ms. Remains 117 /119 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 117 cols
[2024-06-01 13:55:39] [INFO ] Computed 0 invariants in 5 ms
[2024-06-01 13:55:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 13:55:39] [INFO ] Invariant cache hit.
[2024-06-01 13:55:39] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/322 places, 218/624 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 462 ms. Remains : 117/322 places, 218/624 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-07 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(p2)&&p1))))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 303 places :
Symmetric choice reduction at 0 with 303 rule applications. Total rules 303 place count 19 transition count 321
Iterating global reduction 0 with 303 rules applied. Total rules applied 606 place count 19 transition count 321
Ensure Unique test removed 303 transitions
Reduce isomorphic transitions removed 303 transitions.
Iterating post reduction 0 with 303 rules applied. Total rules applied 909 place count 19 transition count 18
Applied a total of 909 rules in 8 ms. Remains 19 /322 variables (removed 303) and now considering 18/624 (removed 606) transitions.
// Phase 1: matrix 18 rows 19 cols
[2024-06-01 13:55:39] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 13:55:39] [INFO ] Invariant cache hit.
[2024-06-01 13:55:39] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 13:55:39] [INFO ] Invariant cache hit.
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 142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
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 182 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 331ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 332ms
Starting structural reductions in LTL mode, iteration 1 : 19/322 places, 18/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 19/322 places, 18/624 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-08
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-08 finished in 586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(p1)) U p2))'
Support contains 7 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 21 transition count 323
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 21 transition count 323
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Iterating post reduction 0 with 301 rules applied. Total rules applied 903 place count 21 transition count 22
Applied a total of 903 rules in 11 ms. Remains 21 /322 variables (removed 301) and now considering 22/624 (removed 602) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 13:55:40] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:40] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 13:55:40] [INFO ] Invariant cache hit.
[2024-06-01 13:55:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-06-01 13:55:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/43 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 255 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 4/43 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 232 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 497ms
Starting structural reductions in LTL mode, iteration 1 : 21/322 places, 22/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 21/322 places, 22/624 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-09
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-09 finished in 794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F(p1))))))'
Support contains 4 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Graph (complete) has 322 edges and 322 vertex of which 17 are kept as prefixes of interest. Removing 305 places using SCC suffix rule.2 ms
Discarding 305 places :
Also discarding 602 output transitions
Drop transitions (Output transitions of discarded places.) removed 602 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 12 transition count 17
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 12 transition count 17
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 12 transition count 12
Applied a total of 16 rules in 9 ms. Remains 12 /322 variables (removed 310) and now considering 12/624 (removed 612) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-06-01 13:55:40] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 13:55:41] [INFO ] Invariant cache hit.
[2024-06-01 13:55:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-06-01 13:55:41] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 13:55:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/22 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/24 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 156 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/22 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 130 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/322 places, 12/624 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 12/322 places, 12/624 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-10 finished in 539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0))||G(p1)))&&F(p2)))'
Support contains 6 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 21 transition count 323
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 21 transition count 323
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Iterating post reduction 0 with 301 rules applied. Total rules applied 903 place count 21 transition count 22
Applied a total of 903 rules in 7 ms. Remains 21 /322 variables (removed 301) and now considering 22/624 (removed 602) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 13:55:41] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 13:55:41] [INFO ] Invariant cache hit.
[2024-06-01 13:55:41] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-06-01 13:55:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 4/43 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 242 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 4/43 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 11 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 512ms
Starting structural reductions in LTL mode, iteration 1 : 21/322 places, 22/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 21/322 places, 22/624 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-11
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-11 finished in 1081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X((!p1||F((p2 U (p3||G(p2)))))) U ((!p1&&X((!p1||F((p2 U (p3||G(p2)))))))||X(G((!p1||F((p2 U (p3||G(p2)))))))))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 302 places :
Symmetric choice reduction at 0 with 302 rule applications. Total rules 302 place count 20 transition count 322
Iterating global reduction 0 with 302 rules applied. Total rules applied 604 place count 20 transition count 322
Ensure Unique test removed 302 transitions
Reduce isomorphic transitions removed 302 transitions.
Iterating post reduction 0 with 302 rules applied. Total rules applied 906 place count 20 transition count 20
Applied a total of 906 rules in 9 ms. Remains 20 /322 variables (removed 302) and now considering 20/624 (removed 604) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-06-01 13:55:42] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 13:55:42] [INFO ] Invariant cache hit.
[2024-06-01 13:55:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 13:55:42] [INFO ] Invariant cache hit.
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 216 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
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 227 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 451ms
Starting structural reductions in LTL mode, iteration 1 : 20/322 places, 20/624 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 554 ms. Remains : 20/322 places, 20/624 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (AND p1 (NOT p2) (NOT p3))), (NOT p0), (AND p1 (NOT p3) (NOT p2)), (AND p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-12
Product exploration explored 100000 steps with 32754 reset in 266 ms.
Product exploration explored 100000 steps with 32835 reset in 297 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 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)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1))), (F (G p3)), (F (G p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 27 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0200-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLFireability-12 finished in 1604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(p1||G(p2))))))'
Support contains 5 out of 322 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Discarding 301 places :
Symmetric choice reduction at 0 with 301 rule applications. Total rules 301 place count 21 transition count 323
Iterating global reduction 0 with 301 rules applied. Total rules applied 602 place count 21 transition count 323
Ensure Unique test removed 301 transitions
Reduce isomorphic transitions removed 301 transitions.
Iterating post reduction 0 with 301 rules applied. Total rules applied 903 place count 21 transition count 22
Applied a total of 903 rules in 6 ms. Remains 21 /322 variables (removed 301) and now considering 22/624 (removed 602) transitions.
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 13:55:44] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:55:44] [INFO ] Implicit Places using invariants in 48 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/322 places, 22/624 transitions.
Applied a total of 0 rules in 0 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 59 ms. Remains : 20/322 places, 22/624 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-13 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 624/624 transitions.
Graph (complete) has 322 edges and 322 vertex of which 17 are kept as prefixes of interest. Removing 305 places using SCC suffix rule.1 ms
Discarding 305 places :
Also discarding 602 output transitions
Drop transitions (Output transitions of discarded places.) removed 602 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 12 transition count 17
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 12 transition count 17
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 12 transition count 12
Applied a total of 16 rules in 7 ms. Remains 12 /322 variables (removed 310) and now considering 12/624 (removed 612) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-06-01 13:55:44] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:55:44] [INFO ] Implicit Places using invariants in 37 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/322 places, 12/624 transitions.
Graph (complete) has 9 edges and 11 vertex of which 10 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 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 10
Applied a total of 3 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 9 cols
[2024-06-01 13:55:44] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 13:55:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 13:55:44] [INFO ] Invariant cache hit.
[2024-06-01 13:55:44] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/322 places, 10/624 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 9/322 places, 10/624 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLFireability-14 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||(p2&&(!p0 U (G(!p0)||(!p0&&G(!p1)))))))))'
[2024-06-01 13:55:45] [INFO ] Flatten gal took : 77 ms
[2024-06-01 13:55:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 13:55:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 322 places, 624 transitions and 1254 arcs took 17 ms.
Total runtime 97273 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AirplaneLD-PT-0200-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717250203404

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AirplaneLD-PT-0200-LTLFireability-04
ltl formula formula --ltl=/tmp/1367/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 322 places, 624 transitions and 1254 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1367/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1367/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1367/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1367/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 324 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 323, there are 722 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~11 levels ~10000 states ~44540 transitions
pnml2lts-mc( 1/ 4): ~10 levels ~20000 states ~94064 transitions
pnml2lts-mc( 1/ 4): ~10 levels ~40000 states ~215812 transitions
pnml2lts-mc( 2/ 4): ~11 levels ~80000 states ~507640 transitions
pnml2lts-mc( 0/ 4): ~10 levels ~160000 states ~983724 transitions
pnml2lts-mc( 0/ 4): ~10 levels ~320000 states ~2220540 transitions
pnml2lts-mc( 0/ 4): ~10 levels ~640000 states ~4673160 transitions
pnml2lts-mc( 1/ 4): ~10 levels ~1280000 states ~8203940 transitions
pnml2lts-mc( 3/ 4): ~10 levels ~2560000 states ~20328292 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4469835
pnml2lts-mc( 0/ 4): unique states count: 4469835
pnml2lts-mc( 0/ 4): unique transitions count: 42934836
pnml2lts-mc( 0/ 4): - self-loop count: 1454812
pnml2lts-mc( 0/ 4): - claim dead count: 37022344
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4470110
pnml2lts-mc( 0/ 4): - cum. max stack depth: 41
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4470110 states 42978821 transitions, fanout: 9.615
pnml2lts-mc( 0/ 4): Total exploration time 56.750 sec (56.750 sec minimum, 56.750 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78768, Transitions per second: 757336
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 44.7MB, 10.5 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/16.0%
pnml2lts-mc( 0/ 4): Stored 636 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 44.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AirplaneLD-PT-0200, 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 r464-smll-171620118200276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0200.tgz
mv AirplaneLD-PT-0200 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;