Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074500916.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is HouseConstruction-PT-16000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074500916
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.9K Mar 7 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 7 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Mar 7 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-16000-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779785097030

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-16000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 08:44:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 08:44:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 08:44:58] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2026-05-26 08:44:58] [INFO ] Transformed 26 places.
[2026-05-26 08:44:58] [INFO ] Transformed 18 transitions.
[2026-05-26 08:44:58] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-16000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (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-4362529357898701940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14606834314165869265.kers'
[2026-05-26 08:44:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4362529357898701940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14606834314165869265.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:44:58] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14606834314165869265.kers
Total runtime 1 ms.
[2026-05-26 08:44:58] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-26 08:44:58] [INFO ] Invariant cache hit.
[2026-05-26 08:44:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 08:44:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 620 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 51 constraints, problems are : Problem set: 0 solved, 17 unsolved in 346 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 993ms
Finished structural reductions in LTL mode , in 1 iterations and 1268 ms. Remains : 26/26 places, 18/18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 08:44:59] [INFO ] Invariant cache hit.
[2026-05-26 08:44:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-26 08:44:59] [INFO ] Invariant cache hit.
[2026-05-26 08:44:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 24 out of 26 places after structural reductions.
[2026-05-26 08:44:59] [INFO ] Flatten gal took : 15 ms
[2026-05-26 08:44:59] [INFO ] Flatten gal took : 4 ms
[2026-05-26 08:45:00] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 64004 steps (0 resets) in 30 ms. (2064 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 3/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 2/3 properties
[2026-05-26 08:45:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/44 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 2 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/44 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/44 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 36 constraints, problems are : Problem set: 0 solved, 2 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 31951 steps, including 0 resets, run visited all 2 properties in 161 ms. (steps per millisecond=198 )
Parikh walk visited 2 properties in 165 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HouseConstruction-PT-16000-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 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).
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(X(F((G((!p0||F(!p1)))||X(F(!p1)))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 6 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (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-1296123818230166563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1780172287700101102.kers'
[2026-05-26 08:45:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1296123818230166563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1780172287700101102.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:45:01] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1780172287700101102.kers
Total runtime 1 ms.
[2026-05-26 08:45:01] [INFO ] Implicit Places using invariants in 36 ms returned [9, 13, 19]
[2026-05-26 08:45:01] [INFO ] Actually due to overlaps returned [9, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 18
Applied a total of 1 rules in 1 ms. Remains 22 /23 variables (removed 1) and now considering 18/18 (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-6062016184284120132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13225588036781042650.kers'
[2026-05-26 08:45:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6062016184284120132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13225588036781042650.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:45:01] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13225588036781042650.kers
Total runtime 0 ms.
[2026-05-26 08:45:01] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-26 08:45:01] [INFO ] Invariant cache hit.
[2026-05-26 08:45:01] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 22/26 places, 18/18 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(X(F((G((F(p1)||p0))||X(F(p1)))))))'
Stuttering acceptance computed with spot in 404 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 : HouseConstruction-PT-16000-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 181 ms.
Product exploration explored 100000 steps with 25000 reset in 101 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 7 factoid took 11 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 45 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-00 finished in 907 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(p0)||F(p1)||G(p2)))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 13 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 12 transition count 8
Applied a total of 3 rules in 1909 ms. Remains 12 /26 variables (removed 14) and now considering 8/18 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7576279800171218402.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2847675026961180146.kers'
[2026-05-26 08:45:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7576279800171218402.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2847675026961180146.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 12 cols 23 entries
Finished phase 1 with 6 SingleSign rule and 2 generalized
[2026-05-26 08:45:03] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2847675026961180146.kers
Total runtime 1 ms.
[2026-05-26 08:45:03] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-26 08:45:03] [INFO ] Invariant cache hit.
[2026-05-26 08:45:03] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-26 08:45:03] [INFO ] Redundant transitions in 1 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-26 08:45:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 80 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 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/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 91 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 174ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/26 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2139 ms. Remains : 12/26 places, 8/18 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(p0)||F(p1)||G(p2)))'
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-01
Product exploration explored 100000 steps with 7411 reset in 114 ms.
Product exploration explored 100000 steps with 7335 reset in 218 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 26 factoid took 71 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 64004 steps (0 resets) in 19 ms. (3200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/6 properties
BEST_FIRST walk for 197 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge based reduction with 26 factoid took 121 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Knowledge-based reduction took 432 ms.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 5 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2026-05-26 08:45:05] [INFO ] Invariant cache hit.
[2026-05-26 08:45:05] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-26 08:45:05] [INFO ] Invariant cache hit.
[2026-05-26 08:45:05] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-26 08:45:05] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 12/12 places, 8/8 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 15 factoid took 61 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 64004 steps (0 resets) in 26 ms. (2370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/6 properties
BEST_FIRST walk for 85 steps (0 resets) in 8 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 15 factoid took 121 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Knowledge-based reduction took 396 ms.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 7294 reset in 99 ms.
Product exploration explored 100000 steps with 7346 reset in 179 ms.
Built C files in :
/tmp/ltsmin6772268599700440369
[2026-05-26 08:45:06] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2026-05-26 08:45:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:45:06] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2026-05-26 08:45:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:45:06] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2026-05-26 08:45:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:45:06] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6772268599700440369
Running compilation step : cd /tmp/ltsmin6772268599700440369;'/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 181 ms.
Running link step : cd /tmp/ltsmin6772268599700440369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6772268599700440369;'/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/stateBased18246029831675057552.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 7/8 (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-1049903313695939568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4612470113169374570.kers'
[2026-05-26 08:45:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1049903313695939568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4612470113169374570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 11 cols 21 entries
Finished phase 1 with 5 SingleSign rule and 2 generalized
[2026-05-26 08:45:21] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4612470113169374570.kers
Total runtime 0 ms.
[2026-05-26 08:45:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-26 08:45:21] [INFO ] Invariant cache hit.
[2026-05-26 08:45:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-26 08:45:21] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-26 08:45:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/17 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/17 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 7/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 11/12 places, 7/8 transitions.
Built C files in :
/tmp/ltsmin378689924188093299
[2026-05-26 08:45:21] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2026-05-26 08:45:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:45:21] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2026-05-26 08:45:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:45:21] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2026-05-26 08:45:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:45:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin378689924188093299
Running compilation step : cd /tmp/ltsmin378689924188093299;'/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 74 ms.
Running link step : cd /tmp/ltsmin378689924188093299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin378689924188093299;'/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/stateBased5634605246130127240.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 08:45:36] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:45:36] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:45:36] [INFO ] Time to serialize gal into /tmp/LTL8374804891921957479.gal : 1 ms
[2026-05-26 08:45:36] [INFO ] Time to serialize properties into /tmp/LTL13528293879730968148.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8374804891921957479.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15964916629776873401.hoa' '-atoms' '/tmp/LTL13528293879730968148.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13528293879730968148.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15964916629776873401.hoa
Detected timeout of ITS tools.
[2026-05-26 08:45:51] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:45:51] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:45:51] [INFO ] Time to serialize gal into /tmp/LTL10301378186784282556.gal : 0 ms
[2026-05-26 08:45:51] [INFO ] Time to serialize properties into /tmp/LTL4660124878243171172.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10301378186784282556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4660124878243171172.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((G("(p11>=1)"))||(F("((p4>=1)&&(p15>=1))")))||(G("(((p12<1)||(p10<1))||(p13<1))"))))
Formula 0 simplified : F!"(p11>=1)" & G!"((p4>=1)&&(p15>=1))" & F!"(((p12<1)||(p10<1))||(p13<1))"
Detected timeout of ITS tools.
[2026-05-26 08:46:06] [INFO ] Flatten gal took : 4 ms
[2026-05-26 08:46:06] [INFO ] Applying decomposition
[2026-05-26 08:46:06] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10089119495207234549.txt' '-o' '/tmp/graph10089119495207234549.bin' '-w' '/tmp/graph10089119495207234549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10089119495207234549.bin' '-l' '-1' '-v' '-w' '/tmp/graph10089119495207234549.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:46:06] [INFO ] Decomposing Gal with order
[2026-05-26 08:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:46:06] [INFO ] Flatten gal took : 41 ms
[2026-05-26 08:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 08:46:06] [INFO ] Time to serialize gal into /tmp/LTL15890295798507155617.gal : 1 ms
[2026-05-26 08:46:06] [INFO ] Time to serialize properties into /tmp/LTL8506250427665850808.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15890295798507155617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8506250427665850808.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((G("(u2.p11>=1)"))||(F("((i1.u0.p4>=1)&&(u2.p15>=1))")))||(G("(((i1.u3.p12<1)||(i2.u4.p10<1))||(i2.u1.p13<1))"))))
Formula 0 simplified : F!"(u2.p11>=1)" & G!"((i1.u0.p4>=1)&&(u2.p15>=1))" & F!"(((i1.u3.p12<1)||(i2.u4.p10<1))||(i2.u1.p13<1))"
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-16000-LTLFireability-01 finished in 79957 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 8 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 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 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 4 transition count 3
Applied a total of 7 rules in 1761 ms. Remains 4 /26 variables (removed 22) and now considering 3/18 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11072237421391200317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9120411400388879483.kers'
[2026-05-26 08:46:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11072237421391200317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9120411400388879483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 4 cols 7 entries
Finished phase 1 with 2 SingleSign rule and 1 generalized
[2026-05-26 08:46:23] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9120411400388879483.kers
Total runtime 0 ms.
[2026-05-26 08:46:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 08:46:23] [INFO ] Invariant cache hit.
[2026-05-26 08:46:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-26 08:46:23] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-26 08:46:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 34 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/7 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1880 ms. Remains : 4/26 places, 3/18 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 33 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-02
Product exploration explored 100000 steps with 2 reset in 96 ms.
Product exploration explored 100000 steps with 2 reset in 113 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
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 38 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 58 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-02 finished in 2207 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' '!((p0 U (G(p2)&&p1)))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 12 transition count 7
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 9 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 9 transition count 5
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 14 place count 6 transition count 5
Applied a total of 14 rules in 6 ms. Remains 6 /26 variables (removed 20) and now considering 5/18 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8741143197017549872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4612383442682170105.kers'
[2026-05-26 08:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8741143197017549872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4612383442682170105.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 9 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-26 08:46:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4612383442682170105.kers
Total runtime 1 ms.
[2026-05-26 08:46:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 08:46:24] [INFO ] Invariant cache hit.
[2026-05-26 08:46:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-26 08:46:24] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-26 08:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/11 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/26 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 6/26 places, 5/18 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' '!((p0 U (G(p2)&&p1)))'
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-03 finished in 331 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 8 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 5 transition count 4
Applied a total of 7 rules in 4 ms. Remains 5 /26 variables (removed 21) and now considering 4/18 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9714195263033803744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2813973787147534183.kers'
[2026-05-26 08:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9714195263033803744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2813973787147534183.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 5 cols 9 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-26 08:46:24] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2813973787147534183.kers
Total runtime 0 ms.
[2026-05-26 08:46:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 08:46:24] [INFO ] Invariant cache hit.
[2026-05-26 08:46:24] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-26 08:46:24] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-26 08:46:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/9 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 5/26 places, 4/18 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 41 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-07
Product exploration explored 100000 steps with 1 reset in 88 ms.
Product exploration explored 100000 steps with 1 reset in 117 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
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 9 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 35 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-07 finished in 441 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) U X(X((p1||X((!p2||X(p3))))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (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-8111648255942550146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15237548761704301189.kers'
[2026-05-26 08:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8111648255942550146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15237548761704301189.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:46:24] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15237548761704301189.kers
Total runtime 0 ms.
[2026-05-26 08:46:24] [INFO ] Implicit Places using invariants in 36 ms returned [3, 9, 13, 19]
[2026-05-26 08:46:24] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (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-10353278237765461960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5609597292007187900.kers'
[2026-05-26 08:46:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10353278237765461960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5609597292007187900.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 21 cols 41 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:46:24] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5609597292007187900.kers
Total runtime 0 ms.
[2026-05-26 08:46:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 08:46:24] [INFO ] Invariant cache hit.
[2026-05-26 08:46:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 21/26 places, 18/18 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) U X(X((p1||X((!p2||X(p3))))))))'
Stuttering acceptance computed with spot in 700 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-08
Product exploration explored 100000 steps with 4820 reset in 164 ms.
Product exploration explored 100000 steps with 4745 reset in 87 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 16 states, 21 edges and 4 AP (stutter sensitive) to 10 states, 12 edges and 4 AP (stutter sensitive).
RANDOM walk for 64004 steps (0 resets) in 12 ms. (4923 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/6 properties
[2026-05-26 08:46:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/26 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/39 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/10 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/12 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/39 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 1 unsolved in 44 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16000 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=1454 )
Parikh walk visited 1 properties in 10 ms.
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 10 states, 12 edges and 4 AP (stutter sensitive) to 10 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 460 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (NOT p0)]
Knowledge-based reduction took 1107 ms.
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (NOT p0)]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 08:46:27] [INFO ] Invariant cache hit.
[2026-05-26 08:46:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 08:46:27] [INFO ] Invariant cache hit.
[2026-05-26 08:46:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 08:46:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 182 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 194 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 381ms
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 10 states, 12 edges and 4 AP (stutter sensitive) to 10 states, 12 edges and 4 AP (stutter sensitive).
RANDOM walk for 64004 steps (0 resets) in 15 ms. (4000 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/6 properties
[2026-05-26 08:46:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/26 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/39 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/6 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/10 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/12 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/39 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16000 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=1066 )
Parikh walk visited 1 properties in 14 ms.
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 10 states, 12 edges and 4 AP (stutter sensitive) to 10 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (NOT p0)]
Knowledge-based reduction took 930 ms.
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 444 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (NOT p0)]
Product exploration explored 100000 steps with 5287 reset in 82 ms.
Product exploration explored 100000 steps with 5148 reset in 83 ms.
Spot run failed in 76 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13788955336479599887
[2026-05-26 08:46:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13788955336479599887
Running compilation step : cd /tmp/ltsmin13788955336479599887;'/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 88 ms.
Running link step : cd /tmp/ltsmin13788955336479599887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13788955336479599887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7595736688991706042.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 08:46:45] [INFO ] Invariant cache hit.
[2026-05-26 08:46:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-26 08:46:45] [INFO ] Invariant cache hit.
[2026-05-26 08:46:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin13390850048420237293
[2026-05-26 08:46:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13390850048420237293
Running compilation step : cd /tmp/ltsmin13390850048420237293;'/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 76 ms.
Running link step : cd /tmp/ltsmin13390850048420237293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13390850048420237293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9104059485219495116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 08:47:00] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:47:00] [INFO ] Flatten gal took : 2 ms
[2026-05-26 08:47:00] [INFO ] Time to serialize gal into /tmp/LTL9489708274277664145.gal : 0 ms
[2026-05-26 08:47:00] [INFO ] Time to serialize properties into /tmp/LTL802796331053271801.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9489708274277664145.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7608370149721618603.hoa' '-atoms' '/tmp/LTL802796331053271801.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL802796331053271801.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7608370149721618603.hoa
Detected timeout of ITS tools.
[2026-05-26 08:47:15] [INFO ] Flatten gal took : 3 ms
[2026-05-26 08:47:15] [INFO ] Flatten gal took : 2 ms
[2026-05-26 08:47:15] [INFO ] Time to serialize gal into /tmp/LTL3680231616554160994.gal : 1 ms
[2026-05-26 08:47:15] [INFO ] Time to serialize properties into /tmp/LTL964498608499942448.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3680231616554160994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL964498608499942448.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((F("(p18>=1)"))U(X(X(("(p2<1)")||(X(("(p1<1)")||(X("((p21>=1)&&(p23>=1))")))))))))
Formula 0 simplified : G!"(p18>=1)" R XX(!"(p2<1)" & X(!"(p1<1)" & X!"((p21>=1)&&(p23>=1))"))
Detected timeout of ITS tools.
[2026-05-26 08:47:30] [INFO ] Flatten gal took : 5 ms
[2026-05-26 08:47:30] [INFO ] Applying decomposition
[2026-05-26 08:47:30] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3369432766453081183.txt' '-o' '/tmp/graph3369432766453081183.bin' '-w' '/tmp/graph3369432766453081183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3369432766453081183.bin' '-l' '-1' '-v' '-w' '/tmp/graph3369432766453081183.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:47:30] [INFO ] Decomposing Gal with order
[2026-05-26 08:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:47:30] [INFO ] Flatten gal took : 2 ms
[2026-05-26 08:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 08:47:30] [INFO ] Time to serialize gal into /tmp/LTL17620104021492183144.gal : 1 ms
[2026-05-26 08:47:30] [INFO ] Time to serialize properties into /tmp/LTL2640090196063309198.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17620104021492183144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2640090196063309198.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(u6.p18>=1)"))U(X(X(("(i1.u0.p2<1)")||(X(("(i1.u0.p1<1)")||(X("((u6.p21>=1)&&(u5.p23>=1))")))))))))
Formula 0 simplified : G!"(u6.p18>=1)" R XX(!"(i1.u0.p2<1)" & X(!"(i1.u0.p1<1)" & X!"((u6.p21>=1)&&(u5.p23>=1))"))
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-16000-LTLFireability-08 finished in 80444 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((X(p0)||F((p1&&F(!p0))))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (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-11342450637245762539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13902151366527243111.kers'
[2026-05-26 08:47:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11342450637245762539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13902151366527243111.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:47:45] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13902151366527243111.kers
Total runtime 0 ms.
[2026-05-26 08:47:45] [INFO ] Implicit Places using invariants in 41 ms returned [3, 9, 13, 19]
[2026-05-26 08:47:45] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (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-13128551711851959314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9473229938138207238.kers'
[2026-05-26 08:47:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13128551711851959314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9473229938138207238.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 21 cols 41 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:47:45] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9473229938138207238.kers
Total runtime 0 ms.
[2026-05-26 08:47:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-26 08:47:45] [INFO ] Invariant cache hit.
[2026-05-26 08:47:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105 ms. Remains : 21/26 places, 18/18 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((X(p0)||F((p1&&F(!p0))))))'
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), p0, (OR (NOT p1) p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 37 ms.
Product exploration explored 100000 steps with 33333 reset in 39 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 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 7 factoid took 10 ms. Proved property starting from automaton with 5 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 38 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-09 finished in 406 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((G(p0) U ((F(!p1)&&F(p2)) U !p3)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 5 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 11 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 11 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 16 place count 9 transition count 8
Applied a total of 16 rules in 9 ms. Remains 9 /26 variables (removed 17) and now considering 8/18 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3679770026967524049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9137232281903897794.kers'
[2026-05-26 08:47:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3679770026967524049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9137232281903897794.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 9 cols 17 entries
Finished phase 1 with 7 SingleSign rule and 1 generalized
[2026-05-26 08:47:45] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9137232281903897794.kers
Total runtime 0 ms.
[2026-05-26 08:47:45] [INFO ] Implicit Places using invariants in 17 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/26 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28 ms. Remains : 8/26 places, 8/18 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((G(p0) U ((F(!p1)&&F(p2)) U !p3)))))'
Stuttering acceptance computed with spot in 359 ms :[p3, (AND (NOT p2) p3), p3, (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p3), p3, (AND p1 p3), (AND p3 p1 (NOT p0)), (AND p1 p3)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-10
Product exploration explored 100000 steps with 15475 reset in 101 ms.
Product exploration explored 100000 steps with 15475 reset in 109 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be false by K+ with min(phi)
Knowledge based reduction with 38 factoid took 22 ms. Proved property starting from automaton with 9 states, 42 edges and 4 AP (stutter insensitive
Knowledge-based reduction took 45 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-10 finished in 686 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(p0) U p1) U (!p2 U G(p1))) U X(p0)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (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-4872835333360641282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13062236201777644416.kers'
[2026-05-26 08:47:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4872835333360641282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13062236201777644416.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:47:46] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13062236201777644416.kers
Total runtime 1 ms.
[2026-05-26 08:47:46] [INFO ] Implicit Places using invariants in 30 ms returned [3, 9, 13, 19]
[2026-05-26 08:47:46] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 0 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (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-13907740680800379359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1455461529168421696.kers'
[2026-05-26 08:47:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13907740680800379359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1455461529168421696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 21 cols 41 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:47:46] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1455461529168421696.kers
Total runtime 0 ms.
[2026-05-26 08:47:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-26 08:47:46] [INFO ] Invariant cache hit.
[2026-05-26 08:47:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 21/26 places, 18/18 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(p0) U p1) U (!p2 U G(p1))) U X(p0)))'
Stuttering acceptance computed with spot in 470 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-11 finished in 599 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) U X(X(p1)))&&X((!p2 U (!p1||G(!p2))))))'
Support contains 8 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (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-6494819072778705687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16759206916882734130.kers'
[2026-05-26 08:47:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6494819072778705687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16759206916882734130.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:47:47] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16759206916882734130.kers
Total runtime 0 ms.
[2026-05-26 08:47:47] [INFO ] Implicit Places using invariants in 23 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26 ms. Remains : 24/26 places, 18/18 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) U X(X(p1)))&&X((!p2 U (!p1||G(!p2))))))'
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) p2), (AND p1 p2), (NOT p1), (AND p0 (NOT p1)), true, (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-12
Product exploration explored 100000 steps with 13687 reset in 64 ms.
Product exploration explored 100000 steps with 13560 reset in 68 ms.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 15 factoid took 69 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 64004 steps (0 resets) in 19 ms. (3200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 100 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge based reduction with 15 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16551507303111705601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17859700968582402341.kers'
[2026-05-26 08:47:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16551507303111705601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17859700968582402341.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 24 cols 47 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:47:47] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17859700968582402341.kers
Total runtime 0 ms.
[2026-05-26 08:47:47] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-26 08:47:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-26 08:47:47] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 08:47:47] [INFO ] Added : 17 causal constraints over 4 iterations in 24 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 370 ms.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 08:47:48] [INFO ] Invariant cache hit.
[2026-05-26 08:47:48] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 08:47:48] [INFO ] Invariant cache hit.
[2026-05-26 08:47:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 08:47:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 30 constraints, problems are : Problem set: 0 solved, 17 unsolved in 221 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/41 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/42 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 47 constraints, problems are : Problem set: 0 solved, 17 unsolved in 195 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 419ms
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 24/24 places, 18/18 transitions.
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 64004 steps (0 resets) in 9 ms. (6400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 108 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2026-05-26 08:47:48] [INFO ] Invariant cache hit.
[2026-05-26 08:47:48] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 08:47:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-26 08:47:48] [INFO ] Computed and/alt/rep : 17/23/17 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-26 08:47:48] [INFO ] Added : 17 causal constraints over 4 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 303 ms.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7899 reset in 72 ms.
Product exploration explored 100000 steps with 7834 reset in 65 ms.
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10586433082958171108
[2026-05-26 08:47:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10586433082958171108
Running compilation step : cd /tmp/ltsmin10586433082958171108;'/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 70 ms.
Running link step : cd /tmp/ltsmin10586433082958171108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10586433082958171108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8326616491751028719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 08:48:04] [INFO ] Invariant cache hit.
[2026-05-26 08:48:04] [INFO ] Implicit Places using invariants in 28 ms returned [3, 9, 13]
[2026-05-26 08:48:04] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 0 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (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-16844547340520671616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9745267306274670150.kers'
[2026-05-26 08:48:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16844547340520671616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9745267306274670150.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 21 cols 41 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:48:04] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9745267306274670150.kers
Total runtime 0 ms.
[2026-05-26 08:48:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-26 08:48:04] [INFO ] Invariant cache hit.
[2026-05-26 08:48:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 21/24 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5325230893998919459
[2026-05-26 08:48:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5325230893998919459
Running compilation step : cd /tmp/ltsmin5325230893998919459;'/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 72 ms.
Running link step : cd /tmp/ltsmin5325230893998919459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5325230893998919459;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7523128651311072856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 08:48:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:48:19] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:48:19] [INFO ] Time to serialize gal into /tmp/LTL1578510518604151095.gal : 0 ms
[2026-05-26 08:48:19] [INFO ] Time to serialize properties into /tmp/LTL805922645410338176.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1578510518604151095.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15510957952433684682.hoa' '-atoms' '/tmp/LTL805922645410338176.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL805922645410338176.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15510957952433684682.hoa
Detected timeout of ITS tools.
[2026-05-26 08:48:34] [INFO ] Flatten gal took : 2 ms
[2026-05-26 08:48:34] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:48:34] [INFO ] Time to serialize gal into /tmp/LTL973645718293309484.gal : 0 ms
[2026-05-26 08:48:34] [INFO ] Time to serialize properties into /tmp/LTL11515389978851187351.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL973645718293309484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11515389978851187351.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((F(!("(((p12>=1)&&(p10>=1))&&((p13>=1)&&(p6>=1)))")))U(X(X("((p8>=1)&&(p9>=1))"))))&&(X((!("((p4>=1)&&(p15>=1))"))U((!("((p8>=1)&&...202
Formula 0 simplified : (G"(((p12>=1)&&(p10>=1))&&((p13>=1)&&(p6>=1)))" R XX!"((p8>=1)&&(p9>=1))") | X("((p4>=1)&&(p15>=1))" M "((p8>=1)&&(p9>=1))")
Detected timeout of ITS tools.
[2026-05-26 08:48:49] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:48:49] [INFO ] Applying decomposition
[2026-05-26 08:48:49] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9071837826782038845.txt' '-o' '/tmp/graph9071837826782038845.bin' '-w' '/tmp/graph9071837826782038845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9071837826782038845.bin' '-l' '-1' '-v' '-w' '/tmp/graph9071837826782038845.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:48:49] [INFO ] Decomposing Gal with order
[2026-05-26 08:48:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:48:49] [INFO ] Flatten gal took : 2 ms
[2026-05-26 08:48:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 08:48:49] [INFO ] Time to serialize gal into /tmp/LTL14074566471414043524.gal : 0 ms
[2026-05-26 08:48:49] [INFO ] Time to serialize properties into /tmp/LTL2297799184011717815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14074566471414043524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2297799184011717815.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F(!("(((i2.i1.u1.p12>=1)&&(i2.i0.u4.p10>=1))&&((i2.i0.u2.p13>=1)&&(i2.i1.u1.p6>=1)))")))U(X(X("((i2.i0.u4.p8>=1)&&(i2.i0.u2.p9>=1...286
Formula 0 simplified : (G"(((i2.i1.u1.p12>=1)&&(i2.i0.u4.p10>=1))&&((i2.i0.u2.p13>=1)&&(i2.i1.u1.p6>=1)))" R XX!"((i2.i0.u4.p8>=1)&&(i2.i0.u2.p9>=1))") | X...225
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-16000-LTLFireability-12 finished in 77467 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(G(p0))&&F(p1))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 24 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 21 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 16 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 15 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 13 transition count 8
Applied a total of 19 rules in 10193 ms. Remains 13 /26 variables (removed 13) and now considering 8/18 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17836653346991638344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11393051622507572711.kers'
[2026-05-26 08:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17836653346991638344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11393051622507572711.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 13 cols 23 entries
Finished phase 1 with 6 SingleSign rule and 2 generalized
[2026-05-26 08:49:14] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11393051622507572711.kers
Total runtime 0 ms.
[2026-05-26 08:49:14] [INFO ] Implicit Places using invariants in 32 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/26 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10227 ms. Remains : 11/26 places, 8/18 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 80 ms.
Product exploration explored 100000 steps with 0 reset in 100 ms.
Computed a total of 11 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 13 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 38 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-13 finished in 10578 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 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 5 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 2 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7810308100839872605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18286547435295198888.kers'
[2026-05-26 08:49:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7810308100839872605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18286547435295198888.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 4 cols 7 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-26 08:49:15] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18286547435295198888.kers
Total runtime 0 ms.
[2026-05-26 08:49:15] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-26 08:49:15] [INFO ] Invariant cache hit.
[2026-05-26 08:49:15] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-26 08:49:15] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-26 08:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 4/26 places, 4/18 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 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-14
Product exploration explored 100000 steps with 11882 reset in 58 ms.
Product exploration explored 100000 steps with 12605 reset in 62 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 9 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 35 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-14 finished in 355 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(X((F((G(F(p0))||(F(p0)&&X(p1)))) U (p2 U p3)))))'
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (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-10680430872770690272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16105220704188076094.kers'
[2026-05-26 08:49:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10680430872770690272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16105220704188076094.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:49:15] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16105220704188076094.kers
Total runtime 0 ms.
[2026-05-26 08:49:15] [INFO ] Implicit Places using invariants in 28 ms returned [3, 9, 13]
[2026-05-26 08:49:15] [INFO ] Actually due to overlaps returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (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-13857941142448082804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6956750251657301936.kers'
[2026-05-26 08:49:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13857941142448082804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6956750251657301936.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 43 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 08:49:15] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6956750251657301936.kers
Total runtime 0 ms.
[2026-05-26 08:49:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-26 08:49:15] [INFO ] Invariant cache hit.
[2026-05-26 08:49:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 23/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 23/26 places, 18/18 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(X((F((G(F(p0))||(F(p0)&&X(p1)))) U (p2 U p3)))))'
Stuttering acceptance computed with spot in 185 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-15
Product exploration explored 100000 steps with 18836 reset in 70 ms.
Product exploration explored 100000 steps with 18885 reset in 74 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 10 factoid took 52 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 64004 steps (0 resets) in 15 ms. (4000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1875 steps (0 resets) in 6 ms. (267 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 63 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p3), (NOT p3), (NOT p3)]
[2026-05-26 08:49:16] [INFO ] Invariant cache hit.
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 308 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-15 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-15 finished in 774 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(p0)||F(p1)||G(p2)))'
Spot run failed in 43 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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) U X(X((p1||X((!p2||X(p3))))))))'
Spot run failed in 42 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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) U X(X(p1)))&&X((!p2 U (!p1||G(!p2))))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 08:49:16] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18245203441291143199
[2026-05-26 08:49:16] [INFO ] Applying decomposition
[2026-05-26 08:49:16] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2026-05-26 08:49:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:49:16] [INFO ] Flatten gal took : 2 ms
[2026-05-26 08:49:16] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2026-05-26 08:49:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:49:16] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2026-05-26 08:49:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:49:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18245203441291143199
Running compilation step : cd /tmp/ltsmin18245203441291143199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3339221816666505616.txt' '-o' '/tmp/graph3339221816666505616.bin' '-w' '/tmp/graph3339221816666505616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3339221816666505616.bin' '-l' '-1' '-v' '-w' '/tmp/graph3339221816666505616.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:49:16] [INFO ] Decomposing Gal with order
[2026-05-26 08:49:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:49:16] [INFO ] Flatten gal took : 1 ms
[2026-05-26 08:49:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 08:49:16] [INFO ] Time to serialize gal into /tmp/LTLFireability12917457663466472936.gal : 1 ms
[2026-05-26 08:49:16] [INFO ] Time to serialize properties into /tmp/LTLFireability5782119276252156152.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12917457663466472936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5782119276252156152.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((((G("(i1.u2.p11>=1)"))||(F("((u9.p4>=1)&&(i1.u2.p15>=1))")))||(G("(((i1.u3.p12<1)||(i0.u4.p10<1))||(i0.u1.p13<1))"))))
Formula 0 simplified : F!"(i1.u2.p11>=1)" & G!"((u9.p4>=1)&&(i1.u2.p15>=1))" & F!"(((i1.u3.p12<1)||(i0.u4.p10<1))||(i0.u1.p13<1))"
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin18245203441291143199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin18245203441291143199;'/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' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18245203441291143199;'/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' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18245203441291143199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp3==true)) U X(X(((LTLAPp4==true)||X((!(LTLAPp5==true)||X((LTLAPp6==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18245203441291143199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp3==true)) U X(X(((LTLAPp4==true)||X((!(LTLAPp5==true)||X((LTLAPp6==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18245203441291143199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>(!(LTLAPp7==true)) U X(X((LTLAPp8==true))))&&X((!(LTLAPp1==true) U (!(LTLAPp8==true)||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18245203441291143199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>(!(LTLAPp7==true)) U X(X((LTLAPp8==true))))&&X((!(LTLAPp1==true) U (!(LTLAPp8==true)||[](!(LTLAPp1==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin18245203441291143199;'/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' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 09:10:43] [INFO ] Flatten gal took : 116 ms
[2026-05-26 09:10:43] [INFO ] Time to serialize gal into /tmp/LTLFireability185400606577509128.gal : 9 ms
[2026-05-26 09:10:43] [INFO ] Time to serialize properties into /tmp/LTLFireability9563629825923522108.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability185400606577509128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9563629825923522108.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 3 LTL properties
Checking formula 0 : !((((G("(p11>=1)"))||(F("((p4>=1)&&(p15>=1))")))||(G("(((p12<1)||(p10<1))||(p13<1))"))))
Formula 0 simplified : F!"(p11>=1)" & G!"((p4>=1)&&(p15>=1))" & F!"(((p12<1)||(p10<1))||(p13<1))"
ITS-tools command line returned an error code 137
[2026-05-26 09:32:09] [INFO ] Flatten gal took : 110 ms
[2026-05-26 09:32:09] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-26 09:32:10] [INFO ] Transformed 26 places.
[2026-05-26 09:32:10] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-26 09:32:10] [INFO ] Time to serialize gal into /tmp/LTLFireability14520588373484804935.gal : 4 ms
[2026-05-26 09:32:10] [INFO ] Time to serialize properties into /tmp/LTLFireability14110030285719566954.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14520588373484804935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14110030285719566954.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((G("(p11>=1)"))||(F("((p4>=1)&&(p15>=1))")))||(G("(((p12<1)||(p10<1))||(p13<1))"))))
Formula 0 simplified : F!"(p11>=1)" & G!"((p4>=1)&&(p15>=1))" & F!"(((p12<1)||(p10<1))||(p13<1))"

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="HouseConstruction-PT-16000"
export BK_EXAMINATION="LTLFireability"
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 HouseConstruction-PT-16000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074500916"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-16000.tgz
mv HouseConstruction-PT-16000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;