Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944365800011.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is AirplaneLD-COL-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944365800011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.9K Mar 4 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 4 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 4 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 4 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 4 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 4 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 4 16:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 4 16:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 41K Mar 3 18:30 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-COL-0020-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779461470648

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-0020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202604301425
[2026-05-22 14:51:12] [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]
[2026-05-22 14:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 14:51:12] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-22 14:51:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-22 14:51:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2026-05-22 14:51:13] [INFO ] Detected 3 constant HL places corresponding to 62 PT places.
[2026-05-22 14:51:13] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 159 PT places and 252.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2026-05-22 14:51:13] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 5 ms.
[2026-05-22 14:51:13] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-COL-0020-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40000 steps (5054 resets) in 1403 ms. (28 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40003 steps (1361 resets) in 264 ms. (150 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1395 resets) in 360 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1149 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1398 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1338 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1257 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1341 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1345 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1322 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1336 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11500880045829434202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6156217652400556795.kers'
[2026-05-22 14:51:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11500880045829434202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6156217652400556795.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 14 rows 16 cols 37 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 14:51:14] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6156217652400556795.kers
Total runtime 5 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 3/11 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 5 (OVERLAPS) 13/25 variables, 12/15 constraints. Problems are: Problem set: 9 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/30 variables, 4/19 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/31 variables, 1/20 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 0/20 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/31 variables, 0/20 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 20 constraints, problems are : Problem set: 9 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 2/31 variables, and 0 constraints, problems are : Problem set: 10 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/17 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
FORMULA AirplaneLD-COL-0020-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 14:51:15] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2026-05-22 14:51:15] [INFO ] Flatten gal took : 30 ms
FORMULA AirplaneLD-COL-0020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 14:51:15] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:40) in guard (OR (GEQ $A 19) (EQ $A 39))introduces in Altitude(40) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:40) in guard (AND (LT $A 19) (NEQ $A 39))introduces in Altitude(40) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 40 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 19) (EQ $A 39)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 19) (NEQ $A 39)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:20) in guard (OR (LEQ $S 9) (EQ $S 19))introduces in Speed(20) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:20) in guard (AND (GT $S 9) (NEQ $S 19))introduces in Speed(20) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:20) in guard (OR (LEQ $S 9) (EQ $S 19))introduces in Speed(20) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:20) in guard (AND (GT $S 9) (NEQ $S 19))introduces in Speed(20) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 20 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 9) (EQ $S 19)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 9) (NEQ $S 19)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 9) (EQ $S 19)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 9) (NEQ $S 19)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2026-05-22 14:51:15] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 46 ms.
[2026-05-22 14:51:15] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 20 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17510985623631299610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17749781066616314028.kers'
[2026-05-22 14:51:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17510985623631299610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17749781066616314028.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 23 cols 56 entries
Finished phase 1 with 14 SingleSign rule and 6 generalized
[2026-05-22 14:51:15] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17749781066616314028.kers
Total runtime 0 ms.
[2026-05-22 14:51:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 14:51:15] [INFO ] Invariant cache hit.
[2026-05-22 14:51:15] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2026-05-22 14:51:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 20/39 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 4/43 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 26 constraints, problems are : Problem set: 0 solved, 10 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 20/39 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4/43 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 36 constraints, problems are : Problem set: 0 solved, 10 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 783ms
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 23/23 places, 20/20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-22 14:51:16] [INFO ] Invariant cache hit.
[2026-05-22 14:51:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-22 14:51:16] [INFO ] Invariant cache hit.
[2026-05-22 14:51:16] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 23/23 places, 20/20 transitions.
Support contains 20 out of 23 places after structural reductions.
[2026-05-22 14:51:16] [INFO ] Flatten gal took : 16 ms
[2026-05-22 14:51:16] [INFO ] Flatten gal took : 2 ms
[2026-05-22 14:51:16] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (5045 resets) in 611 ms. (65 steps per ms) remains 4/16 properties
BEST_FIRST walk for 40002 steps (915 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (879 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (965 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (884 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
[2026-05-22 14:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/10 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/12 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/26 variables, 12/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/40 variables, 8/23 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/43 variables, 3/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 26 constraints, problems are : Problem set: 3 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 2/43 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/23 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
Computed a total of 23 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 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).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 12 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 11 transition count 11
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 11 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 10 transition count 9
Applied a total of 6 rules in 33 ms. Remains 10 /23 variables (removed 13) and now considering 9/20 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3937991451533085290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17844776723376908245.kers'
[2026-05-22 14:51:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3937991451533085290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17844776723376908245.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 10 cols 20 entries
Finished phase 1 with 6 SingleSign rule and 3 generalized
[2026-05-22 14:51:16] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17844776723376908245.kers
Total runtime 1 ms.
[2026-05-22 14:51:16] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-22 14:51:16] [INFO ] Invariant cache hit.
[2026-05-22 14:51:16] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 9/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 9/23 places, 9/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 256 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0020-LTLCardinality-02 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 21 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 20 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 20 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 20 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 19 transition count 17
Applied a total of 6 rules in 7 ms. Remains 19 /23 variables (removed 4) and now considering 17/20 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6792917018776774453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2790137675432024704.kers'
[2026-05-22 14:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6792917018776774453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2790137675432024704.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 19 cols 43 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-22 14:51:17] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2790137675432024704.kers
Total runtime 1 ms.
[2026-05-22 14:51:17] [INFO ] Implicit Places using invariants in 62 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/23 places, 17/20 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 18 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 16
Applied a total of 2 rules in 7 ms. Remains 17 /18 variables (removed 1) and now considering 16/17 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9538569318386673661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14532681682249718203.kers'
[2026-05-22 14:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9538569318386673661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14532681682249718203.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 17 cols 39 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-22 14:51:17] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14532681682249718203.kers
Total runtime 1 ms.
[2026-05-22 14:51:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-22 14:51:17] [INFO ] Invariant cache hit.
[2026-05-22 14:51:17] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 118 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/23 places, 16/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14736886689314276478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15354698340872032959.kers'
[2026-05-22 14:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14736886689314276478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15354698340872032959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 15 cols 36 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 14:51:17] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15354698340872032959.kers
Total runtime 0 ms.
[2026-05-22 14:51:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-22 14:51:17] [INFO ] Invariant cache hit.
[2026-05-22 14:51:17] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 15/23 places, 15/20 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 266 ms. Remains : 15/23 places, 15/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-03
Product exploration explored 100000 steps with 16224 reset in 189 ms.
Product exploration explored 100000 steps with 16246 reset in 105 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
[2026-05-22 14:51:18] [INFO ] Invariant cache hit.
[2026-05-22 14:51:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 14:51:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-22 14:51:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 14:51:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 14:51:18] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-22 14:51:18] [INFO ] Computed and/alt/rep : 7/14/7 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-22 14:51:18] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 632 ms.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2026-05-22 14:51:18] [INFO ] Invariant cache hit.
[2026-05-22 14:51:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-22 14:51:18] [INFO ] Invariant cache hit.
[2026-05-22 14:51:18] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2026-05-22 14:51:18] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-22 14:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3/30 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/30 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 15/15 places, 15/15 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
[2026-05-22 14:51:19] [INFO ] Invariant cache hit.
[2026-05-22 14:51:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 14:51:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-22 14:51:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 14:51:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-22 14:51:19] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-22 14:51:19] [INFO ] Computed and/alt/rep : 7/14/7 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 14:51:19] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 539 ms.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16217 reset in 96 ms.
Product exploration explored 100000 steps with 16242 reset in 151 ms.
Built C files in :
/tmp/ltsmin1881449587714647386
[2026-05-22 14:51:20] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2026-05-22 14:51:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 14:51:20] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2026-05-22 14:51:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 14:51:20] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2026-05-22 14:51:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 14:51:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1881449587714647386
Running compilation step : cd /tmp/ltsmin1881449587714647386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin1881449587714647386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin1881449587714647386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10151516708406163064.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AirplaneLD-COL-0020-LTLCardinality-03 finished in 3343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 2 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 1 ms. Remains 2 /23 variables (removed 21) and now considering 2/20 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-518627956059756497.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9067922344514226966.kers'
[2026-05-22 14:51:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-518627956059756497.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9067922344514226966.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 2 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-22 14:51:20] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9067922344514226966.kers
Total runtime 0 ms.
[2026-05-22 14:51:20] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-22 14:51:20] [INFO ] Invariant cache hit.
[2026-05-22 14:51:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-22 14:51:20] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/23 places, 2/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 2/23 places, 2/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 38 ms.
Product exploration explored 100000 steps with 33333 reset in 53 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 12 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 70 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0020-LTLCardinality-04 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(X(p1)) U (X(X(G(p1)))||(!p1&&X(X(p1))))))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 1 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17924351382401578447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18186417024293943271.kers'
[2026-05-22 14:51:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17924351382401578447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18186417024293943271.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 19 cols 40 entries
Finished phase 1 with 13 SingleSign rule and 5 generalized
[2026-05-22 14:51:20] [INFO ] Computed 1 invariants in 5 ms
Computed 1 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18186417024293943271.kers
Total runtime 6 ms.
[2026-05-22 14:51:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-22 14:51:20] [INFO ] Invariant cache hit.
[2026-05-22 14:51:21] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2026-05-22 14:51:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 276 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/37 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 29 constraints, problems are : Problem set: 0 solved, 9 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 541ms
Starting structural reductions in LTL mode, iteration 1 : 19/23 places, 18/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 19/23 places, 18/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(X(p1)) U (X(X(G(p1)))||(!p1&&X(X(p1))))))))'
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 21 steps with 9 reset in 0 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0020-LTLCardinality-05 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10760981368938112003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8771925928340220957.kers'
[2026-05-22 14:51:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10760981368938112003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8771925928340220957.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 22 cols 50 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 14:51:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8771925928340220957.kers
Total runtime 0 ms.
[2026-05-22 14:51:21] [INFO ] Implicit Places using invariants in 28 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/23 places, 20/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0020-LTLCardinality-06 finished in 148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Support contains 9 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 0 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
[2026-05-22 14:51:21] [INFO ] Invariant cache hit.
[2026-05-22 14:51:21] [INFO ] Implicit Places using invariants in 36 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/23 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 21/23 places, 20/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 111 steps with 15 reset in 1 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0020-LTLCardinality-08 finished in 156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 19 transition count 19
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 19 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Applied a total of 6 rules in 1 ms. Remains 19 /23 variables (removed 4) and now considering 18/20 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13642971328015002107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4708200244411048537.kers'
[2026-05-22 14:51:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13642971328015002107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4708200244411048537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 19 cols 40 entries
Finished phase 1 with 13 SingleSign rule and 5 generalized
[2026-05-22 14:51:22] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4708200244411048537.kers
Total runtime 0 ms.
[2026-05-22 14:51:22] [INFO ] Implicit Places using invariants in 91 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/23 places, 18/20 transitions.
Applied a total of 0 rules in 1 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 94 ms. Remains : 18/23 places, 18/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 106 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)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 24 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 69 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0020-LTLCardinality-11 finished in 459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 16 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 15 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 15 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 15 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 14 transition count 13
Applied a total of 6 rules in 2 ms. Remains 14 /23 variables (removed 9) and now considering 13/20 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9354385762135716260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-50834196873260349.kers'
[2026-05-22 14:51:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9354385762135716260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-50834196873260349.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 14 cols 29 entries
Finished phase 1 with 9 SingleSign rule and 4 generalized
[2026-05-22 14:51:22] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-50834196873260349.kers
Total runtime 0 ms.
[2026-05-22 14:51:22] [INFO ] Implicit Places using invariants in 65 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/23 places, 13/20 transitions.
Graph (complete) has 11 edges and 13 vertex of which 12 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 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 11
Applied a total of 3 rules in 1 ms. Remains 11 /13 variables (removed 2) and now considering 11/13 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14992517780553893307.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4464315919989311481.kers'
[2026-05-22 14:51:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14992517780553893307.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4464315919989311481.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 11 cols 23 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-22 14:51:22] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4464315919989311481.kers
Total runtime 0 ms.
[2026-05-22 14:51:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-22 14:51:22] [INFO ] Invariant cache hit.
[2026-05-22 14:51:22] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 124 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/23 places, 11/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 193 ms. Remains : 10/23 places, 11/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-12
Product exploration explored 100000 steps with 20512 reset in 50 ms.
Product exploration explored 100000 steps with 20470 reset in 68 ms.
Computed a total of 10 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 11
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)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 11 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 60 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0020-LTLCardinality-12 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Graph (complete) has 41 edges and 23 vertex of which 17 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 17
Applied a total of 2 rules in 1 ms. Remains 17 /23 variables (removed 6) and now considering 17/20 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4195136585605216783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8474265264539393259.kers'
[2026-05-22 14:51:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4195136585605216783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8474265264539393259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 17 rows 17 cols 36 entries
Finished phase 1 with 12 SingleSign rule and 4 generalized
[2026-05-22 14:51:22] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8474265264539393259.kers
Total runtime 0 ms.
[2026-05-22 14:51:23] [INFO ] Implicit Places using invariants in 38 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/23 places, 17/20 transitions.
Graph (complete) has 13 edges and 16 vertex of which 15 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 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/17 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13377049884125261967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17619402986121719703.kers'
[2026-05-22 14:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13377049884125261967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17619402986121719703.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 14 cols 30 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 14:51:23] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17619402986121719703.kers
Total runtime 1 ms.
[2026-05-22 14:51:23] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-22 14:51:23] [INFO ] Invariant cache hit.
[2026-05-22 14:51:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/23 places, 15/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 14/23 places, 15/20 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0020-LTLCardinality-15
Product exploration explored 100000 steps with 30882 reset in 60 ms.
Product exploration explored 100000 steps with 30970 reset in 65 ms.
Computed a total of 14 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 15
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)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 17 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 69 ms.
FORMULA AirplaneLD-COL-0020-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-COL-0020-LTLCardinality-15 finished in 396 ms.
All properties solved by simple procedures.
Total runtime 11073 ms.

BK_STOP 1779461483754

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-COL-0020"
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-5973"
echo " Executing tool itstools"
echo " Input is AirplaneLD-COL-0020, 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-oct2-177944365800011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-COL-0020.tgz
mv AirplaneLD-COL-0020 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 ;