Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422200180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is HouseConstruction-PT-00050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422200180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 13K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-00050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748792631336

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 15:43:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 15:43:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 15:43:52] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2025-06-01 15:43:52] [INFO ] Transformed 26 places.
[2025-06-01 15:43:52] [INFO ] Transformed 18 transitions.
[2025-06-01 15:43:52] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HouseConstruction-PT-00050-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00050-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-00050-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 7 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2025-06-01 15:43:53] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:53] [INFO ] Implicit Places using invariants in 168 ms returned [9, 13]
[2025-06-01 15:43:53] [INFO ] Actually due to overlaps returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/26 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 3 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 15:43:53] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:53] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-01 15:43:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 24/26 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 308 ms. Remains : 24/26 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2025-06-01 15:43:53] [INFO ] Flatten gal took : 13 ms
[2025-06-01 15:43:53] [INFO ] Flatten gal took : 4 ms
[2025-06-01 15:43:53] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 3268 steps (0 resets) in 38 ms. (83 steps per ms) remains 0/17 properties
FORMULA HouseConstruction-PT-00050-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1)||X(p2)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-01 15:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:54] [INFO ] Implicit Places using invariants in 24 ms returned [3, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-00
Stuttering criterion allowed to conclude after 900 steps with 0 reset in 13 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-00 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)) U X(X(X((G(F(p0)) U p2))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-01 15:43:54] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:54] [INFO ] Implicit Places using invariants in 49 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 763 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-01
Product exploration explored 100000 steps with 7103 reset in 261 ms.
Product exploration explored 100000 steps with 7036 reset in 172 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 282 ms. Reduced automaton from 19 states, 41 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
RANDOM walk for 3064 steps (0 resets) in 13 ms. (218 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p2)]
Knowledge based reduction with 14 factoid took 570 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2025-06-01 15:43:57] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 15:43:57] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 7 ms returned sat
[2025-06-01 15:43:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 15:43:57] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 15:43:57] [INFO ] Added : 17 causal constraints over 4 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-01 15:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 15:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:57] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 15:43:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 377 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 309 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 709ms
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
RANDOM walk for 2912 steps (0 resets) in 12 ms. (224 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p2)]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 218 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
[2025-06-01 15:43:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 15:43:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 15:43:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-01 15:43:59] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 15:43:59] [INFO ] Added : 17 causal constraints over 4 iterations in 34 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7106 reset in 96 ms.
Stuttering criterion allowed to conclude after 19638 steps with 1359 reset in 19 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-01 finished in 5209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 27 edges and 24 vertex of which 16 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
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 15 transition count 10
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 11 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 11 transition count 6
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 16 place count 7 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 18 place count 6 transition count 5
Applied a total of 18 rules in 14 ms. Remains 6 /24 variables (removed 18) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 6 cols
[2025-06-01 15:43:59] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-01 15:43:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:43:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 15:43:59] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-01 15:43:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/10 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/11 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 46 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-02
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 3 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-02 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 27 edges and 24 vertex of which 16 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 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 5 place count 15 transition count 9
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 11 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 9 place count 11 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 8 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 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 4 transition count 4
Applied a total of 20 rules in 6 ms. Remains 4 /24 variables (removed 20) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2025-06-01 15:44:00] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:00] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-01 15:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:00] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 15:44:00] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-01 15:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 4/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-03
Product exploration explored 100000 steps with 2608 reset in 103 ms.
Product exploration explored 100000 steps with 2653 reset in 139 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00050-LTLFireability-03 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-01 15:44:00] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:00] [INFO ] Implicit Places using invariants in 39 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR p0 (AND p1 (NOT p2))), true, p0, (AND (NOT p2) p1), p0]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-04 finished in 227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(X(p1)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2025-06-01 15:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:00] [INFO ] Implicit Places using invariants in 28 ms returned [3, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-06
Product exploration explored 100000 steps with 4130 reset in 95 ms.
Product exploration explored 100000 steps with 4151 reset in 106 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 2044 steps (0 resets) in 7 ms. (255 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2025-06-01 15:44:02] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 15:44:02] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 15:44:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 15:44:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 15:44:02] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 15:44:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 15:44:02] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 15:44:02] [INFO ] Added : 17 causal constraints over 4 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-01 15:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-01 15:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:02] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 15:44:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 216 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 206 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 425ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 426ms
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 1738 steps (0 resets) in 8 ms. (193 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2025-06-01 15:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 15:44:04] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 15:44:04] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-01 15:44:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 15:44:04] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-01 15:44:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-01 15:44:04] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 15:44:04] [INFO ] Added : 17 causal constraints over 4 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 314 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 4140 reset in 102 ms.
Product exploration explored 100000 steps with 4125 reset in 114 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 10 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 2 place count 10 transition count 10
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 10 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 9 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 9 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 4 ms. Remains 9 /21 variables (removed 12) and now considering 9/18 (removed 9) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 15:44:05] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 9 cols
[2025-06-01 15:44:05] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/9 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 10 constraints, problems are : Problem set: 4 solved, 4 unsolved in 71 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/16 variables, 7/8 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/18 variables, 2/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 14 constraints, problems are : Problem set: 4 solved, 4 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 4 solved, 4 unsolved
Search for dead transitions found 4 dead transitions in 148ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 9/21 places, 5/18 transitions.
Graph (complete) has 6 edges and 9 vertex of which 6 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 5 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 1 ms. Remains 4 /9 variables (removed 5) and now considering 4/5 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/21 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 4/21 places, 4/18 transitions.
Built C files in :
/tmp/ltsmin5802281561836785275
[2025-06-01 15:44:05] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5802281561836785275
Running compilation step : cd /tmp/ltsmin5802281561836785275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 213 ms.
Running link step : cd /tmp/ltsmin5802281561836785275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5802281561836785275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6419709723202176715.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-01 15:44:20] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-01 15:44:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:44:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-01 15:44:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 17 unsolved in 200 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 41 constraints, problems are : Problem set: 0 solved, 17 unsolved in 204 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 409ms
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin4146782402427943735
[2025-06-01 15:44:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4146782402427943735
Running compilation step : cd /tmp/ltsmin4146782402427943735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin4146782402427943735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4146782402427943735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7596152241693146590.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 15:44:36] [INFO ] Flatten gal took : 2 ms
[2025-06-01 15:44:36] [INFO ] Flatten gal took : 1 ms
[2025-06-01 15:44:36] [INFO ] Time to serialize gal into /tmp/LTL12441763217419942607.gal : 1 ms
[2025-06-01 15:44:36] [INFO ] Time to serialize properties into /tmp/LTL2089666839865038580.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12441763217419942607.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16265038379486467106.hoa' '-atoms' '/tmp/LTL2089666839865038580.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2089666839865038580.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16265038379486467106.hoa
Detected timeout of ITS tools.
[2025-06-01 15:44:51] [INFO ] Flatten gal took : 2 ms
[2025-06-01 15:44:51] [INFO ] Flatten gal took : 1 ms
[2025-06-01 15:44:51] [INFO ] Time to serialize gal into /tmp/LTL11031030167592408293.gal : 1 ms
[2025-06-01 15:44:51] [INFO ] Time to serialize properties into /tmp/LTL11200138547713814436.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11031030167592408293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11200138547713814436.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(p14>=1)"))U(X(X("(p17>=1)"))))))
Formula 0 simplified : X(G!"(p14>=1)" R XX!"(p17>=1)")
Detected timeout of ITS tools.
[2025-06-01 15:45:06] [INFO ] Flatten gal took : 5 ms
[2025-06-01 15:45:06] [INFO ] Applying decomposition
[2025-06-01 15:45:06] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph18326332585314613889.txt' '-o' '/tmp/graph18326332585314613889.bin' '-w' '/tmp/graph18326332585314613889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18326332585314613889.bin' '-l' '-1' '-v' '-w' '/tmp/graph18326332585314613889.weights' '-q' '0' '-e' '0.001'
[2025-06-01 15:45:06] [INFO ] Decomposing Gal with order
[2025-06-01 15:45:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 15:45:06] [INFO ] Flatten gal took : 34 ms
[2025-06-01 15:45:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 15:45:06] [INFO ] Time to serialize gal into /tmp/LTL16749719167653731967.gal : 1 ms
[2025-06-01 15:45:06] [INFO ] Time to serialize properties into /tmp/LTL15104402880856591339.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16749719167653731967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15104402880856591339.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F("(u4.p14>=1)"))U(X(X("(u4.p17>=1)"))))))
Formula 0 simplified : X(G!"(u4.p14>=1)" R XX!"(u4.p17>=1)")
Detected timeout of ITS tools.
Treatment of property HouseConstruction-PT-00050-LTLFireability-06 finished in 80674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(X(p0))&&p1))&&(X(p2) U p1)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-01 15:45:21] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:21] [INFO ] Implicit Places using invariants in 34 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-07 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 13
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 18 transition count 13
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 18 transition count 8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 13 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 11 transition count 7
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 2 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 8 transition count 6
Applied a total of 25 rules in 6 ms. Remains 8 /24 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2025-06-01 15:45:21] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-01 15:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 15:45:21] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-01 15:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/14 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/14 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 15 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-08
Stuttering criterion allowed to conclude after 300 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-08 finished in 246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(G(!p1))))&&F(p2)))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2025-06-01 15:45:21] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:21] [INFO ] Implicit Places using invariants in 29 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/24 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 32 ms. Remains : 23/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p2) p1), (NOT p0), p1, (NOT p2), p1, p1, true]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-09
Entered a terminal (fully accepting) state of product in 55 steps with 2 reset in 1 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-09 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)&&(G((G(p1) U p2))||X(F(p1)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-01 15:45:22] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:22] [INFO ] Implicit Places using invariants in 28 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-10
Product exploration explored 100000 steps with 33213 reset in 51 ms.
Product exploration explored 100000 steps with 33457 reset in 64 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 479 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 208 steps (0 resets) in 4 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p1)]
Knowledge based reduction with 11 factoid took 562 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 22 cols
[2025-06-01 15:45:23] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 15:45:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-01 15:45:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-01 15:45:23] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-01 15:45:23] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 14 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 17 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 18 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 18 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 20 place count 10 transition count 8
Applied a total of 20 rules in 5 ms. Remains 10 /22 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2025-06-01 15:45:23] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:23] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-01 15:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 15:45:23] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-01 15:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 75 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 90 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 167ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 10/22 places, 8/18 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p1), (X p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 9 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00050-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00050-LTLFireability-10 finished in 1944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)&&(p1||G(!p2)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-01 15:45:24] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:24] [INFO ] Implicit Places using invariants in 26 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR p0 (AND (NOT p1) p2)), (OR p0 (AND (NOT p1) p2)), (OR p2 p0), p0]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-00050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-00050-LTLFireability-13 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 27 edges and 24 vertex of which 4 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 3
Applied a total of 3 rules in 2 ms. Remains 3 /24 variables (removed 21) and now considering 3/18 (removed 15) transitions.
// Phase 1: matrix 3 rows 3 cols
[2025-06-01 15:45:24] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:24] [INFO ] Implicit Places using invariants in 12 ms returned []
[2025-06-01 15:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 15:45:24] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 15:45:24] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-01 15:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/24 places, 3/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 3/24 places, 3/18 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-00050-LTLFireability-15
Product exploration explored 100000 steps with 662 reset in 56 ms.
Product exploration explored 100000 steps with 662 reset in 76 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-00050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-00050-LTLFireability-15 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(X(p1)))))'
[2025-06-01 15:45:24] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12468123883211561501
[2025-06-01 15:45:24] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2025-06-01 15:45:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 15:45:24] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2025-06-01 15:45:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 15:45:24] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2025-06-01 15:45:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 15:45:24] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12468123883211561501
Running compilation step : cd /tmp/ltsmin12468123883211561501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 15:45:24] [INFO ] Applying decomposition
[2025-06-01 15:45:24] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph13185333032103077035.txt' '-o' '/tmp/graph13185333032103077035.bin' '-w' '/tmp/graph13185333032103077035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13185333032103077035.bin' '-l' '-1' '-v' '-w' '/tmp/graph13185333032103077035.weights' '-q' '0' '-e' '0.001'
[2025-06-01 15:45:24] [INFO ] Decomposing Gal with order
[2025-06-01 15:45:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 15:45:24] [INFO ] Flatten gal took : 2 ms
[2025-06-01 15:45:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 15:45:24] [INFO ] Time to serialize gal into /tmp/LTLFireability1437319907860123449.gal : 1 ms
[2025-06-01 15:45:24] [INFO ] Time to serialize properties into /tmp/LTLFireability15780389978213512982.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1437319907860123449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15780389978213512982.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(u4.p14>=1)"))U(X(X("(u4.p17>=1)"))))))
Formula 0 simplified : X(G!"(u4.p14>=1)" R XX!"(u4.p17>=1)")
Compilation finished in 91 ms.
Running link step : cd /tmp/ltsmin12468123883211561501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12468123883211561501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: LTL layer: formula: X((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 0.001: "X((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.058: DFS-FIFO for weak LTL, using special progress label 21
pins2lts-mc-linux64( 0/ 8), 0.058: There are 22 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.058: State length is 25, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.058: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.058: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.058: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.058: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.244: ~116 levels ~960 states ~7424 transitions
pins2lts-mc-linux64( 3/ 8), 1.418: ~215 levels ~1920 states ~14352 transitions
pins2lts-mc-linux64( 1/ 8), 1.956: ~445 levels ~3840 states ~33568 transitions
pins2lts-mc-linux64( 1/ 8), 2.040: ~550 levels ~7680 states ~43432 transitions
pins2lts-mc-linux64( 1/ 8), 2.161: ~550 levels ~15360 states ~58776 transitions
pins2lts-mc-linux64( 1/ 8), 2.693: ~550 levels ~30720 states ~90984 transitions
pins2lts-mc-linux64( 1/ 8), 4.806: ~550 levels ~61440 states ~166096 transitions
pins2lts-mc-linux64( 3/ 8), 5.407: ~548 levels ~122880 states ~356592 transitions
pins2lts-mc-linux64( 3/ 8), 7.702: ~548 levels ~245760 states ~707696 transitions
pins2lts-mc-linux64( 3/ 8), 8.778: ~548 levels ~491520 states ~1436296 transitions
pins2lts-mc-linux64( 3/ 8), 10.326: ~548 levels ~983040 states ~2942608 transitions
pins2lts-mc-linux64( 3/ 8), 12.444: ~548 levels ~1966080 states ~6044560 transitions
pins2lts-mc-linux64( 3/ 8), 14.932: ~548 levels ~3932160 states ~12355104 transitions
pins2lts-mc-linux64( 3/ 8), 20.172: ~548 levels ~7864320 states ~25242424 transitions
pins2lts-mc-linux64( 3/ 8), 28.962: ~548 levels ~15728640 states ~51584992 transitions
pins2lts-mc-linux64( 1/ 8), 48.980: ~550 levels ~31457280 states ~111508864 transitions
pins2lts-mc-linux64( 1/ 8), 87.479: ~550 levels ~62914560 states ~229596424 transitions
pins2lts-mc-linux64( 1/ 8), 163.489: ~550 levels ~125829120 states ~467131984 transitions
pins2lts-mc-linux64( 1/ 8), 325.112: ~550 levels ~251658240 states ~983671720 transitions
pins2lts-mc-linux64( 1/ 8), 663.963: ~550 levels ~503316480 states ~1999473328 transitions
pins2lts-mc-linux64( 1/ 8), 789.200: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 789.213:
pins2lts-mc-linux64( 0/ 8), 789.213: mean standard work distribution: 173.2% (states) 173.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 789.213:
pins2lts-mc-linux64( 0/ 8), 789.213: Explored 134209558 states 537713408 transitions, fanout: 4.007
pins2lts-mc-linux64( 0/ 8), 789.213: Total exploration time 789.150 sec (789.110 sec minimum, 789.124 sec on average)
pins2lts-mc-linux64( 0/ 8), 789.213: States per second: 170068, Transitions per second: 681383
pins2lts-mc-linux64( 0/ 8), 789.213:
pins2lts-mc-linux64( 0/ 8), 789.213: Progress states detected: 3
pins2lts-mc-linux64( 0/ 8), 789.213: Redundant explorations: -0.0055
pins2lts-mc-linux64( 0/ 8), 789.213:
pins2lts-mc-linux64( 0/ 8), 789.213: Queue width: 8B, total height: 1114, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 789.213: Tree memory: 1165.0MB, 9.1 B/state, compr.: 8.9%
pins2lts-mc-linux64( 0/ 8), 789.213: Tree fill ratio (roots/leafs): 99.0%/55.0%
pins2lts-mc-linux64( 0/ 8), 789.213: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 789.213: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 789.213: Est. total memory use: 1165.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12468123883211561501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12468123883211561501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true)) U X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 16:05:54] [INFO ] Flatten gal took : 3 ms
[2025-06-01 16:05:54] [INFO ] Time to serialize gal into /tmp/LTLFireability14229435403830802443.gal : 1 ms
[2025-06-01 16:05:54] [INFO ] Time to serialize properties into /tmp/LTLFireability7239094622457353522.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14229435403830802443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7239094622457353522.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X((F("(p14>=1)"))U(X(X("(p17>=1)"))))))
Formula 0 simplified : X(G!"(p14>=1)" R XX!"(p17>=1)")
Detected timeout of ITS tools.
[2025-06-01 16:26:25] [INFO ] Flatten gal took : 6 ms
[2025-06-01 16:26:25] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-01 16:26:25] [INFO ] Transformed 24 places.
[2025-06-01 16:26:25] [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
[2025-06-01 16:26:25] [INFO ] Time to serialize gal into /tmp/LTLFireability13104231171578660851.gal : 1 ms
[2025-06-01 16:26:25] [INFO ] Time to serialize properties into /tmp/LTLFireability11560739525612283249.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13104231171578660851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11560739525612283249.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.202505121319/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 : !((X((F("(p14>=1)"))U(X(X("(p17>=1)"))))))
Formula 0 simplified : X(G!"(p14>=1)" R XX!"(p17>=1)")
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-00050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is HouseConstruction-PT-00050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422200180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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