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-177961074500900.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-04000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074500900
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.8K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 16:48 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:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 10:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:55 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-04000-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-04000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779781446622

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-04000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 07:44:07] [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 07:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 07:44:07] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2026-05-26 07:44:07] [INFO ] Transformed 26 places.
[2026-05-26 07:44:07] [INFO ] Transformed 18 transitions.
[2026-05-26 07:44:07] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HouseConstruction-PT-04000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-04000-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 7 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-7901163539650638937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16932477841561266785.kers'
[2026-05-26 07:44:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7901163539650638937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16932477841561266785.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 07:44:08] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16932477841561266785.kers
Total runtime 1 ms.
[2026-05-26 07:44:08] [INFO ] Implicit Places using invariants in 149 ms returned [9, 13]
[2026-05-26 07:44:08] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/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 24 transition count 18
Applied a total of 1 rules in 3 ms. Remains 24 /25 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-14093217317770561823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17339731324801374389.kers'
[2026-05-26 07:44:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14093217317770561823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17339731324801374389.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 45 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 07:44:08] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17339731324801374389.kers
Total runtime 0 ms.
[2026-05-26 07:44:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-26 07:44:08] [INFO ] Invariant cache hit.
[2026-05-26 07:44:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 24/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 302 ms. Remains : 24/26 places, 18/18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 07:44:08] [INFO ] Invariant cache hit.
[2026-05-26 07:44:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-26 07:44:08] [INFO ] Invariant cache hit.
[2026-05-26 07:44:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 07:44:08] [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 372 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 285 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 676ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 687ms
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 24/24 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2026-05-26 07:44:09] [INFO ] Flatten gal took : 14 ms
[2026-05-26 07:44:09] [INFO ] Flatten gal took : 3 ms
[2026-05-26 07:44:09] [INFO ] Input system was already deterministic with 18 transitions.
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 48020 steps (8 resets) in 55 ms. (857 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 3/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 3959 steps (8 resets) in 23 ms. (164 steps per ms) remains 0/3 properties
FORMULA HouseConstruction-PT-04000-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HouseConstruction-PT-04000-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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).
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 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 27 edges and 24 vertex of which 12 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 11 transition count 6
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 8 transition count 6
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 8 transition count 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 14 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 3 transition count 2
Applied a total of 16 rules in 183 ms. Remains 3 /24 variables (removed 21) and now considering 2/18 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11096338749168875988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15538725829055812186.kers'
[2026-05-26 07:44:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11096338749168875988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15538725829055812186.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 3 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-26 07:44:09] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15538725829055812186.kers
Total runtime 0 ms.
[2026-05-26 07:44:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 07:44:09] [INFO ] Invariant cache hit.
[2026-05-26 07:44:10] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-26 07:44:10] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-26 07:44:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/5 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 3/3 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/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/5 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/24 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 3/24 places, 2/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 139 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-00
Product exploration explored 100000 steps with 12 reset in 192 ms.
Product exploration explored 100000 steps with 12 reset in 123 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 35 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 127 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLFireability-00 finished in 992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test 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 2 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-759362231478586387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4311356321027666684.kers'
[2026-05-26 07:44:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-759362231478586387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4311356321027666684.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 45 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 07:44:10] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4311356321027666684.kers
Total runtime 0 ms.
[2026-05-26 07:44:10] [INFO ] Implicit Places using invariants in 30 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 21/24 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(F(p0)))'
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 70 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 4 factoid took 15 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 52 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLFireability-01 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' '!(X((G(p1)&&p0)))'
Support contains 4 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 0 ms. Remains 24 /24 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-17542721600605961684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1829536075135924623.kers'
[2026-05-26 07:44:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17542721600605961684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1829536075135924623.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 45 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 07:44:11] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1829536075135924623.kers
Total runtime 0 ms.
[2026-05-26 07:44:11] [INFO ] Implicit Places using invariants in 28 ms returned [3, 18]
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 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 22/24 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((G(p1)&&p0)))'
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-LTLFireability-03 finished in 239 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((F(p1)&&F(p2)&&p0))&&X(F(p3))))'
Support contains 7 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test 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-13873455074162915967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13488970993660109479.kers'
[2026-05-26 07:44:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13873455074162915967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13488970993660109479.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 45 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 07:44:11] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13488970993660109479.kers
Total runtime 0 ms.
[2026-05-26 07:44:11] [INFO ] Implicit Places using invariants in 30 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 22/24 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((F(p1)&&F(p2)&&p0))&&X(F(p3))))'
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-05
Product exploration explored 100000 steps with 2092 reset in 127 ms.
Product exploration explored 100000 steps with 2081 reset in 129 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)...)
Knowledge based reduction with 17 factoid took 788 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 13 states, 34 edges and 4 AP (stutter insensitive).
RANDOM walk for 48020 steps (8 resets) in 34 ms. (1372 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6258116243518686185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14787915257882172112.kers'
[2026-05-26 07:44:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6258116243518686185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14787915257882172112.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 07:44:12] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14787915257882172112.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/40 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 114 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 17/37 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/40 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 5 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 5 unsolved
Finished Parikh walk after 282019 steps, including 34 resets, run visited all 1 properties in 164 ms. (steps per millisecond=1719 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 1370 ms.
Knowledge based reduction with 17 factoid took 284 ms. Reduced automaton from 13 states, 34 edges and 4 AP (stutter insensitive) to 17 states, 48 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 764 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 p3), (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 p1 (NOT p2) p3), false, false, false, false, false, false]
[2026-05-26 07:44:15] [INFO ] Invariant cache hit.
[2026-05-26 07:44:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 07:44:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 07:44:15] [INFO ] Added : 17 causal constraints over 4 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
[2026-05-26 07:44:15] [INFO ] Invariant cache hit.
[2026-05-26 07:44:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-26 07:44:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 07:44:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 07:44:15] [INFO ] Added : 17 causal constraints over 4 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
[2026-05-26 07:44:15] [INFO ] Invariant cache hit.
[2026-05-26 07:44:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-26 07:44:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 07:44:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 0 ms returned sat
[2026-05-26 07:44:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-26 07:44:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 07:44:15] [INFO ] Added : 17 causal constraints over 4 iterations in 14 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 4024 ms.
Stuttering acceptance computed with spot in 743 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 p3), (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 p1 (NOT p2) p3), false, false, false, false, false, false]
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 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 12 place count 16 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 16 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 13 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 11 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 23 place count 10 transition count 7
Applied a total of 23 rules in 7 ms. Remains 10 /22 variables (removed 12) and now considering 7/18 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7671072684851628037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1244746278988293990.kers'
[2026-05-26 07:44:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7671072684851628037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1244746278988293990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 10 cols 19 entries
Finished phase 1 with 6 SingleSign rule and 1 generalized
[2026-05-26 07:44:16] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1244746278988293990.kers
Total runtime 0 ms.
[2026-05-26 07:44:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-26 07:44:16] [INFO ] Invariant cache hit.
[2026-05-26 07:44:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-26 07:44:16] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-26 07:44:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/17 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 10/10 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/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/17 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 10/22 places, 7/18 transitions.
Computed a total of 10 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 7
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 39 factoid took 130 ms. Reduced automaton from 17 states, 48 edges and 4 AP (stutter insensitive) to 17 states, 48 edges and 4 AP (stutter insensitive).
RANDOM walk for 48020 steps (8 resets) in 68 ms. (695 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 7/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 7/7 properties
[2026-05-26 07:44:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 7/17 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 69 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 10/10 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/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 7/17 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 106 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 191371 steps, including 46 resets, run visited all 2 properties in 399 ms. (steps per millisecond=479 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 4505 ms.
Knowledge based reduction with 39 factoid took 426 ms. Reduced automaton from 17 states, 48 edges and 4 AP (stutter insensitive) to 17 states, 48 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 745 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 p3), (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 p1 (NOT p2) p3), false, false, false, false, false, false]
[2026-05-26 07:44:22] [INFO ] Invariant cache hit.
[2026-05-26 07:44:22] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 07:44:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 07:44:22] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
[2026-05-26 07:44:22] [INFO ] Invariant cache hit.
[2026-05-26 07:44:22] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-26 07:44:22] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 07:44:22] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
[2026-05-26 07:44:22] [INFO ] Invariant cache hit.
[2026-05-26 07:44:23] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-26 07:44:23] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-26 07:44:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 07:44:23] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:23] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-26 07:44:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-26 07:44:23] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 6208 ms.
Stuttering acceptance computed with spot in 801 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 p3), (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 p1 (NOT p2) p3), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 808 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), (AND p0 (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p2) p3), (AND p0 (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 p3), (AND p0 p1 (NOT p2) (NOT p3)), (AND p0 p1 (NOT p2) p3), false, false, false, false, false, false]
Product exploration explored 100000 steps with 9870 reset in 91 ms.
Product exploration explored 100000 steps with 9835 reset in 90 ms.
Built C files in :
/tmp/ltsmin132294515854060476
[2026-05-26 07:44:24] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2026-05-26 07:44:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 07:44:24] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2026-05-26 07:44:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 07:44:24] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2026-05-26 07:44:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 07:44:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin132294515854060476
Running compilation step : cd /tmp/ltsmin132294515854060476;'/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 179 ms.
Running link step : cd /tmp/ltsmin132294515854060476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin132294515854060476;'/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/stateBased17098306182233714199.hoa' '--buchi-type=spotba'
LTSmin run took 111 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-04000-LTLFireability-05 finished in 13956 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||G(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 18 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 14 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 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 3 with 2 rules applied. Total rules applied 19 place count 12 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 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 22 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 9 transition count 6
Applied a total of 23 rules in 588 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6246309633191578715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1954593133379263258.kers'
[2026-05-26 07:44:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6246309633191578715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1954593133379263258.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 9 cols 15 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-26 07:44:25] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1954593133379263258.kers
Total runtime 0 ms.
[2026-05-26 07:44:25] [INFO ] Implicit Places using invariants in 24 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 615 ms. Remains : 8/24 places, 6/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)||p1))))'
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-06
Product exploration explored 100000 steps with 6934 reset in 77 ms.
Product exploration explored 100000 steps with 6853 reset in 78 ms.
Computed a total of 8 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 6
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 5 factoid took 16 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 45 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLFireability-06 finished in 913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F((G(p0)||(p0&&F((G(F(p1))||(p2&&F(p1))))))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test 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 2 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-1411693228041600301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15975486886449330865.kers'
[2026-05-26 07:44:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1411693228041600301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15975486886449330865.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 45 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 07:44:26] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15975486886449330865.kers
Total runtime 0 ms.
[2026-05-26 07:44:26] [INFO ] Implicit Places using invariants in 63 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 64 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 21/24 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((p0&&X(X(F((G(p0)||(p0&&F((G(F(p1))||(p2&&F(p1))))))))))))'
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-07
Product exploration explored 100000 steps with 846 reset in 124 ms.
Product exploration explored 100000 steps with 1240 reset in 180 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 5 factoid took 14 ms. Proved property starting from automaton with 7 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 42 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLFireability-07 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(F(p1))&&G(p2))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test 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 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2026-05-26 07:44:26] [INFO ] Invariant cache hit.
[2026-05-26 07:44:26] [INFO ] Implicit Places using invariants in 23 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 21/24 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(p0)||(X(F(p1))&&G(p2))))'
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-LTLFireability-08 finished in 296 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(G((X(p0)||(!p1&&X(X(p2)))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test 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.
[2026-05-26 07:44:27] [INFO ] Invariant cache hit.
[2026-05-26 07:44:27] [INFO ] Implicit Places using invariants in 22 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 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.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 21/24 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(G((X(p0)||(p1&&X(X(p2)))))))'
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-04000-LTLFireability-13 finished in 267 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(X(F(p0)))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test 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.
[2026-05-26 07:44:27] [INFO ] Invariant cache hit.
[2026-05-26 07:44:27] [INFO ] Implicit Places using invariants in 24 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 21/24 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(X(F(p0)))))'
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-14
Product exploration explored 100000 steps with 2165 reset in 90 ms.
Product exploration explored 100000 steps with 2178 reset in 101 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 2 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 48020 steps (8 resets) in 27 ms. (1715 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1333 steps (0 resets) in 7 ms. (166 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2583063117887926528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15256134232682585839.kers'
[2026-05-26 07:44:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2583063117887926528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15256134232682585839.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 07:44:28] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15256134232682585839.kers
Total runtime 1 ms.
[2026-05-26 07:44:28] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-26 07:44:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-26 07:44:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 07:44:28] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-26 07:44:28] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 07:44:28] [INFO ] Added : 17 causal constraints over 4 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 404 ms.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 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 07:44:28] [INFO ] Invariant cache hit.
[2026-05-26 07:44:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-26 07:44:28] [INFO ] Invariant cache hit.
[2026-05-26 07:44:28] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 07:44:28] [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 191 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 163 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 356ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 357ms
Finished structural reductions in LTL mode , in 1 iterations and 419 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 2 factoid took 57 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 48020 steps (8 resets) in 9 ms. (4802 steps per ms) remains 1/1 properties
BEST_FIRST walk for 962 steps (0 resets) in 4 ms. (192 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2026-05-26 07:44:29] [INFO ] Invariant cache hit.
[2026-05-26 07:44:29] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-26 07:44:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 07:44:29] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 07:44:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-26 07:44:29] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-26 07:44:29] [INFO ] Added : 17 causal constraints over 4 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 402 ms.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2145 reset in 93 ms.
Product exploration explored 100000 steps with 2149 reset in 96 ms.
Spot run failed in 72 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/ltsmin3664479735556295954
[2026-05-26 07:44:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3664479735556295954
Running compilation step : cd /tmp/ltsmin3664479735556295954;'/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/ltsmin3664479735556295954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3664479735556295954;'/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/stateBased16268905890626842433.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 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 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 07:44:44] [INFO ] Invariant cache hit.
[2026-05-26 07:44:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-26 07:44:44] [INFO ] Invariant cache hit.
[2026-05-26 07:44:44] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin6936472039799339918
[2026-05-26 07:44:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6936472039799339918
Running compilation step : cd /tmp/ltsmin6936472039799339918;'/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 92 ms.
Running link step : cd /tmp/ltsmin6936472039799339918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6936472039799339918;'/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/stateBased4303367006280285310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 07:45:00] [INFO ] Flatten gal took : 4 ms
[2026-05-26 07:45:00] [INFO ] Flatten gal took : 3 ms
[2026-05-26 07:45:00] [INFO ] Time to serialize gal into /tmp/LTL443258330041171012.gal : 1 ms
[2026-05-26 07:45:00] [INFO ] Time to serialize properties into /tmp/LTL748998361451968596.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/LTL443258330041171012.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4184621291351526047.hoa' '-atoms' '/tmp/LTL748998361451968596.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...315
Loading property file /tmp/LTL748998361451968596.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4184621291351526047.hoa
Detected timeout of ITS tools.
[2026-05-26 07:45:15] [INFO ] Flatten gal took : 2 ms
[2026-05-26 07:45:15] [INFO ] Flatten gal took : 2 ms
[2026-05-26 07:45:15] [INFO ] Time to serialize gal into /tmp/LTL7802540290128596421.gal : 1 ms
[2026-05-26 07:45:15] [INFO ] Time to serialize properties into /tmp/LTL2481013512290988566.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/LTL7802540290128596421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2481013512290988566.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 : !((X(X(X(F("(p22>=1)"))))))
Formula 0 simplified : XXXG!"(p22>=1)"
Detected timeout of ITS tools.
[2026-05-26 07:45:30] [INFO ] Flatten gal took : 8 ms
[2026-05-26 07:45:30] [INFO ] Applying decomposition
[2026-05-26 07:45:30] [INFO ] Flatten gal took : 2 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/graph5210080584545890619.txt' '-o' '/tmp/graph5210080584545890619.bin' '-w' '/tmp/graph5210080584545890619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5210080584545890619.bin' '-l' '-1' '-v' '-w' '/tmp/graph5210080584545890619.weights' '-q' '0' '-e' '0.001'
[2026-05-26 07:45:30] [INFO ] Decomposing Gal with order
[2026-05-26 07:45:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 07:45:30] [INFO ] Flatten gal took : 47 ms
[2026-05-26 07:45:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-26 07:45:30] [INFO ] Time to serialize gal into /tmp/LTL15013185295271882017.gal : 1 ms
[2026-05-26 07:45:30] [INFO ] Time to serialize properties into /tmp/LTL17746901205502633259.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/LTL15013185295271882017.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17746901205502633259.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(u5.p22>=1)"))))))
Formula 0 simplified : XXXG!"(u5.p22>=1)"
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-04000-LTLFireability-14 finished in 77839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(!p0))) U (p0||F(!p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test 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-8267281256532792691.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13086167572259463263.kers'
[2026-05-26 07:45:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8267281256532792691.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13086167572259463263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 23 cols 45 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 07:45:45] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13086167572259463263.kers
Total runtime 0 ms.
[2026-05-26 07:45:45] [INFO ] Implicit Places using invariants in 40 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 22/24 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((X(X(X(!p0))) U (p0||F(!p1)))))'
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) p1), p1, (AND p0 p1), (AND p1 p0), p1]
Running random walk in product with property : HouseConstruction-PT-04000-LTLFireability-15
Product exploration explored 100000 steps with 2734 reset in 97 ms.
Product exploration explored 100000 steps with 2530 reset in 112 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 9 factoid took 11 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 39 ms.
FORMULA HouseConstruction-PT-04000-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-04000-LTLFireability-15 finished in 562 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(X(F(p0)))))'
Spot run failed in 40 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 07:45:45] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7442648612525317010
[2026-05-26 07:45:45] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2026-05-26 07:45:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 07:45:45] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2026-05-26 07:45:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 07:45:45] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2026-05-26 07:45:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 07:45:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7442648612525317010
Running compilation step : cd /tmp/ltsmin7442648612525317010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-26 07:45:45] [INFO ] Applying decomposition
[2026-05-26 07:45:45] [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/graph16861524014638942602.txt' '-o' '/tmp/graph16861524014638942602.bin' '-w' '/tmp/graph16861524014638942602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16861524014638942602.bin' '-l' '-1' '-v' '-w' '/tmp/graph16861524014638942602.weights' '-q' '0' '-e' '0.001'
[2026-05-26 07:45:45] [INFO ] Decomposing Gal with order
[2026-05-26 07:45:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 07:45:45] [INFO ] Flatten gal took : 3 ms
[2026-05-26 07:45:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 07:45:45] [INFO ] Time to serialize gal into /tmp/LTLFireability3514984731700024854.gal : 0 ms
[2026-05-26 07:45:45] [INFO ] Time to serialize properties into /tmp/LTLFireability10884214614730308893.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/LTLFireability3514984731700024854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10884214614730308893.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 1 LTL properties
Checking formula 0 : !((X(X(X(F("(u5.p22>=1)"))))))
Formula 0 simplified : XXXG!"(u5.p22>=1)"
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin7442648612525317010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7442648612525317010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 08:06:18] [INFO ] Flatten gal took : 4 ms
[2026-05-26 08:06:18] [INFO ] Time to serialize gal into /tmp/LTLFireability3560493685835970465.gal : 1 ms
[2026-05-26 08:06:18] [INFO ] Time to serialize properties into /tmp/LTLFireability13404341560196640744.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/LTLFireability3560493685835970465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13404341560196640744.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...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p22>=1)"))))))
Formula 0 simplified : XXXG!"(p22>=1)"
Detected timeout of ITS tools.
[2026-05-26 08:26:52] [INFO ] Flatten gal took : 230 ms
[2026-05-26 08:26:52] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-26 08:26:52] [INFO ] Transformed 24 places.
[2026-05-26 08:26:52] [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 08:26:53] [INFO ] Time to serialize gal into /tmp/LTLFireability14628487921169706043.gal : 6 ms
[2026-05-26 08:26:53] [INFO ] Time to serialize properties into /tmp/LTLFireability3646680106289401332.ltl : 7 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/LTLFireability14628487921169706043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3646680106289401332.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(F("(p22>=1)"))))))
Formula 0 simplified : XXXG!"(p22>=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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-04000"
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-04000, 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-177961074500900"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-04000.tgz
mv HouseConstruction-PT-04000 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 ;