fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r240-tall-174915590400788
Last Updated
June 24, 2025

About the Execution of ITS-Tools for UtilityControlRoom-PT-Z2T3N08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1061157.00 0.00 0.00 FFTFFTFFFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590400788.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 UtilityControlRoom-PT-Z2T3N08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590400788
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 20K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 72K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 310K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 93K May 29 14:33 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 UtilityControlRoom-PT-Z2T3N08-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T3N08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749273745088

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T3N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 05:22:26] [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-07 05:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 05:22:27] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-07 05:22:27] [INFO ] Transformed 140 places.
[2025-06-07 05:22:27] [INFO ] Transformed 216 transitions.
[2025-06-07 05:22:27] [INFO ] Parsed PT model containing 140 places and 216 transitions and 680 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2025-06-07 05:22:27] [INFO ] Reduced 8 identical enabling conditions.
[2025-06-07 05:22:27] [INFO ] Reduced 8 identical enabling conditions.
[2025-06-07 05:22:27] [INFO ] Reduced 8 identical enabling conditions.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 184/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 140 cols
[2025-06-07 05:22:27] [INFO ] Computed 19 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:22:27] [INFO ] Implicit Places using invariants in 245 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 286 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/140 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 314 ms. Remains : 139/140 places, 184/184 transitions.
Support contains 123 out of 139 places after structural reductions.
[2025-06-07 05:22:27] [INFO ] Flatten gal took : 43 ms
[2025-06-07 05:22:27] [INFO ] Flatten gal took : 42 ms
[2025-06-07 05:22:28] [INFO ] Input system was already deterministic with 184 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 31986 steps (6 resets) in 785 ms. (40 steps per ms) remains 0/24 properties
Computed a total of 0 stabilizing places and 0 stable transitions
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(X(p0))) U p1))'
Support contains 40 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 11 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:22:28] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:22:28] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-07 05:22:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:22:29] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6318 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8942 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15384ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 15407ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15682 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-00
Product exploration explored 100000 steps with 206 reset in 433 ms.
Stack based approach found an accepted trace after 20771 steps with 46 reset with depth 1798 and stack size 1798 in 81 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-00 finished in 16532 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(X(F(p0)))&&(p1 U X(G(p2))))||G(F(p0)))))'
Support contains 43 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 6 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2025-06-07 05:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:22:45] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-07 05:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:22:45] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5748 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8585 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14371ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14372ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14513 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-01
Product exploration explored 100000 steps with 18150 reset in 393 ms.
Product exploration explored 100000 steps with 18113 reset in 445 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 11 factoid took 406 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 3615 steps (0 resets) in 44 ms. (80 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (OR p2 (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p1) p0)))]
Knowledge based reduction with 11 factoid took 716 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-07 05:23:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:23:03] [INFO ] [Real]Absence check using 18 positive place invariants in 25 ms returned sat
[2025-06-07 05:23:03] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-06-07 05:23:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:23:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2025-06-07 05:23:03] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-07 05:23:03] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 05:23:04] [INFO ] Added : 88 causal constraints over 18 iterations in 281 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 43 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-06-07 05:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:23:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 05:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:23:04] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5794 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8932 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14775ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14775ms
Finished structural reductions in LTL mode , in 1 iterations and 14886 ms. Remains : 123/123 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 293 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 2562 steps (0 resets) in 33 ms. (75 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (OR p2 (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 601 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-07 05:23:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:23:20] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2025-06-07 05:23:21] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-06-07 05:23:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:23:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2025-06-07 05:23:21] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-06-07 05:23:21] [INFO ] Computed and/alt/rep : 160/248/160 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 05:23:21] [INFO ] Added : 88 causal constraints over 18 iterations in 258 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 18132 reset in 322 ms.
Product exploration explored 100000 steps with 18001 reset in 285 ms.
Applying partial POR strategy [false, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 43 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 123 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 152
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 32 rules in 24 ms. Remains 123 /123 variables (removed 0) and now considering 152/168 (removed 16) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:23:23] [INFO ] Redundant transitions in 5 ms returned []
Running 144 sub problems to find dead transitions.
// Phase 1: matrix 152 rows 123 cols
[2025-06-07 05:23:23] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:23] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 8/123 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:24] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:24] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:24] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:24] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:24] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:24] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:24] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:23:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 8/27 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/27 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 152/275 variables, 123/150 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/150 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/150 constraints. Problems are: Problem set: 16 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 150 constraints, problems are : Problem set: 16 solved, 128 unsolved in 5385 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 24/123 variables, 18/19 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 8/27 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/27 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 152/275 variables, 123/150 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 128/278 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/278 constraints. Problems are: Problem set: 16 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/278 constraints. Problems are: Problem set: 16 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 278 constraints, problems are : Problem set: 16 solved, 128 unsolved in 6612 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 128/144 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12019ms problems are : Problem set: 16 solved, 128 unsolved
Search for dead transitions found 16 dead transitions in 12021ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 123/123 places, 136/168 transitions.
Graph (complete) has 216 edges and 123 vertex of which 107 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 107 /123 variables (removed 16) and now considering 136/136 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/123 places, 136/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12069 ms. Remains : 107/123 places, 136/168 transitions.
Built C files in :
/tmp/ltsmin8836863900842551202
[2025-06-07 05:23:35] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8836863900842551202
Running compilation step : cd /tmp/ltsmin8836863900842551202;'/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 449 ms.
Running link step : cd /tmp/ltsmin8836863900842551202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8836863900842551202;'/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/stateBased17883188396223975054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 43 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:23:50] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:23:50] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 05:23:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:23:50] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:23:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5556 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8762 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14362ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14362ms
Finished structural reductions in LTL mode , in 1 iterations and 14494 ms. Remains : 123/123 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin8857211833974699746
[2025-06-07 05:24:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8857211833974699746
Running compilation step : cd /tmp/ltsmin8857211833974699746;'/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 271 ms.
Running link step : cd /tmp/ltsmin8857211833974699746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8857211833974699746;'/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/stateBased4410971850604836923.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 05:24:20] [INFO ] Flatten gal took : 14 ms
[2025-06-07 05:24:20] [INFO ] Flatten gal took : 15 ms
[2025-06-07 05:24:20] [INFO ] Time to serialize gal into /tmp/LTL16997621133296329118.gal : 7 ms
[2025-06-07 05:24:20] [INFO ] Time to serialize properties into /tmp/LTL14986714872002445507.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/LTL16997621133296329118.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17695116284736364631.hoa' '-atoms' '/tmp/LTL14986714872002445507.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...320
Loading property file /tmp/LTL14986714872002445507.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17695116284736364631.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 05:24:35] [INFO ] Flatten gal took : 9 ms
[2025-06-07 05:24:35] [INFO ] Flatten gal took : 8 ms
[2025-06-07 05:24:35] [INFO ] Time to serialize gal into /tmp/LTL7295776163052372598.gal : 2 ms
[2025-06-07 05:24:35] [INFO ] Time to serialize properties into /tmp/LTL595465265848913306.ltl : 3 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/LTL7295776163052372598.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL595465265848913306.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...274
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_1>=1)&&(OpenRequests_7_1>=1))&&(Idles>=1)))||((((...4651
Formula 0 simplified : G(FG!"(((((((IdleTechs_0>=1)&&(OpenRequests_4_0>=1))&&(Idles>=1))||(((IdleTechs_1>=1)&&(OpenRequests_7_1>=1))&&(Idles>=1)))||((((Idl...4634
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 05:24:50] [INFO ] Flatten gal took : 9 ms
[2025-06-07 05:24:50] [INFO ] Applying decomposition
[2025-06-07 05:24:50] [INFO ] Flatten gal took : 9 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/graph11888011765153717596.txt' '-o' '/tmp/graph11888011765153717596.bin' '-w' '/tmp/graph11888011765153717596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11888011765153717596.bin' '-l' '-1' '-v' '-w' '/tmp/graph11888011765153717596.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:24:50] [INFO ] Decomposing Gal with order
[2025-06-07 05:24:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:24:50] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-07 05:24:50] [INFO ] Flatten gal took : 57 ms
[2025-06-07 05:24:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 10 ms.
[2025-06-07 05:24:50] [INFO ] Time to serialize gal into /tmp/LTL11326270185891327577.gal : 4 ms
[2025-06-07 05:24:50] [INFO ] Time to serialize properties into /tmp/LTL4166879069946978803.ltl : 2 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/LTL11326270185891327577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4166879069946978803.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...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(((((((i3.i0.u12.IdleTechs_0>=1)&&(i6.u23.OpenRequests_4_0>=1))&&(i1.i0.u15.Idles>=1))||(((i5.i1.u11.IdleTechs_1>=1)&&(i4.i...6847
Formula 0 simplified : G(FG!"(((((((i3.i0.u12.IdleTechs_0>=1)&&(i6.u23.OpenRequests_4_0>=1))&&(i1.i0.u15.Idles>=1))||(((i5.i1.u11.IdleTechs_1>=1)&&(i4.i0.u...6830
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-01 finished in 140262 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) U p1)||G(p2))) U (X(p4)||p3)))'
Support contains 67 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2025-06-07 05:25:05] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:25:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 05:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:25:05] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-07 05:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 157 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6925 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 176/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 333 constraints, problems are : Problem set: 0 solved, 176 unsolved in 9135 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16087ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 16088ms
Finished structural reductions in LTL mode , in 1 iterations and 16262 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p3) (NOT p4)), (AND p1 (NOT p0) (NOT p4)), (AND (NOT p1) p2 (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (AND (NOT p0) p1 (NOT p2) (NOT p4)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-02
Product exploration explored 100000 steps with 11418 reset in 368 ms.
Product exploration explored 100000 steps with 11352 reset in 387 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (AND (NOT p1) (NOT p2) (NOT p4))), (X (NOT (AND (NOT p1) p2 (NOT p4)))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p0) (NOT p4)))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p4)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p4))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 727 ms. Reduced automaton from 9 states, 23 edges and 5 AP (stutter sensitive) to 34 states, 114 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1665 ms :[(OR (NOT p1) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p4) p3 (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p4) p3 (NOT p1) p0 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 43 to 42
RANDOM walk for 40000 steps (8 resets) in 1184 ms. (33 steps per ms) remains 16/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 215 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 213 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
[2025-06-07 05:25:26] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf11 is UNSAT
Problem apf12 is UNSAT
Problem apf15 is UNSAT
Problem apf17 is UNSAT
Problem apf19 is UNSAT
Problem apf21 is UNSAT
Problem apf22 is UNSAT
Problem apf23 is UNSAT
Problem apf27 is UNSAT
Problem apf31 is UNSAT
Problem apf32 is UNSAT
Problem apf36 is UNSAT
Problem apf39 is UNSAT
Problem apf41 is UNSAT
After SMT solving in domain Real declared 67/323 variables, and 0 constraints, problems are : Problem set: 16 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 16 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 16 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (AND (NOT p1) (NOT p2) (NOT p4))), (X (NOT (AND (NOT p1) p2 (NOT p4)))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p0) (NOT p4)))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p4)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4)))), (X p0), (X (NOT p1)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (G (OR p1 p2 (NOT p4) p0 (NOT p3))), (G (OR p1 (NOT p2) (NOT p4) (NOT p0) (NOT p3))), (G (OR (NOT p1) (NOT p2) (NOT p4) (NOT p0) p3)), (G (OR (NOT p1) (NOT p2) p4 p0 p3)), (G (OR (NOT p1) (NOT p2) (NOT p4) p0 p3)), (G (OR (NOT p1) p2 (NOT p4) (NOT p0) p3)), (G (OR p1 p2 p4 p0 (NOT p3))), (G (OR (NOT p1) p2 p4 (NOT p0) p3)), (G (OR p1 (NOT p2) (NOT p4) p0 (NOT p3))), (G (OR p1 p2 (NOT p4) (NOT p0) (NOT p3))), (G (OR p1 (NOT p2) p4 p0 (NOT p3))), (G (OR (NOT p1) p2 (NOT p4) p0 p3)), (G (OR p1 (NOT p2) p4 (NOT p0) (NOT p3))), (G (OR (NOT p1) (NOT p2) p4 (NOT p0) p3)), (G (OR p1 p2 p4 (NOT p0) (NOT p3))), (G (OR (NOT p1) p2 p4 p0 p3))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2 (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2 (NOT p4))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p2 (NOT p4) p0 (NOT p3)))), (F p4), (F (NOT (OR p1 (NOT p2) p4 p0))), (F p3), (F (NOT (OR (NOT p1) p2 (NOT p4) (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p4 p0 (NOT p3)))), (F p2), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p2) (NOT p4) p0 p3))), (F p1), (F (NOT (OR (NOT p1) (NOT p2) (NOT p4) p0 (NOT p3)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) (NOT p4) (NOT p0) p3))), (F (NOT (OR (NOT p1) p2 p4 (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2) p4 (NOT p0) (NOT p3)))), (F (NOT (OR p1 p2 (NOT p4) p0 p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p4) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p4) (NOT p0) (NOT p3)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR p1 p2 (NOT p4) (NOT p0) p3))), (F (NOT (AND (NOT p4) (NOT p3)))), (F (NOT (OR (NOT p1) p2 p4 p0 (NOT p3))))]
Knowledge based reduction with 38 factoid took 2024 ms. Reduced automaton from 34 states, 114 edges and 5 AP (stutter insensitive) to 18 states, 60 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 846 ms :[(NOT p3), (AND (NOT p3) (NOT p4)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p3 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 823 ms :[(NOT p3), (AND (NOT p3) (NOT p4)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p3 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false]
[2025-06-07 05:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:25:30] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2025-06-07 05:25:30] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-06-07 05:25:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:25:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2025-06-07 05:25:30] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-06-07 05:25:30] [INFO ] Computed and/alt/rep : 176/264/176 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-07 05:25:30] [INFO ] Added : 96 causal constraints over 20 iterations in 271 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 67 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 139 transition count 168
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 10 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:25:30] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:25:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 05:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:25:30] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:25:30] [INFO ] Redundant transitions in 4 ms returned []
Running 160 sub problems to find dead transitions.
[2025-06-07 05:25:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5808 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8234 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14074ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14075ms
Starting structural reductions in SI_LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14218 ms. Remains : 123/139 places, 168/184 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) p2 (NOT p3) p4))), (X (NOT (AND p0 p2 (NOT p3) p4))), (X (NOT (AND (NOT p0) p2 p3 (NOT p4)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p2 p3 (NOT p4)))), (X (NOT (AND p0 (NOT p2) p3 p4))), (X (NOT (AND p0 p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p4))), (X (NOT (AND p0 (NOT p2) (NOT p3) p4))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p4)))), (X (NOT (AND p0 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p0) p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p2) p3 p4))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p4)))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p4)))), (X (X (NOT (AND p0 p2 (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p4))))), (X (X (NOT (AND p0 p2 p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) p3 p4)))), (X (X (NOT (AND p0 p2 p3 p4)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p4)))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p2 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p4))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p4))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3)))))]
Knowledge based reduction with 41 factoid took 532 ms. Reduced automaton from 18 states, 60 edges and 4 AP (stutter insensitive) to 18 states, 60 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 776 ms :[(NOT p3), (AND (NOT p3) (NOT p4)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p3 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false]
RANDOM walk for 2103 steps (0 resets) in 29 ms. (70 steps per ms) remains 0/24 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) p2 (NOT p3) p4))), (X (NOT (AND p0 p2 (NOT p3) p4))), (X (NOT (AND (NOT p0) p2 p3 (NOT p4)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p2 p3 (NOT p4)))), (X (NOT (AND p0 (NOT p2) p3 p4))), (X (NOT (AND p0 p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p4))), (X (NOT (AND p0 (NOT p2) (NOT p3) p4))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p4)))), (X (NOT (AND p0 (NOT p2) p3 (NOT p4)))), (X (NOT (AND (NOT p0) p2 p3 p4))), (X (NOT (AND (NOT p0) (NOT p2) p3 p4))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p4)))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p4)))), (X (X (NOT (AND p0 p2 (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) p2 p3 (NOT p4))))), (X (X (NOT (AND p0 p2 p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) p3 p4)))), (X (X (NOT (AND p0 p2 p3 p4)))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p4)))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) p3 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p2 p3 p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 p4))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p4))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p4)))), (F (NOT (OR p0 (NOT p2) p3 (NOT p4)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 (NOT p2) (NOT p3) p4))), (F p2), (F p4), (F p3), (F (NOT (OR p0 (NOT p2) p3 p4))), (F p0), (F (NOT (OR p0 p2 (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) p2 (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) p4))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3 (NOT p4)))), (F (NOT (OR p0 p2 p3 (NOT p4)))), (F (NOT (OR p0 (NOT p2) (NOT p3) (NOT p4)))), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3) p4))), (F (NOT (OR p0 p2 (NOT p3) p4))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 41 factoid took 1423 ms. Reduced automaton from 18 states, 60 edges and 4 AP (stutter insensitive) to 18 states, 60 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 819 ms :[(NOT p3), (AND (NOT p3) (NOT p4)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p3 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 794 ms :[(NOT p3), (AND (NOT p3) (NOT p4)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p3 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false]
[2025-06-07 05:25:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:25:49] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2025-06-07 05:25:49] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-07 05:25:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:25:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2025-06-07 05:25:49] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-07 05:25:49] [INFO ] Computed and/alt/rep : 160/280/160 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-07 05:25:50] [INFO ] Added : 103 causal constraints over 22 iterations in 331 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 791 ms :[(NOT p3), (AND (NOT p3) (NOT p4)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p3 (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 6461 reset in 361 ms.
Product exploration explored 100000 steps with 6400 reset in 362 ms.
Built C files in :
/tmp/ltsmin18199114874824158585
[2025-06-07 05:25:51] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2025-06-07 05:25:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:25:51] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2025-06-07 05:25:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:25:51] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2025-06-07 05:25:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:25:51] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18199114874824158585
Running compilation step : cd /tmp/ltsmin18199114874824158585;'/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 324 ms.
Running link step : cd /tmp/ltsmin18199114874824158585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18199114874824158585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4344674812213511389.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 67 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 11 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-06-07 05:26:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:26:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 05:26:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:26:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:26:06] [INFO ] Redundant transitions in 4 ms returned []
Running 160 sub problems to find dead transitions.
[2025-06-07 05:26:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5771 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8280 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14089ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14249 ms. Remains : 123/123 places, 168/168 transitions.
Built C files in :
/tmp/ltsmin1787441553209403529
[2025-06-07 05:26:20] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2025-06-07 05:26:20] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:26:20] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2025-06-07 05:26:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:26:20] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2025-06-07 05:26:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:26:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1787441553209403529
Running compilation step : cd /tmp/ltsmin1787441553209403529;'/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 315 ms.
Running link step : cd /tmp/ltsmin1787441553209403529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1787441553209403529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4464321768291061857.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 05:26:36] [INFO ] Flatten gal took : 12 ms
[2025-06-07 05:26:36] [INFO ] Flatten gal took : 7 ms
[2025-06-07 05:26:36] [INFO ] Time to serialize gal into /tmp/LTL15683649011074814358.gal : 2 ms
[2025-06-07 05:26:36] [INFO ] Time to serialize properties into /tmp/LTL5352537620089474078.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15683649011074814358.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11384009708181280883.hoa' '-atoms' '/tmp/LTL5352537620089474078.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/LTL5352537620089474078.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11384009708181280883.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 05:26:51] [INFO ] Flatten gal took : 7 ms
[2025-06-07 05:26:51] [INFO ] Flatten gal took : 7 ms
[2025-06-07 05:26:51] [INFO ] Time to serialize gal into /tmp/LTL10644175096942616060.gal : 2 ms
[2025-06-07 05:26:51] [INFO ] Time to serialize properties into /tmp/LTL12507843903987059392.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/LTL10644175096942616060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12507843903987059392.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 : !(((G(((F("((((ControlRoomDispatch_7>=1)||(ControlRoomDispatch_6>=1))||((ControlRoomDispatch_1>=1)||(ControlRoomDispatch_0>=1)))||(((C...3186
Formula 0 simplified : F((G!"((((ControlRoomDispatch_7>=1)||(ControlRoomDispatch_6>=1))||((ControlRoomDispatch_1>=1)||(ControlRoomDispatch_0>=1)))||(((Cont...3176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-07 05:27:06] [INFO ] Flatten gal took : 7 ms
[2025-06-07 05:27:06] [INFO ] Applying decomposition
[2025-06-07 05:27:06] [INFO ] Flatten gal took : 6 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/graph558137178322269791.txt' '-o' '/tmp/graph558137178322269791.bin' '-w' '/tmp/graph558137178322269791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph558137178322269791.bin' '-l' '-1' '-v' '-w' '/tmp/graph558137178322269791.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:27:06] [INFO ] Decomposing Gal with order
[2025-06-07 05:27:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:27:06] [INFO ] Removed a total of 155 redundant transitions.
[2025-06-07 05:27:06] [INFO ] Flatten gal took : 14 ms
[2025-06-07 05:27:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 5 ms.
[2025-06-07 05:27:06] [INFO ] Time to serialize gal into /tmp/LTL14459407937785418480.gal : 6 ms
[2025-06-07 05:27:06] [INFO ] Time to serialize properties into /tmp/LTL12577255616648383852.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/LTL14459407937785418480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12577255616648383852.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 : !(((G(((F("((((i7.u24.ControlRoomDispatch_7>=1)||(i3.u1.ControlRoomDispatch_6>=1))||((i4.u19.ControlRoomDispatch_1>=1)||(i0.i1.u18.Con...4357
Formula 0 simplified : F((G!"((((i7.u24.ControlRoomDispatch_7>=1)||(i3.u1.ControlRoomDispatch_6>=1))||((i4.u19.ControlRoomDispatch_1>=1)||(i0.i1.u18.Contro...4347
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-02 finished in 135870 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))&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Support contains 64 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 139 cols
[2025-06-07 05:27:21] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-07 05:27:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:21] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-07 05:27: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/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 157 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6945 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 8/139 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 184/323 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 176/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 333 constraints, problems are : Problem set: 0 solved, 176 unsolved in 9165 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16132ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 16133ms
Finished structural reductions in LTL mode , in 1 iterations and 16313 ms. Remains : 139/139 places, 184/184 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR p1 p0), p0, p1, p1, p0, true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-04 finished in 16565 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))'
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 106 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 106 transition count 120
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 98 transition count 112
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 98 transition count 112
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 147 place count 73 transition count 88
Applied a total of 147 rules in 20 ms. Remains 73 /139 variables (removed 66) and now considering 88/184 (removed 96) transitions.
// Phase 1: matrix 88 rows 73 cols
[2025-06-07 05:27:37] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 05:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:38] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:27:38] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2025-06-07 05:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/73 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/161 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/161 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 90 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 8/73 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 88/161 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 72/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 162 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1865 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3383ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3383ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/139 places, 88/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3498 ms. Remains : 73/139 places, 88/184 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-06
Product exploration explored 100000 steps with 2625 reset in 258 ms.
Stack based approach found an accepted trace after 299 steps with 1 reset with depth 47 and stack size 47 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-06 finished in 3803 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(G(p1))))'
Support contains 35 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 2 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:27:41] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-07 05:27:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:41] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:27:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5837 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8961 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14826ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14827ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14990 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-07 finished in 15135 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(F(p0))||G(p1))))'
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 139 transition count 153
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 78 place count 108 transition count 137
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 78 place count 108 transition count 121
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 110 place count 92 transition count 121
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 140 place count 77 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 76 transition count 105
Applied a total of 142 rules in 15 ms. Remains 76 /139 variables (removed 63) and now considering 105/184 (removed 79) transitions.
// Phase 1: matrix 105 rows 76 cols
[2025-06-07 05:27:56] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 05:27:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:27:57] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:27:57] [INFO ] Redundant transitions in 0 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-07 05:27: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/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/76 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 105/181 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 94 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2087 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/76 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 105/181 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 88/182 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 182 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2967 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5078ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 5079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/139 places, 105/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5220 ms. Remains : 76/139 places, 105/184 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-08
Product exploration explored 100000 steps with 1130 reset in 207 ms.
Product exploration explored 100000 steps with 1112 reset in 209 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 336 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4259 steps (0 resets) in 25 ms. (163 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 448 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 105/105 transitions.
Applied a total of 0 rules in 12 ms. Remains 76 /76 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2025-06-07 05:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 05:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:03] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:28:03] [INFO ] Redundant transitions in 0 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-07 05:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/76 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 105/181 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 94 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 8/76 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 105/181 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 88/182 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 182 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2863 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5001ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 5002ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5158 ms. Remains : 76/76 places, 105/105 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 380 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6502 steps (0 resets) in 48 ms. (132 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 481 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1165 reset in 191 ms.
Product exploration explored 100000 steps with 1173 reset in 198 ms.
Built C files in :
/tmp/ltsmin12634277873643780859
[2025-06-07 05:28:10] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2025-06-07 05:28:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:28:10] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2025-06-07 05:28:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:28:10] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2025-06-07 05:28:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:28:10] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12634277873643780859
Running compilation step : cd /tmp/ltsmin12634277873643780859;'/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 226 ms.
Running link step : cd /tmp/ltsmin12634277873643780859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12634277873643780859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10235084748204309145.hoa' '--buchi-type=spotba'
LTSmin run took 161 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-08 finished in 14054 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&&F(p1)))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 124 transition count 169
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 124 transition count 169
Applied a total of 30 rules in 3 ms. Remains 124 /139 variables (removed 15) and now considering 169/184 (removed 15) transitions.
// Phase 1: matrix 169 rows 124 cols
[2025-06-07 05:28:10] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 05:28:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:11] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-07 05:28:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 169/293 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 142 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5994 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 8/124 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 169/293 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 161/303 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 303 constraints, problems are : Problem set: 0 solved, 161 unsolved in 8884 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14907ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 14909ms
Starting structural reductions in LTL mode, iteration 1 : 124/139 places, 169/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15069 ms. Remains : 124/139 places, 169/184 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 518 steps with 7 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-10 finished in 15216 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&&X((F(p1)||G(p0)))))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 6 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:28:26] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:26] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-07 05:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:26] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5917 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 9086 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15025ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 15025ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15209 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-11 finished in 15300 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)||G(p1))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 139 transition count 152
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 80 place count 107 transition count 136
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 80 place count 107 transition count 122
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 108 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 92 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 92 transition count 106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 118 place count 84 transition count 98
Iterating global reduction 2 with 8 rules applied. Total rules applied 126 place count 84 transition count 98
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 78 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 78 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 72 transition count 80
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 72 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 156 place count 72 transition count 74
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 156 place count 72 transition count 68
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 168 place count 66 transition count 68
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 205 place count 47 transition count 50
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 215 place count 42 transition count 45
Applied a total of 215 rules in 18 ms. Remains 42 /139 variables (removed 97) and now considering 45/184 (removed 139) transitions.
// Phase 1: matrix 45 rows 42 cols
[2025-06-07 05:28:41] [INFO ] Computed 17 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 05:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:41] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:28:41] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-07 05:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 45/87 variables, 42/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 59 constraints, problems are : Problem set: 0 solved, 30 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 45/87 variables, 42/59 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 30/89 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 89 constraints, problems are : Problem set: 0 solved, 30 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 996ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 996ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/139 places, 45/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1097 ms. Remains : 42/139 places, 45/184 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 197 ms.
Stack based approach found an accepted trace after 911 steps with 0 reset with depth 912 and stack size 836 in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-12 finished in 1341 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(X(X(G(p0))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 2 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-06-07 05:28:42] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-07 05:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:42] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:28:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5579 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 9136 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14739ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14740ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14920 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-13 finished in 15136 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)||G((p1||F(p0)))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 4 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2025-06-07 05:28:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 05:28:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:28:58] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:28:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5834 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8825 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14683ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14684ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14871 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-14
Product exploration explored 100000 steps with 6792 reset in 179 ms.
Stack based approach found an accepted trace after 83567 steps with 5922 reset with depth 112 and stack size 112 in 150 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-14 finished in 15368 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 U ((p1||X(p1)) U X(p2))))))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 184/184 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 123 transition count 168
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 123 transition count 168
Applied a total of 32 rules in 2 ms. Remains 123 /139 variables (removed 16) and now considering 168/184 (removed 16) transitions.
[2025-06-07 05:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:29:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 05:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:29:13] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-07 05:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/291 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 141 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5937 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 8/123 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 160/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 301 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8998 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14958ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 14958ms
Starting structural reductions in LTL mode, iteration 1 : 123/139 places, 168/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15126 ms. Remains : 123/139 places, 168/184 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N08-LTLFireability-15
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N08-LTLFireability-15 finished in 15374 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(X(F(p0)))&&(p1 U X(G(p2))))||G(F(p0)))))'
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) U p1)||G(p2))) U (X(p4)||p3)))'
[2025-06-07 05:29:28] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
[2025-06-07 05:29:29] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin242640412370028214
[2025-06-07 05:29:29] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2025-06-07 05:29:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:29:29] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2025-06-07 05:29:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:29:29] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2025-06-07 05:29:29] [INFO ] Flatten gal took : 23 ms
[2025-06-07 05:29:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:29:29] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin242640412370028214
Running compilation step : cd /tmp/ltsmin242640412370028214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
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/graph17661188410400475801.txt' '-o' '/tmp/graph17661188410400475801.bin' '-w' '/tmp/graph17661188410400475801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17661188410400475801.bin' '-l' '-1' '-v' '-w' '/tmp/graph17661188410400475801.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:29:29] [INFO ] Decomposing Gal with order
[2025-06-07 05:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:29:29] [INFO ] Removed a total of 173 redundant transitions.
[2025-06-07 05:29:29] [INFO ] Flatten gal took : 15 ms
[2025-06-07 05:29:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 5 ms.
[2025-06-07 05:29:29] [INFO ] Time to serialize gal into /tmp/LTLFireability16303440651237041003.gal : 2 ms
[2025-06-07 05:29:29] [INFO ] Time to serialize properties into /tmp/LTLFireability13026677479936439248.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/LTLFireability16303440651237041003.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13026677479936439248.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...278
Read 2 LTL properties
Checking formula 0 : !((F(((X(X(F("(((((((i2.i1.u7.IdleTechs_0>=1)&&(i6.u28.OpenRequests_4_0>=1))&&(i3.u9.Idles>=1))||(((i3.u19.IdleTechs_1>=1)&&(i0.i0.u4....6411
Formula 0 simplified : G(FG!"(((((((i2.i1.u7.IdleTechs_0>=1)&&(i6.u28.OpenRequests_4_0>=1))&&(i3.u9.Idles>=1))||(((i3.u19.IdleTechs_1>=1)&&(i0.i0.u4.OpenRe...6394
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin242640412370028214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin242640412370028214;'/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(X(<>((LTLAPp0==true))))&&((LTLAPp1==true) U X([]((LTLAPp2==true)))))||[](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 64261 ms.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin242640412370028214;'/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' '([](((<>((LTLAPp3==true)) U (LTLAPp4==true))||[]((LTLAPp1==true)))) U (X((LTLAPp6==true))||(LTLAPp5==true)))' '--buchi-type=spotba'
38 unique states visited
21 strongly connected components in search stack
38 transitions explored
21 items max in DFS search stack
4029 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,40.3167,498444,1,0,646081,570,1795,2.09434e+06,165,2451,549944
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !(((G(((F("((((i0.i0.u4.ControlRoomDispatch_7>=1)||(i7.i1.u30.ControlRoomDispatch_6>=1))||((i2.i1.u2.ControlRoomDispatch_1>=1)||(i1.i0...4419
Formula 1 simplified : F((G!"((((i0.i0.u4.ControlRoomDispatch_7>=1)||(i7.i1.u30.ControlRoomDispatch_6>=1))||((i2.i1.u2.ControlRoomDispatch_1>=1)||(i1.i0.u2...4409
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( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: LTL layer: formula: ([](((<>((LTLAPp3==true)) U (LTLAPp4==true))||[]((LTLAPp1==true)))) U (X((LTLAPp6==true))||(LTLAPp5==true)))
pins2lts-mc-linux64( 5/ 8), 0.003: "([](((<>((LTLAPp3==true)) U (LTLAPp4==true))||[]((LTLAPp1==true)))) U (X((LTLAPp6==true))||(LTLAPp5==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.091: DFS-FIFO for weak LTL, using special progress label 192
pins2lts-mc-linux64( 0/ 8), 0.091: There are 193 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.091: State length is 140, there are 207 groups
pins2lts-mc-linux64( 0/ 8), 0.091: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.091: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.091: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.091: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.153: ~54 levels ~960 states ~4624 transitions
pins2lts-mc-linux64( 5/ 8), 0.161: ~54 levels ~1920 states ~5456 transitions
pins2lts-mc-linux64( 5/ 8), 0.184: ~54 levels ~3840 states ~7736 transitions
pins2lts-mc-linux64( 5/ 8), 0.218: ~54 levels ~7680 states ~12592 transitions
pins2lts-mc-linux64( 0/ 8), 0.301: ~72 levels ~15360 states ~23352 transitions
pins2lts-mc-linux64( 0/ 8), 0.428: ~72 levels ~30720 states ~43080 transitions
pins2lts-mc-linux64( 0/ 8), 0.663: ~72 levels ~61440 states ~83872 transitions
pins2lts-mc-linux64( 6/ 8), 1.045: ~70 levels ~122880 states ~170920 transitions
pins2lts-mc-linux64( 6/ 8), 1.670: ~70 levels ~245760 states ~345248 transitions
pins2lts-mc-linux64( 0/ 8), 2.768: ~72 levels ~491520 states ~701536 transitions
pins2lts-mc-linux64( 6/ 8), 4.338: ~70 levels ~983040 states ~1464008 transitions
pins2lts-mc-linux64( 6/ 8), 7.170: ~70 levels ~1966080 states ~3100112 transitions
pins2lts-mc-linux64( 4/ 8), 12.597: ~70 levels ~3932160 states ~6237160 transitions
pins2lts-mc-linux64( 4/ 8), 23.707: ~70 levels ~7864320 states ~13876752 transitions
pins2lts-mc-linux64( 4/ 8), 47.528: ~70 levels ~15728640 states ~29400192 transitions
pins2lts-mc-linux64( 1/ 8), 96.745: ~70 levels ~31457280 states ~62353648 transitions
pins2lts-mc-linux64( 1/ 8), 198.830: ~70 levels ~62914560 states ~136360088 transitions
pins2lts-mc-linux64( 1/ 8), 419.601: ~70 levels ~125829120 states ~299753048 transitions
pins2lts-mc-linux64( 1/ 8), 437.042: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 437.535:
pins2lts-mc-linux64( 0/ 8), 437.535: mean standard work distribution: 1.6% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 437.536:
pins2lts-mc-linux64( 0/ 8), 437.536: Explored 126203550 states 311655044 transitions, fanout: 2.469
pins2lts-mc-linux64( 0/ 8), 437.536: Total exploration time 437.420 sec (436.950 sec minimum, 437.025 sec on average)
pins2lts-mc-linux64( 0/ 8), 437.536: States per second: 288518, Transitions per second: 712485
pins2lts-mc-linux64( 0/ 8), 437.536:
pins2lts-mc-linux64( 0/ 8), 437.536: Progress states detected: 892062
pins2lts-mc-linux64( 0/ 8), 437.536: Redundant explorations: -0.7037
pins2lts-mc-linux64( 0/ 8), 437.536:
pins2lts-mc-linux64( 0/ 8), 437.536: Queue width: 8B, total height: 892553, memory: 6.81MB
pins2lts-mc-linux64( 0/ 8), 437.536: Tree memory: 1225.7MB, 10.1 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 437.536: Tree fill ratio (roots/leafs): 94.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 437.536: Stored 207 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 437.536: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 437.536: Est. total memory use: 1232.5MB (~1030.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin242640412370028214;'/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' '([](((<>((LTLAPp3==true)) U (LTLAPp4==true))||[]((LTLAPp1==true)))) U (X((LTLAPp6==true))||(LTLAPp5==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin242640412370028214;'/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' '([](((<>((LTLAPp3==true)) U (LTLAPp4==true))||[]((LTLAPp1==true)))) U (X((LTLAPp6==true))||(LTLAPp5==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)
906 unique states visited
0 strongly connected components in search stack
1198 transitions explored
79 items max in DFS search stack
31583 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,356.153,2420332,1,0,3.43965e+06,689,1594,7.04116e+06,142,3192,760173
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T3N08-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1059676 ms.

BK_STOP 1749274806245

--------------------
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="UtilityControlRoom-PT-Z2T3N08"
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 UtilityControlRoom-PT-Z2T3N08, 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 r240-tall-174915590400788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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