fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853728600123
Last Updated
June 24, 2025

About the Execution of ITS-Tools for AirplaneLD-PT-1000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 87164.00 0.00 0.00 FTFTFTTFTTTTTTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 527K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 357K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M 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 411K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 205K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 809K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K 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 752K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.2M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 54K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 97K 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 4.3M 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-1000-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-1000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748539300794

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-1000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 17:21:42] [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:21:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:21:42] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2025-05-29 17:21:42] [INFO ] Transformed 7019 places.
[2025-05-29 17:21:42] [INFO ] Transformed 8008 transitions.
[2025-05-29 17:21:42] [INFO ] Found NUPN structural information;
[2025-05-29 17:21:42] [INFO ] Parsed PT model containing 7019 places and 8008 transitions and 30528 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 68 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 3002 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-PT-1000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3015 out of 4017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4017/4017 places, 8008/8008 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4016 transition count 8008
Discarding 997 places :
Symmetric choice reduction at 1 with 997 rule applications. Total rules 998 place count 3019 transition count 7011
Iterating global reduction 1 with 997 rules applied. Total rules applied 1995 place count 3019 transition count 7011
Ensure Unique test removed 997 transitions
Reduce isomorphic transitions removed 997 transitions.
Iterating post reduction 1 with 997 rules applied. Total rules applied 2992 place count 3019 transition count 6014
Applied a total of 2992 rules in 156 ms. Remains 3019 /4017 variables (removed 998) and now considering 6014/8008 (removed 1994) transitions.
// Phase 1: matrix 6014 rows 3019 cols
[2025-05-29 17:21:43] [INFO ] Computed 2 invariants in 582 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:21:44] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2025-05-29 17:21:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:21:46] [INFO ] Implicit Places using invariants and state equation in 2420 ms returned []
Implicit Place search using SMT with State Equation took 3527 ms to find 0 implicit places.
Running 3007 sub problems to find dead transitions.
[2025-05-29 17:21:46] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3012/9033 variables, and 0 constraints, problems are : Problem set: 0 solved, 3007 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/3019 constraints, PredecessorRefiner: 3007/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3007 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3012/9033 variables, and 0 constraints, problems are : Problem set: 0 solved, 3007 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/3019 constraints, PredecessorRefiner: 3000/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68408ms problems are : Problem set: 0 solved, 3007 unsolved
Search for dead transitions found 0 dead transitions in 68442ms
Starting structural reductions in LTL mode, iteration 1 : 3019/4017 places, 6014/8008 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72159 ms. Remains : 3019/4017 places, 6014/8008 transitions.
Support contains 3015 out of 3019 places after structural reductions.
[2025-05-29 17:22:55] [INFO ] Flatten gal took : 302 ms
[2025-05-29 17:22:55] [INFO ] Flatten gal took : 203 ms
[2025-05-29 17:22:56] [INFO ] Input system was already deterministic with 6014 transitions.
RANDOM walk for 40000 steps (5034 resets) in 9184 ms. (4 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1472 ms. (27 steps per ms) remains 3/3 properties
[2025-05-29 17:22:59] [INFO ] Invariant cache hit.
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/3007 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/3013 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3013 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6011/9024 variables, 3013/3015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9024 variables, 0/3015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 5 (OVERLAPS) 8/9032 variables, 5/3020 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9032 variables, 0/3020 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/9033 variables, 1/3021 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9033 variables, 0/3021 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/9033 variables, 0/3021 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 9033/9033 variables, and 3021 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3019/3019 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3007 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/3013 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3013 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6011/9024 variables, 3013/3015 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9024 variables, 0/3015 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 9032/9033 variables, and 3020 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1927 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3018/3019 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4923ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
FORMULA AirplaneLD-PT-1000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3019 stabilizing places and 6014 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3019 transition count 6014
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2998 places :
Symmetric choice reduction at 1 with 2998 rule applications. Total rules 3000 place count 19 transition count 3016
Iterating global reduction 1 with 2998 rules applied. Total rules applied 5998 place count 19 transition count 3016
Ensure Unique test removed 2998 transitions
Reduce isomorphic transitions removed 2998 transitions.
Iterating post reduction 1 with 2998 rules applied. Total rules applied 8996 place count 19 transition count 18
Applied a total of 8996 rules in 71 ms. Remains 19 /3019 variables (removed 3000) and now considering 18/6014 (removed 5996) transitions.
// Phase 1: matrix 18 rows 19 cols
[2025-05-29 17:23:04] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:04] [INFO ] Implicit Places using invariants in 25 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/3019 places, 18/6014 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 18/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-01
Product exploration explored 100000 steps with 20647 reset in 171 ms.
Product exploration explored 100000 steps with 20657 reset in 107 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLCardinality-01 finished in 713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(!p0)&&F(p0))))'
Support contains 3 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Discarding 2997 places :
Symmetric choice reduction at 0 with 2997 rule applications. Total rules 2997 place count 22 transition count 3017
Iterating global reduction 0 with 2997 rules applied. Total rules applied 5994 place count 22 transition count 3017
Ensure Unique test removed 2997 transitions
Reduce isomorphic transitions removed 2997 transitions.
Iterating post reduction 0 with 2997 rules applied. Total rules applied 8991 place count 22 transition count 20
Applied a total of 8991 rules in 106 ms. Remains 22 /3019 variables (removed 2997) and now considering 20/6014 (removed 5994) transitions.
// Phase 1: matrix 20 rows 22 cols
[2025-05-29 17:23:05] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:05] [INFO ] Implicit Places using invariants in 30 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/3019 places, 20/6014 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 1 place count 21 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 19
Applied a total of 2 rules in 6 ms. Remains 20 /21 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 20 cols
[2025-05-29 17:23:05] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-29 17:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:05] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/3019 places, 19/6014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 200 ms. Remains : 20/3019 places, 19/6014 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-03
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-1000-LTLCardinality-03 TRUE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-1000-LTLCardinality-03 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(F(p1))))))))'
Support contains 4 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3018 transition count 6014
Discarding 2996 places :
Symmetric choice reduction at 1 with 2996 rule applications. Total rules 2997 place count 22 transition count 3018
Iterating global reduction 1 with 2996 rules applied. Total rules applied 5993 place count 22 transition count 3018
Ensure Unique test removed 2996 transitions
Reduce isomorphic transitions removed 2996 transitions.
Iterating post reduction 1 with 2996 rules applied. Total rules applied 8989 place count 22 transition count 22
Applied a total of 8989 rules in 84 ms. Remains 22 /3019 variables (removed 2997) and now considering 22/6014 (removed 5992) transitions.
// Phase 1: matrix 22 rows 22 cols
[2025-05-29 17:23:05] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-29 17:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2025-05-29 17:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5/44 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 154 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/39 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 5/44 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 11 unsolved in 183 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 344ms
Starting structural reductions in LTL mode, iteration 1 : 22/3019 places, 22/6014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 22/3019 places, 22/6014 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-08
Product exploration explored 100000 steps with 23443 reset in 148 ms.
Product exploration explored 100000 steps with 23603 reset in 113 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLCardinality-08 finished in 1068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(p1)&&(X(G(p2)) U G(!p3)))))'
Support contains 7 out of 3019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3017 transition count 6014
Discarding 2997 places :
Symmetric choice reduction at 1 with 2997 rule applications. Total rules 2999 place count 20 transition count 3017
Iterating global reduction 1 with 2997 rules applied. Total rules applied 5996 place count 20 transition count 3017
Ensure Unique test removed 2997 transitions
Reduce isomorphic transitions removed 2997 transitions.
Iterating post reduction 1 with 2997 rules applied. Total rules applied 8993 place count 20 transition count 20
Applied a total of 8993 rules in 84 ms. Remains 20 /3019 variables (removed 2999) and now considering 20/6014 (removed 5994) transitions.
// Phase 1: matrix 20 rows 20 cols
[2025-05-29 17:23:06] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:06] [INFO ] Implicit Places using invariants in 30 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/3019 places, 20/6014 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 19/3019 places, 20/6014 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND p3 (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), true, (NOT p2), (AND p3 p2), (AND p3 (NOT p2)), p3]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 19 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p3 p0 p1 p2), (X (NOT (AND p3 (NOT p0) p1))), (X p3), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND p3 (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 21 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLCardinality-09 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 3019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3019/3019 places, 6014/6014 transitions.
Graph (complete) has 6024 edges and 3019 vertex of which 3018 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2997 places :
Symmetric choice reduction at 0 with 2997 rule applications. Total rules 2998 place count 21 transition count 3017
Iterating global reduction 0 with 2997 rules applied. Total rules applied 5995 place count 21 transition count 3017
Ensure Unique test removed 2997 transitions
Reduce isomorphic transitions removed 2997 transitions.
Iterating post reduction 0 with 2997 rules applied. Total rules applied 8992 place count 21 transition count 20
Applied a total of 8992 rules in 73 ms. Remains 21 /3019 variables (removed 2998) and now considering 20/6014 (removed 5994) transitions.
// Phase 1: matrix 20 rows 21 cols
[2025-05-29 17:23:07] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:07] [INFO ] Implicit Places using invariants in 37 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/3019 places, 20/6014 transitions.
Graph (complete) has 19 edges and 20 vertex of which 19 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 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 18 transition count 18
Applied a total of 3 rules in 8 ms. Remains 18 /20 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 18 cols
[2025-05-29 17:23:07] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-29 17:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 17:23:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/3019 places, 18/6014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 18/3019 places, 18/6014 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AirplaneLD-PT-1000-LTLCardinality-13
Product exploration explored 100000 steps with 24720 reset in 91 ms.
Product exploration explored 100000 steps with 24597 reset in 129 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-1000-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-1000-LTLCardinality-13 finished in 527 ms.
All properties solved by simple procedures.
Total runtime 85546 ms.

BK_STOP 1748539387958

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

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-1000.tgz
mv AirplaneLD-PT-1000 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;