About the Execution of ITS-Tools for HouseConstruction-PT-00010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16123.388 | 3600000.00 | 7156813.00 | 18846.60 | FFFFFFF?FFTTFFFT | normal |
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-177961074400835.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-00010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400835
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.7K Mar 7 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:53 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-00010-LTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779766876275
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 03:41:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 03:41:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 03:41:17] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2026-05-26 03:41:17] [INFO ] Transformed 26 places.
[2026-05-26 03:41:17] [INFO ] Transformed 18 transitions.
[2026-05-26 03:41:17] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HouseConstruction-PT-00010-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00010-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 16 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-11091870992169845149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14440408209112011894.kers'
[2026-05-26 03:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11091870992169845149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14440408209112011894.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 03:41:17] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14440408209112011894.kers
Total runtime 1 ms.
[2026-05-26 03:41:17] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 03:41:17] [INFO ] Invariant cache hit.
[2026-05-26 03:41:17] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 03:41:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/44 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 391 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/44 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/44 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 51 constraints, problems are : Problem set: 0 solved, 17 unsolved in 322 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 743ms
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 26/26 places, 18/18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2026-05-26 03:41:18] [INFO ] Invariant cache hit.
[2026-05-26 03:41:18] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 03:41:18] [INFO ] Invariant cache hit.
[2026-05-26 03:41:18] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 23 out of 26 places after structural reductions.
[2026-05-26 03:41:18] [INFO ] Flatten gal took : 17 ms
[2026-05-26 03:41:18] [INFO ] Flatten gal took : 4 ms
[2026-05-26 03:41:18] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 861 steps (1 resets) in 35 ms. (23 steps per ms) remains 0/35 properties
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(p1)))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 6 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9444912021840725878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9764822370867071632.kers'
[2026-05-26 03:41:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9444912021840725878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9764822370867071632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:41:19] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9764822370867071632.kers
Total runtime 0 ms.
[2026-05-26 03:41:19] [INFO ] Implicit Places using invariants in 31 ms returned [3, 9, 13, 19]
[2026-05-26 03:41:19] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10470089697200171688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12303564932460083055.kers'
[2026-05-26 03:41:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10470089697200171688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12303564932460083055.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 03:41:19] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12303564932460083055.kers
Total runtime 0 ms.
[2026-05-26 03:41:19] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-26 03:41:19] [INFO ] Invariant cache hit.
[2026-05-26 03:41:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 21/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(p1)))))'
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-00 finished in 436 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(G((p0&&X((p1&&G(p2))))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17965066722123529677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4012635083378461470.kers'
[2026-05-26 03:41:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17965066722123529677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4012635083378461470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:41:19] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4012635083378461470.kers
Total runtime 0 ms.
[2026-05-26 03:41:19] [INFO ] Implicit Places using invariants in 27 ms returned [9, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 23/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X((p1&&G(p2))))))))'
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-01 finished in 224 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)&&F(p1))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 10 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 5
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 0 with 2 rules applied. Total rules applied 5 place count 7 transition count 4
Applied a total of 5 rules in 16 ms. Remains 7 /26 variables (removed 19) and now considering 4/18 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11868991244026669871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10169195720800195855.kers'
[2026-05-26 03:41:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11868991244026669871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10169195720800195855.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 7 cols 13 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-26 03:41:20] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10169195720800195855.kers
Total runtime 0 ms.
[2026-05-26 03:41:20] [INFO ] Implicit Places using invariants in 17 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35 ms. Remains : 5/26 places, 4/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-05
Stuttering criterion allowed to conclude after 363 steps with 41 reset in 6 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-05 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0&&G(p1))) U (X(p2)&&(p0||F(p1)))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12601162148878176975.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5904113969788249029.kers'
[2026-05-26 03:41:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12601162148878176975.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5904113969788249029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:41:20] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5904113969788249029.kers
Total runtime 0 ms.
[2026-05-26 03:41:20] [INFO ] Implicit Places using invariants in 28 ms returned [3, 9, 13, 19]
[2026-05-26 03:41:20] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18014353089267728092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12243170625422687802.kers'
[2026-05-26 03:41:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18014353089267728092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12243170625422687802.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 03:41:20] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12243170625422687802.kers
Total runtime 0 ms.
[2026-05-26 03:41:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-26 03:41:20] [INFO ] Invariant cache hit.
[2026-05-26 03:41:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 21/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p0&&G(p1))) U (X(p2)&&(p0||F(p1)))))))'
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-06
Stuttering criterion allowed to conclude after 180 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-06 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((G(p1) U G(p2))||X(G(p3)))))'
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4645950545183663156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1878583432418293946.kers'
[2026-05-26 03:41:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4645950545183663156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1878583432418293946.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:41:20] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1878583432418293946.kers
Total runtime 0 ms.
[2026-05-26 03:41:20] [INFO ] Implicit Places using invariants in 30 ms returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
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 34 ms. Remains : 22/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((G(p1) U G(p2))||X(G(p3)))))'
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) p2 (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-07
Product exploration explored 100000 steps with 6941 reset in 284 ms.
Product exploration explored 100000 steps with 6947 reset in 213 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 56 factoid took 204 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
RANDOM walk for 39658 steps (198 resets) in 199 ms. (198 steps per ms) remains 0/27 properties
Knowledge based reduction with 56 factoid took 1068 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1720 ms.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-651460189600361626.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7755207742277826777.kers'
[2026-05-26 03:41:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-651460189600361626.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7755207742277826777.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 03:41:23] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7755207742277826777.kers
Total runtime 0 ms.
[2026-05-26 03:41:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-26 03:41:23] [INFO ] Invariant cache hit.
[2026-05-26 03:41:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-26 03:41:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 26 constraints, problems are : Problem set: 0 solved, 17 unsolved in 271 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 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/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 17 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 539ms
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 22/22 places, 18/18 transitions.
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 56 factoid took 194 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
RANDOM walk for 40020 steps (200 resets) in 86 ms. (460 steps per ms) remains 1/27 properties
BEST_FIRST walk for 907 steps (0 resets) in 5 ms. (151 steps per ms) remains 0/1 properties
Knowledge based reduction with 56 factoid took 1087 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter sensitive) to 9 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1669 ms.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7055 reset in 145 ms.
Product exploration explored 100000 steps with 7094 reset in 146 ms.
Spot run failed in 74 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/ltsmin11550357964534363557
[2026-05-26 03:41:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11550357964534363557
Running compilation step : cd /tmp/ltsmin11550357964534363557;'/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 175 ms.
Running link step : cd /tmp/ltsmin11550357964534363557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11550357964534363557;'/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/stateBased12210857767411652507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
[2026-05-26 03:41:42] [INFO ] Invariant cache hit.
[2026-05-26 03:41:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-26 03:41:42] [INFO ] Invariant cache hit.
[2026-05-26 03:41:42] [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.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin13891882775551540278
[2026-05-26 03:41:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13891882775551540278
Running compilation step : cd /tmp/ltsmin13891882775551540278;'/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 82 ms.
Running link step : cd /tmp/ltsmin13891882775551540278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13891882775551540278;'/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/stateBased17570669017660555365.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 03:41:57] [INFO ] Flatten gal took : 3 ms
[2026-05-26 03:41:57] [INFO ] Flatten gal took : 3 ms
[2026-05-26 03:41:57] [INFO ] Time to serialize gal into /tmp/LTL3138815744447020999.gal : 1 ms
[2026-05-26 03:41:57] [INFO ] Time to serialize properties into /tmp/LTL13510625774972964954.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3138815744447020999.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8554654399333329640.hoa' '-atoms' '/tmp/LTL13510625774972964954.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...318
Loading property file /tmp/LTL13510625774972964954.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8554654399333329640.hoa
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 03:42:12] [INFO ] Flatten gal took : 3 ms
[2026-05-26 03:42:12] [INFO ] Flatten gal took : 2 ms
[2026-05-26 03:42:12] [INFO ] Time to serialize gal into /tmp/LTL15095599622290654886.gal : 1 ms
[2026-05-26 03:42:12] [INFO ] Time to serialize properties into /tmp/LTL229466223521710395.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/LTL15095599622290654886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL229466223521710395.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(p13<=p25)"))U(((G("(p15>=2)"))U(G("(p9>p18)")))||(X(G("(p14<=p7)"))))))
Formula 0 simplified : G!"(p13<=p25)" R ((F!"(p15>=2)" R F!"(p9>p18)") & XF!"(p14<=p7)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 03:42:27] [INFO ] Flatten gal took : 1 ms
[2026-05-26 03:42:27] [INFO ] Applying decomposition
[2026-05-26 03:42:27] [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/graph4475523412598441015.txt' '-o' '/tmp/graph4475523412598441015.bin' '-w' '/tmp/graph4475523412598441015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4475523412598441015.bin' '-l' '-1' '-v' '-w' '/tmp/graph4475523412598441015.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:42:27] [INFO ] Decomposing Gal with order
[2026-05-26 03:42:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:42:27] [INFO ] Flatten gal took : 43 ms
[2026-05-26 03:42:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-26 03:42:27] [INFO ] Time to serialize gal into /tmp/LTL16236610631579631994.gal : 0 ms
[2026-05-26 03:42:27] [INFO ] Time to serialize properties into /tmp/LTL13399935787482280094.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/LTL16236610631579631994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13399935787482280094.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...277
Read 1 LTL properties
Checking formula 0 : !(((F("(gu7.p13<=gu7.p25)"))U(((G("(gu2.p15>=2)"))U(G("(gu4.p9>gu4.p18)")))||(X(G("(gu5.p14<=gu5.p7)"))))))
Formula 0 simplified : G!"(gu7.p13<=gu7.p25)" R ((F!"(gu2.p15>=2)" R F!"(gu4.p9>gu4.p18)") & XF!"(gu5.p14<=gu5.p7)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-00010-LTLCardinality-07 finished in 81807 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 U (p1&&G(p2)))||F(p3))) U ((!p2&&X(((p0 U (p1&&G(p2)))||F(p3))))||X(G(((p0 U (p1&&G(p2)))||F(p3)))))))'
Support contains 8 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6765253567359376233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16337364874162429398.kers'
[2026-05-26 03:42:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6765253567359376233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16337364874162429398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:42:42] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16337364874162429398.kers
Total runtime 0 ms.
[2026-05-26 03:42:42] [INFO ] Implicit Places using invariants in 49 ms returned [3, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 23/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U (p1&&G(p2)))||F(p3))) U (X(G(((p0 U (p1&&G(p2)))||F(p3))))||(!p2&&X(((p0 U (p1&&G(p2)))||F(p3)))))))'
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-08
Product exploration explored 100000 steps with 9659 reset in 80 ms.
Product exploration explored 100000 steps with 9515 reset in 83 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 33 factoid took 119 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
RANDOM walk for 40020 steps (200 resets) in 62 ms. (635 steps per ms) remains 1/17 properties
BEST_FIRST walk for 737 steps (0 resets) in 7 ms. (92 steps per ms) remains 0/1 properties
Knowledge based reduction with 33 factoid took 849 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge-based reduction took 1263 ms.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Support contains 8 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 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-7379494154387656964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9639678739944487440.kers'
[2026-05-26 03:42:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7379494154387656964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9639678739944487440.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 03:42:44] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9639678739944487440.kers
Total runtime 0 ms.
[2026-05-26 03:42:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-26 03:42:44] [INFO ] Invariant cache hit.
[2026-05-26 03:42:44] [INFO ] Implicit Places using invariants and state equation in 25 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 03:42:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/41 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 218 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 23/23 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/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 236 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 457ms
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 23/23 places, 18/18 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 33 factoid took 177 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
RANDOM walk for 36240 steps (181 resets) in 40 ms. (883 steps per ms) remains 0/17 properties
Knowledge based reduction with 33 factoid took 870 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge-based reduction took 1341 ms.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 9625 reset in 76 ms.
Product exploration explored 100000 steps with 9615 reset in 80 ms.
Spot run failed in 45 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/ltsmin15730041563152048598
[2026-05-26 03:42:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15730041563152048598
Running compilation step : cd /tmp/ltsmin15730041563152048598;'/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 89 ms.
Running link step : cd /tmp/ltsmin15730041563152048598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15730041563152048598;'/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/stateBased5527226324564898726.hoa' '--buchi-type=spotba'
LTSmin run took 352 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00010-LTLCardinality-08 finished in 5043 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(G(X((!(p0 U p1)&&p2))))||(p0 U p3))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16268243747985457188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15752409588561820522.kers'
[2026-05-26 03:42:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16268243747985457188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15752409588561820522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:42:47] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15752409588561820522.kers
Total runtime 0 ms.
[2026-05-26 03:42:47] [INFO ] Implicit Places using invariants in 29 ms returned [3, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 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 31 ms. Remains : 22/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X((!(p0 U p1)&&p2))))||(p0 U p3))))'
Stuttering acceptance computed with spot in 270 ms :[true, (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (NOT p2) p1), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (NOT p3), (OR (NOT p2) p1), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-09 finished in 334 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 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 14 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 13 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 7 transition count 6
Applied a total of 10 rules in 3 ms. Remains 7 /26 variables (removed 19) 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-1381971673653698514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14533490106734323962.kers'
[2026-05-26 03:42:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1381971673653698514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14533490106734323962.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 6 rows 6 cols 11 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-26 03:42:48] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14533490106734323962.kers
Total runtime 0 ms.
[2026-05-26 03:42:48] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-26 03:42:48] [INFO ] Invariant cache hit.
[2026-05-26 03:42:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2026-05-26 03:42:48] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-26 03:42:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 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/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/13 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/26 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 7/26 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((p0||G(p1)))))'
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-10
Product exploration explored 100000 steps with 2113 reset in 68 ms.
Product exploration explored 100000 steps with 2087 reset in 74 ms.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 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)...)
Knowledge based reduction with 11 factoid took 53 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 180 steps (0 resets) in 4 ms. (36 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 246 ms.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2026-05-26 03:42:48] [INFO ] Invariant cache hit.
[2026-05-26 03:42:48] [INFO ] Implicit Places using invariants in 12 ms returned []
[2026-05-26 03:42:48] [INFO ] Invariant cache hit.
[2026-05-26 03:42:48] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2026-05-26 03:42:48] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 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)...)
Knowledge based reduction with 11 factoid took 42 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 180 steps (0 resets) in 5 ms. (30 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 235 ms.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2106 reset in 70 ms.
Product exploration explored 100000 steps with 2070 reset in 61 ms.
Built C files in :
/tmp/ltsmin12147609063814725076
[2026-05-26 03:42:49] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2026-05-26 03:42:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:49] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2026-05-26 03:42:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:49] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2026-05-26 03:42:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:49] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12147609063814725076
Running compilation step : cd /tmp/ltsmin12147609063814725076;'/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 61 ms.
Running link step : cd /tmp/ltsmin12147609063814725076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12147609063814725076;'/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/stateBased11864063899511706582.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00010-LTLCardinality-10 finished in 1444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G((G(p1)||F(p0)))||((G(p1)||F(p0))&&(p2 U (p3||G(p2)))))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 23 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 21 transition count 14
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 21 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 21 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 21 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 23 place count 12 transition count 8
Applied a total of 23 rules in 6 ms. Remains 12 /26 variables (removed 14) and now considering 8/18 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8850869030572390410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8851897860502038483.kers'
[2026-05-26 03:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8850869030572390410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8851897860502038483.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 12 cols 23 entries
Finished phase 1 with 6 SingleSign rule and 2 generalized
[2026-05-26 03:42:49] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8851897860502038483.kers
Total runtime 0 ms.
[2026-05-26 03:42:49] [INFO ] Implicit Places using invariants in 26 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/26 places, 8/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33 ms. Remains : 10/26 places, 8/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G((G(p1)||F(p0)))||((p2 U (p3||G(p2)))&&(G(p1)||F(p0))))))'
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) p1)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-11
Product exploration explored 100000 steps with 2210 reset in 107 ms.
Product exploration explored 100000 steps with 2214 reset in 119 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 29 factoid took 104 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40004 steps (448 resets) in 37 ms. (1052 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40003 steps (88 resets) in 156 ms. (254 steps per ms) remains 2/4 properties
BEST_FIRST walk for 2905 steps (7 resets) in 5 ms. (484 steps per ms) remains 0/2 properties
Knowledge based reduction with 29 factoid took 577 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) p1)]
Knowledge-based reduction took 1010 ms.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) p1)]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (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-17314538342609310174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1323569641496567593.kers'
[2026-05-26 03:42:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17314538342609310174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1323569641496567593.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 10 cols 19 entries
Finished phase 1 with 7 SingleSign rule and 1 generalized
[2026-05-26 03:42:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1323569641496567593.kers
Total runtime 0 ms.
[2026-05-26 03:42:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-26 03:42:51] [INFO ] Invariant cache hit.
[2026-05-26 03:42:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-26 03:42:51] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-26 03:42:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/17 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 12 constraints, problems are : Problem set: 0 solved, 7 unsolved in 77 ms.
Refiners :[Generalized P Invariants (flows): 2/2 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/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 8/17 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 7 unsolved in 64 ms.
Refiners :[Generalized P Invariants (flows): 2/2 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 142ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 29 factoid took 88 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40007 steps (448 resets) in 36 ms. (1081 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40003 steps (89 resets) in 65 ms. (606 steps per ms) remains 2/4 properties
BEST_FIRST walk for 2223 steps (5 resets) in 5 ms. (370 steps per ms) remains 0/2 properties
Knowledge based reduction with 29 factoid took 582 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) p1)]
Knowledge-based reduction took 921 ms.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) p1)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) p1)]
Product exploration explored 100000 steps with 2198 reset in 99 ms.
Product exploration explored 100000 steps with 2224 reset in 102 ms.
Built C files in :
/tmp/ltsmin1389817330966563175
[2026-05-26 03:42:52] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2026-05-26 03:42:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:52] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2026-05-26 03:42:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:52] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2026-05-26 03:42:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1389817330966563175
Running compilation step : cd /tmp/ltsmin1389817330966563175;'/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 75 ms.
Running link step : cd /tmp/ltsmin1389817330966563175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1389817330966563175;'/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/stateBased7709999582706122114.hoa' '--buchi-type=spotba'
LTSmin run took 3056 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HouseConstruction-PT-00010-LTLCardinality-11 finished in 6586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 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 16 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 13 transition count 9
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 13 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 7 transition count 6
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 7 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 3 with 7 rules applied. Total rules applied 23 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 3 transition count 2
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 25 place count 2 transition count 2
Applied a total of 25 rules in 7 ms. Remains 2 /26 variables (removed 24) 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-3694146083054895723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14946604812308450360.kers'
[2026-05-26 03:42:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3694146083054895723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14946604812308450360.kers]
Culled 0 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 03:42:56] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14946604812308450360.kers
Total runtime 0 ms.
[2026-05-26 03:42:56] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-26 03:42:56] [INFO ] Invariant cache hit.
[2026-05-26 03:42:56] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2026-05-26 03:42:56] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-26 03:42:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 51ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/26 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 2/26 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 26 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-12
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-12 finished in 146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 24 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 20 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 20 transition count 9
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 19 place count 13 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 19 place count 13 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 10 transition count 6
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 26 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 7 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 6 transition count 4
Applied a total of 30 rules in 10 ms. Remains 6 /26 variables (removed 20) and now considering 4/18 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16118195266999794805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3926669036933133911.kers'
[2026-05-26 03:42:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16118195266999794805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3926669036933133911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 6 cols 9 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-26 03:42:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3926669036933133911.kers
Total runtime 0 ms.
[2026-05-26 03:42:56] [INFO ] Implicit Places using invariants in 18 ms returned [0, 4]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 4/26 places, 4/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-13
Stuttering criterion allowed to conclude after 11452 steps with 1194 reset in 10 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-13 finished in 85 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((X(X(X(X(!p0))))&&F(p1)&&(!p1 U (p2||G(!p1))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3869421265603490215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7927725681238427953.kers'
[2026-05-26 03:42:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3869421265603490215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7927725681238427953.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:42:56] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7927725681238427953.kers
Total runtime 1 ms.
[2026-05-26 03:42:56] [INFO ] Implicit Places using invariants in 27 ms returned [3, 9, 13, 19]
[2026-05-26 03:42:56] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8572582430002550921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10225205806199299787.kers'
[2026-05-26 03:42:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8572582430002550921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10225205806199299787.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 03:42:56] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10225205806199299787.kers
Total runtime 0 ms.
[2026-05-26 03:42:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-26 03:42:56] [INFO ] Invariant cache hit.
[2026-05-26 03:42:56] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 21/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(X(p0))))&&F(p1)&&(!p1 U (p2||G(!p1))))))'
Stuttering acceptance computed with spot in 1468 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND p1 (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-14
Stuttering criterion allowed to conclude after 390 steps with 18 reset in 1 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00010-LTLCardinality-14 finished in 1613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(p1 U X(X(p2)))))||X(F(p3))))'
Support contains 5 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8663592148479698862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1952565892925997257.kers'
[2026-05-26 03:42:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8663592148479698862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1952565892925997257.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 25 cols 49 entries
Finished phase 1 with 16 SingleSign rule and 2 generalized
[2026-05-26 03:42:57] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1952565892925997257.kers
Total runtime 0 ms.
[2026-05-26 03:42:58] [INFO ] Implicit Places using invariants in 31 ms returned [3, 9, 13, 19]
[2026-05-26 03:42:58] [INFO ] Actually due to overlaps returned [3, 9, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 18
Applied a total of 1 rules in 1 ms. Remains 21 /22 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18401025413103540083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7115583943531875291.kers'
[2026-05-26 03:42:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18401025413103540083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7115583943531875291.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 03:42:58] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7115583943531875291.kers
Total runtime 0 ms.
[2026-05-26 03:42:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-26 03:42:58] [INFO ] Invariant cache hit.
[2026-05-26 03:42:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 21/26 places, 18/18 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(p1 U X(X(p2)))))||X(F(p3))))'
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : HouseConstruction-PT-00010-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 40 ms.
Product exploration explored 100000 steps with 50000 reset in 39 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 27 factoid took 15 ms. Proved property starting from automaton with 7 states, 19 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 46 ms.
FORMULA HouseConstruction-PT-00010-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00010-LTLCardinality-15 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((G(p1) U G(p2))||X(G(p3)))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 03:42:58] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17149778904214341967
[2026-05-26 03:42:58] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2026-05-26 03:42:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:58] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2026-05-26 03:42:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:58] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2026-05-26 03:42:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:42:58] [INFO ] Applying decomposition
[2026-05-26 03:42:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17149778904214341967
Running compilation step : cd /tmp/ltsmin17149778904214341967;'/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 03:42:58] [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/graph1026419368788912368.txt' '-o' '/tmp/graph1026419368788912368.bin' '-w' '/tmp/graph1026419368788912368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1026419368788912368.bin' '-l' '-1' '-v' '-w' '/tmp/graph1026419368788912368.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:42:58] [INFO ] Decomposing Gal with order
[2026-05-26 03:42:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:42:58] [INFO ] Flatten gal took : 5 ms
[2026-05-26 03:42:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2026-05-26 03:42:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality10323941058684036302.gal : 0 ms
[2026-05-26 03:42:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality1407779576378203981.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/LTLCardinality10323941058684036302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1407779576378203981.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 : !(((F("(gu8.p13<=gu8.p25)"))U(((G("(gi0.gi0.gu2.p15>=2)"))U(G("(gu4.p9>gu4.p18)")))||(X(G("(gu1.p14<=gu1.p7)"))))))
Formula 0 simplified : G!"(gu8.p13<=gu8.p25)" R ((F!"(gi0.gi0.gu2.p15>=2)" R F!"(gu4.p9>gu4.p18)") & XF!"(gu1.p14<=gu1.p7)")
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin17149778904214341967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17149778904214341967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp0==true)) U (([]((LTLAPp1==true)) U []((LTLAPp2==true)))||X([]((LTLAPp3==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 04:03:31] [INFO ] Flatten gal took : 2 ms
[2026-05-26 04:03:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality14104257883418512903.gal : 0 ms
[2026-05-26 04:03:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality6823698755957309807.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/LTLCardinality14104257883418512903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6823698755957309807.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 : !(((F("(p13<=p25)"))U(((G("(p15>=2)"))U(G("(p9>p18)")))||(X(G("(p14<=p7)"))))))
Formula 0 simplified : G!"(p13<=p25)" R ((F!"(p15>=2)" R F!"(p9>p18)") & XF!"(p14<=p7)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2026-05-26 04:24:05] [INFO ] Flatten gal took : 4 ms
[2026-05-26 04:24:05] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-26 04:24:05] [INFO ] Transformed 26 places.
[2026-05-26 04:24:05] [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 04:24:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality18341404557949531877.gal : 1 ms
[2026-05-26 04:24:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality15630578981552323199.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/LTLCardinality18341404557949531877.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15630578981552323199.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(p13<=p25)"))U(((G("(p15>=2)"))U(G("(p9>p18)")))||(X(G("(p14<=p7)"))))))
Formula 0 simplified : G!"(p13<=p25)" R ((F!"(p15>=2)" R F!"(p9>p18)") & XF!"(p14<=p7)")
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Computing Next relation with stutter on 1 deadlock states
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-00010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-00010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074400835"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00010.tgz
mv HouseConstruction-PT-00010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;