About the Execution of ITS-Tools for AirplaneLD-PT-0200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 307378.00 | 0.00 | 0.00 | FFTTTFFTFFTTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853728600107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is AirplaneLD-PT-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853728600107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 114K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 430K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 517K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 119K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 309K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 71K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 301K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 327K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 980K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 872K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0200-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748539071125
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 17:17:52] [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-29 17:17:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:17:52] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-05-29 17:17:52] [INFO ] Transformed 1419 places.
[2025-05-29 17:17:52] [INFO ] Transformed 1608 transitions.
[2025-05-29 17:17:52] [INFO ] Found NUPN structural information;
[2025-05-29 17:17:52] [INFO ] Parsed PT model containing 1419 places and 1608 transitions and 6128 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 602 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA AirplaneLD-PT-0200-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0200-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 813 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Applied a total of 0 rules in 19 ms. Remains 817 /817 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
// Phase 1: matrix 1608 rows 817 cols
[2025-05-29 17:17:53] [INFO ] Computed 3 invariants in 103 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:17:53] [INFO ] Implicit Places using invariants in 499 ms returned []
[2025-05-29 17:17:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:17:54] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
Running 804 sub problems to find dead transitions.
[2025-05-29 17:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/809 variables, 809/809 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/809 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (OVERLAPS) 3/812 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/812 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 812/2425 variables, and 814 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30042 ms.
Refiners :[Domain max(s): 812/817 constraints, Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/809 variables, 809/809 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/809 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (OVERLAPS) 3/812 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/812 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 804 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 812/2425 variables, and 814 constraints, problems are : Problem set: 0 solved, 804 unsolved in 30030 ms.
Refiners :[Domain max(s): 812/817 constraints, Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61857ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 61874ms
Finished structural reductions in LTL mode , in 1 iterations and 63101 ms. Remains : 817/817 places, 1608/1608 transitions.
Support contains 813 out of 817 places after structural reductions.
[2025-05-29 17:18:56] [INFO ] Flatten gal took : 124 ms
[2025-05-29 17:18:56] [INFO ] Flatten gal took : 75 ms
[2025-05-29 17:18:56] [INFO ] Input system was already deterministic with 1608 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (5028 resets) in 2371 ms. (16 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40004 steps (15 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (23 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2025-05-29 17:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 4/2425 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 20 ms.
Refiners :[Domain max(s): 4/817 constraints, Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AirplaneLD-PT-0200-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
Computed a total of 817 stabilizing places and 1608 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 817 transition count 1608
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA AirplaneLD-PT-0200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0&&(F(p1) U p2)) U G(p2)) U !p1) U p3))'
Support contains 206 out of 817 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Graph (complete) has 2123 edges and 817 vertex of which 814 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 596 places :
Symmetric choice reduction at 0 with 596 rule applications. Total rules 597 place count 218 transition count 1012
Iterating global reduction 0 with 596 rules applied. Total rules applied 1193 place count 218 transition count 1012
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Iterating post reduction 0 with 596 rules applied. Total rules applied 1789 place count 218 transition count 416
Applied a total of 1789 rules in 47 ms. Remains 218 /817 variables (removed 599) and now considering 416/1608 (removed 1192) transitions.
// Phase 1: matrix 416 rows 218 cols
[2025-05-29 17:18:57] [INFO ] Computed 1 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:18:57] [INFO ] Implicit Places using invariants in 49 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 SI_LTL mode, iteration 1 : 217/817 places, 416/1608 transitions.
Applied a total of 0 rules in 6 ms. Remains 217 /217 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 217/817 places, 416/1608 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p3), true, (NOT p2), (NOT p2), p1, (NOT p1)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 48 steps with 23 reset in 16 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLCardinality-00 finished in 544 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)&&(G(p1)||(p1&&F(p2)))))'
Support contains 602 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 815 transition count 1608
Discarding 199 places :
Symmetric choice reduction at 1 with 199 rule applications. Total rules 201 place count 616 transition count 1409
Iterating global reduction 1 with 199 rules applied. Total rules applied 400 place count 616 transition count 1409
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 599 place count 616 transition count 1210
Applied a total of 599 rules in 31 ms. Remains 616 /817 variables (removed 201) and now considering 1210/1608 (removed 398) transitions.
// Phase 1: matrix 1210 rows 616 cols
[2025-05-29 17:18:58] [INFO ] Computed 2 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:18:58] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-05-29 17:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:18:58] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2025-05-29 17:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 2/612 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1822 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1822/1826 variables, and 614 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 612/616 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 2/612 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1822 variables, 612/614 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1822 variables, 605/1219 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1822/1826 variables, and 1219 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 612/616 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61024ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 61027ms
Starting structural reductions in LTL mode, iteration 1 : 616/817 places, 1210/1608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61787 ms. Remains : 616/817 places, 1210/1608 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 3812 ms.
Product exploration explored 100000 steps with 50000 reset in 3734 ms.
Computed a total of 616 stabilizing places and 1210 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 616 transition count 1210
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0200-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLCardinality-02 finished in 70224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(p1 U X(G(p2)))))'
Support contains 402 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 397 places :
Symmetric choice reduction at 1 with 397 rule applications. Total rules 400 place count 417 transition count 1211
Iterating global reduction 1 with 397 rules applied. Total rules applied 797 place count 417 transition count 1211
Ensure Unique test removed 397 transitions
Reduce isomorphic transitions removed 397 transitions.
Iterating post reduction 1 with 397 rules applied. Total rules applied 1194 place count 417 transition count 814
Applied a total of 1194 rules in 14 ms. Remains 417 /817 variables (removed 400) and now considering 814/1608 (removed 794) transitions.
// Phase 1: matrix 814 rows 417 cols
[2025-05-29 17:20:08] [INFO ] Computed 1 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:20:08] [INFO ] Implicit Places using invariants in 137 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 416/817 places, 814/1608 transitions.
Applied a total of 0 rules in 3 ms. Remains 416 /416 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 416/817 places, 814/1608 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 4312 ms.
Product exploration explored 100000 steps with 50000 reset in 4336 ms.
Computed a total of 416 stabilizing places and 814 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 416 transition count 814
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 16 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0200-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0200-LTLCardinality-04 finished in 9196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(p0) U ((p1&&X(p0))||X(G(p0))))) U (X(G((X(p0) U ((p1&&X(p0))||X(G(p0))))))||(!p2&&X((X(p0) U ((p1&&X(p0))||X(G(p0)))))))))))'
Support contains 204 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 597 places :
Symmetric choice reduction at 1 with 597 rule applications. Total rules 600 place count 217 transition count 1011
Iterating global reduction 1 with 597 rules applied. Total rules applied 1197 place count 217 transition count 1011
Ensure Unique test removed 597 transitions
Reduce isomorphic transitions removed 597 transitions.
Iterating post reduction 1 with 597 rules applied. Total rules applied 1794 place count 217 transition count 414
Applied a total of 1794 rules in 13 ms. Remains 217 /817 variables (removed 600) and now considering 414/1608 (removed 1194) transitions.
// Phase 1: matrix 414 rows 217 cols
[2025-05-29 17:20:17] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:20:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-29 17:20:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:20:17] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-05-29 17:20:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 414/627 variables, 213/214 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 4/631 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/631 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 218 constraints, problems are : Problem set: 0 solved, 207 unsolved in 17778 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 414/627 variables, 213/214 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 207/421 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 4/631 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 425 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47995ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 47998ms
Starting structural reductions in LTL mode, iteration 1 : 217/817 places, 414/1608 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48284 ms. Remains : 217/817 places, 414/1608 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-05
Product exploration explored 100000 steps with 19977 reset in 649 ms.
Product exploration explored 100000 steps with 19970 reset in 687 ms.
Computed a total of 217 stabilizing places and 414 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 217 transition count 414
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (5041 resets) in 326 ms. (122 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
[2025-05-29 17:21:08] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
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/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 611/631 variables, and 206 constraints, problems are : Problem set: 1 solved, 0 unsolved in 109 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/217 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F (NOT (OR (NOT p2) p0))), (F (NOT p1)), (F p2), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 504 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
[2025-05-29 17:21:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 17:21:10] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-29 17:21:11] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2025-05-29 17:21:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 17:21:12] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-29 17:21:13] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-05-29 17:21:13] [INFO ] Computed and/alt/rep : 206/410/206 causal constraints (skipped 1 transitions) in 24 ms.
[2025-05-29 17:21:13] [INFO ] Added : 0 causal constraints over 0 iterations in 65 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 204 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 414/414 transitions.
Applied a total of 0 rules in 2 ms. Remains 217 /217 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2025-05-29 17:21:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:21:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-29 17:21:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:21:13] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-05-29 17:21:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 414/627 variables, 213/214 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 4/631 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/631 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 218 constraints, problems are : Problem set: 0 solved, 207 unsolved in 18108 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 414/627 variables, 213/214 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 207/421 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 4/631 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 425 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48328ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 48329ms
Finished structural reductions in LTL mode , in 1 iterations and 48533 ms. Remains : 217/217 places, 414/414 transitions.
Computed a total of 217 stabilizing places and 414 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 217 transition count 414
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 5507 steps (690 resets) in 62 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (F (G p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 4 factoid took 428 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
[2025-05-29 17:22:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 17:22:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-29 17:22:05] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2025-05-29 17:22:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 17:22:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-29 17:22:06] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-05-29 17:22:06] [INFO ] Computed and/alt/rep : 206/410/206 causal constraints (skipped 1 transitions) in 21 ms.
[2025-05-29 17:22:07] [INFO ] Added : 0 causal constraints over 0 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 19979 reset in 631 ms.
Product exploration explored 100000 steps with 19980 reset in 632 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 204 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 414/414 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 217 transition count 414
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 414
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 15 ms. Remains 217 /217 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 17:22:09] [INFO ] Redundant transitions in 19 ms returned []
Running 208 sub problems to find dead transitions.
// Phase 1: matrix 414 rows 217 cols
[2025-05-29 17:22:09] [INFO ] Computed 1 invariants in 13 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Problem TDEAD206 is UNSAT
At refinement iteration 3 (OVERLAPS) 414/628 variables, 214/215 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 3/631 variables, 3/218 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/631 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 218 constraints, problems are : Problem set: 1 solved, 207 unsolved in 17611 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 414/627 variables, 213/214 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 207/421 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 0/421 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 4/631 variables, 4/425 constraints. Problems are: Problem set: 1 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/425 constraints. Problems are: Problem set: 1 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 425 constraints, problems are : Problem set: 1 solved, 207 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 207/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47812ms problems are : Problem set: 1 solved, 207 unsolved
Search for dead transitions found 1 dead transitions in 47813ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 217/217 places, 413/414 transitions.
Graph (complete) has 314 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 216 /217 variables (removed 1) and now considering 413/413 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 216/217 places, 413/414 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47866 ms. Remains : 216/217 places, 413/414 transitions.
Built C files in :
/tmp/ltsmin6814651799232791046
[2025-05-29 17:22:56] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6814651799232791046
Running compilation step : cd /tmp/ltsmin6814651799232791046;'/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 749 ms.
Running link step : cd /tmp/ltsmin6814651799232791046;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6814651799232791046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17218679111591821482.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-PT-0200-LTLCardinality-05 finished in 160423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 817 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 817/817 places, 1608/1608 transitions.
Graph (complete) has 2123 edges and 817 vertex of which 612 are kept as prefixes of interest. Removing 205 places using SCC suffix rule.6 ms
Discarding 205 places :
Also discarding 400 output transitions
Drop transitions (Output transitions of discarded places.) removed 400 transitions
Discarding 596 places :
Symmetric choice reduction at 0 with 596 rule applications. Total rules 597 place count 16 transition count 612
Iterating global reduction 0 with 596 rules applied. Total rules applied 1193 place count 16 transition count 612
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 596 transitions.
Iterating post reduction 0 with 596 rules applied. Total rules applied 1789 place count 16 transition count 16
Applied a total of 1789 rules in 26 ms. Remains 16 /817 variables (removed 801) and now considering 16/1608 (removed 1592) transitions.
// Phase 1: matrix 16 rows 16 cols
[2025-05-29 17:22:58] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:22:58] [INFO ] Implicit Places using invariants in 24 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/817 places, 16/1608 transitions.
Graph (complete) has 13 edges and 15 vertex of which 14 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 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2025-05-29 17:22:58] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:22:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-29 17:22:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:22:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/817 places, 14/1608 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 13/817 places, 14/1608 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0200-LTLCardinality-14
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA AirplaneLD-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0200-LTLCardinality-14 finished in 152 ms.
All properties solved by simple procedures.
Total runtime 305779 ms.
BK_STOP 1748539378503
--------------------
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="AirplaneLD-PT-0200"
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 AirplaneLD-PT-0200, 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-174853728600107"
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 [ "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 ;