About the Execution of ITS-Tools for AutoFlight-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 19175.00 | 0.00 | 0.00 | TTTTFTFTTTTTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729400507.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is AutoFlight-PT-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729400507
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 36K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-05a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748625529807
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 17:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 17:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:18:51] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2025-05-30 17:18:51] [INFO ] Transformed 132 places.
[2025-05-30 17:18:51] [INFO ] Transformed 130 transitions.
[2025-05-30 17:18:51] [INFO ] Found NUPN structural information;
[2025-05-30 17:18:51] [INFO ] Parsed PT model containing 132 places and 130 transitions and 420 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-05a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 105/105 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 132 cols
[2025-05-30 17:18:51] [INFO ] Computed 34 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:18:51] [INFO ] Implicit Places using invariants in 467 ms returned [7, 21, 28, 38, 44, 47, 50, 77, 99, 105, 111, 117, 123, 129, 131]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 500 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/132 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 101
Applied a total of 8 rules in 12 ms. Remains 113 /117 variables (removed 4) and now considering 101/105 (removed 4) transitions.
// Phase 1: matrix 101 rows 113 cols
[2025-05-30 17:18:51] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:18:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-30 17:18:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:18:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-05-30 17:18:51] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/132 places, 101/105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 724 ms. Remains : 113/132 places, 101/105 transitions.
Support contains 24 out of 113 places after structural reductions.
[2025-05-30 17:18:52] [INFO ] Flatten gal took : 26 ms
[2025-05-30 17:18:52] [INFO ] Flatten gal took : 11 ms
[2025-05-30 17:18:52] [INFO ] Input system was already deterministic with 101 transitions.
RANDOM walk for 40000 steps (1208 resets) in 1270 ms. (31 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (182 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (180 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
[2025-05-30 17:18:57] [INFO ] Invariant cache hit.
[2025-05-30 17:18:57] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 69/73 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/113 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 101/214 variables, 113/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 9/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 141 constraints, problems are : Problem set: 1 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 71/214 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 2/19 constraints, State Equation: 0/113 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA AutoFlight-PT-05a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 109 transition count 65
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 74 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 73 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 75 place count 73 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 92 place count 62 transition count 58
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 97 place count 62 transition count 53
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 102 place count 57 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 56 transition count 52
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 56 transition count 52
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 128 place count 44 transition count 40
Applied a total of 128 rules in 25 ms. Remains 44 /113 variables (removed 69) and now considering 40/101 (removed 61) transitions.
// Phase 1: matrix 40 rows 44 cols
[2025-05-30 17:18:57] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:18:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 17:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:18:57] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:18:57] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-05-30 17:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 40/84 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 55 constraints, problems are : Problem set: 0 solved, 23 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 40/84 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 78 constraints, problems are : Problem set: 0 solved, 23 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1031ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1031ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/113 places, 40/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1178 ms. Remains : 44/113 places, 40/101 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-02
Product exploration explored 100000 steps with 5641 reset in 225 ms.
Product exploration explored 100000 steps with 5657 reset in 153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2601 steps (143 resets) in 20 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2025-05-30 17:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:18:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 17:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:18:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:18:59] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-05-30 17:18:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 40/84 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 55 constraints, problems are : Problem set: 0 solved, 23 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 40/84 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 23/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 78 constraints, problems are : Problem set: 0 solved, 23 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 735ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 44/44 places, 40/40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2468 steps (137 resets) in 11 ms. (205 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5656 reset in 107 ms.
Product exploration explored 100000 steps with 5650 reset in 109 ms.
Built C files in :
/tmp/ltsmin5661117011615694789
[2025-05-30 17:19:03] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2025-05-30 17:19:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:19:03] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2025-05-30 17:19:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:19:03] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2025-05-30 17:19:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 17:19:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5661117011615694789
Running compilation step : cd /tmp/ltsmin5661117011615694789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 244 ms.
Running link step : cd /tmp/ltsmin5661117011615694789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin5661117011615694789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3853695379616816891.hoa' '--buchi-type=spotba'
LTSmin run took 374 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-05a-LTLCardinality-02 finished in 7005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 100 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 88
Applied a total of 26 rules in 39 ms. Remains 100 /113 variables (removed 13) and now considering 88/101 (removed 13) transitions.
// Phase 1: matrix 88 rows 100 cols
[2025-05-30 17:19:04] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:04] [INFO ] Implicit Places using invariants in 54 ms returned [13, 32, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/113 places, 88/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 93 transition count 84
Applied a total of 8 rules in 7 ms. Remains 93 /97 variables (removed 4) and now considering 84/88 (removed 4) transitions.
// Phase 1: matrix 84 rows 93 cols
[2025-05-30 17:19:04] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:04] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 17:19:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:04] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/113 places, 84/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 93/113 places, 84/101 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-06 finished in 320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Applied a total of 22 rules in 37 ms. Remains 102 /113 variables (removed 11) and now considering 90/101 (removed 11) transitions.
// Phase 1: matrix 90 rows 102 cols
[2025-05-30 17:19:04] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:04] [INFO ] Implicit Places using invariants in 69 ms returned [13, 32, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 90/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 99/113 places, 90/101 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLCardinality-08 finished in 586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 109 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 109 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 106 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 106 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 105 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 105 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 103 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 103 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 102 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 102 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 101 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 101 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 100 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 88
Applied a total of 26 rules in 31 ms. Remains 100 /113 variables (removed 13) and now considering 88/101 (removed 13) transitions.
// Phase 1: matrix 88 rows 100 cols
[2025-05-30 17:19:05] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:05] [INFO ] Implicit Places using invariants in 63 ms returned [13, 32, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/113 places, 88/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 96 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 95 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 95 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 94 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 94 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 93 transition count 84
Applied a total of 8 rules in 8 ms. Remains 93 /97 variables (removed 4) and now considering 84/88 (removed 4) transitions.
// Phase 1: matrix 84 rows 93 cols
[2025-05-30 17:19:05] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-30 17:19:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:05] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/113 places, 84/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 206 ms. Remains : 93/113 places, 84/101 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-05a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-05a-LTLCardinality-09 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 109 transition count 68
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 77 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 75 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 71 place count 75 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 66 transition count 61
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 66 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 91 place count 63 transition count 58
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 93 place count 61 transition count 56
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 61 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 117 place count 50 transition count 45
Applied a total of 117 rules in 12 ms. Remains 50 /113 variables (removed 63) and now considering 45/101 (removed 56) transitions.
// Phase 1: matrix 45 rows 50 cols
[2025-05-30 17:19:06] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 17:19:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:06] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:19:06] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2025-05-30 17:19:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 45/95 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/95 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 62 constraints, problems are : Problem set: 0 solved, 27 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 45/95 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 89 constraints, problems are : Problem set: 0 solved, 27 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 819ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/113 places, 45/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 921 ms. Remains : 50/113 places, 45/101 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-12
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-12 finished in 1009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||X(X(F(p2)))))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 112 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 112 transition count 100
Applied a total of 2 rules in 3 ms. Remains 112 /113 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 112 cols
[2025-05-30 17:19:07] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:19:07] [INFO ] Implicit Places using invariants in 52 ms returned [13, 32, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/113 places, 100/101 transitions.
Applied a total of 0 rules in 0 ms. Remains 109 /109 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 109/113 places, 100/101 transitions.
Stuttering acceptance computed with spot in 1783 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p2) (AND p0 (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-05a-LTLCardinality-14
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-05a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-05a-LTLCardinality-14 finished in 1861 ms.
All properties solved by simple procedures.
Total runtime 17971 ms.
BK_STOP 1748625548982
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-05a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729400507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05a.tgz
mv AutoFlight-PT-05a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;