Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 31K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 39K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 159K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 57K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 282K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 414K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K 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 116K 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-Z2T4N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749275346410

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-Z2T4N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 05:49:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 05:49:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 05:49:08] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-07 05:49:08] [INFO ] Transformed 174 places.
[2025-06-07 05:49:08] [INFO ] Transformed 270 transitions.
[2025-06-07 05:49:08] [INFO ] Parsed PT model containing 174 places and 270 transitions and 850 arcs in 177 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 1 formulas.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 147 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 9 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2025-06-07 05:49:08] [INFO ] Computed 23 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:49:08] [INFO ] Implicit Places using invariants in 278 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 346 ms. Remains : 173/174 places, 230/230 transitions.
Support contains 147 out of 173 places after structural reductions.
[2025-06-07 05:49:08] [INFO ] Flatten gal took : 48 ms
[2025-06-07 05:49:08] [INFO ] Flatten gal took : 31 ms
[2025-06-07 05:49:08] [INFO ] Input system was already deterministic with 230 transitions.
Reduction of identical properties reduced properties to check from 33 to 30
RANDOM walk for 40000 steps (8 resets) in 1324 ms. (30 steps per ms) remains 1/30 properties
BEST_FIRST walk for 15656 steps (3 resets) in 42 ms. (364 steps per ms) remains 0/1 properties
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(((p0&&(p0 U !p1)&&X(X(G(!p0)))) U p2))'
Support contains 43 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 13 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 05:49:10] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:49:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 05:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:49:10] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9237 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17376 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26759ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 26776ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27046 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p2), true, p1, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-01 finished in 27418 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((X(p1)||p0))))'
Support contains 20 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 14 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2025-06-07 05:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:49:37] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 05:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:49:37] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8538 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17157 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25764ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25765ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25975 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-02 finished in 26103 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 23 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 103 transition count 140
Applied a total of 160 rules in 48 ms. Remains 103 /173 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 103 cols
[2025-06-07 05:50:03] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 05:50:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:03] [INFO ] Implicit Places using invariants and state equation in 87 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:50:03] [INFO ] Redundant transitions in 5 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-07 05:50: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/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3369 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4693 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8089ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/173 places, 140/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8286 ms. Remains : 103/173 places, 140/230 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-03
Product exploration explored 100000 steps with 40391 reset in 474 ms.
Product exploration explored 100000 steps with 40353 reset in 391 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 : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 218 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
[2025-06-07 05:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:50:13] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2025-06-07 05:50:13] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-07 05:50:13] [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:50:13] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2025-06-07 05:50:13] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-06-07 05:50:13] [INFO ] Computed and/alt/rep : 110/200/110 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-07 05:50:14] [INFO ] Added : 65 causal constraints over 13 iterations in 171 ms. Result :sat
Could not prove EG p0
Support contains 23 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 140/140 transitions.
Applied a total of 0 rules in 14 ms. Remains 103 /103 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-07 05:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:14] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-07 05:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:14] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:50:14] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-07 05:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3345 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4761 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8195ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8195ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8460 ms. Remains : 103/103 places, 140/140 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 : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[p0]
Stuttering acceptance computed with spot in 48 ms :[p0]
[2025-06-07 05:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:50:23] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2025-06-07 05:50:23] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-07 05:50:23] [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:50:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2025-06-07 05:50:23] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-07 05:50:23] [INFO ] Computed and/alt/rep : 110/200/110 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-07 05:50:23] [INFO ] Added : 65 causal constraints over 13 iterations in 171 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 40 ms :[p0]
Product exploration explored 100000 steps with 40440 reset in 352 ms.
Product exploration explored 100000 steps with 40381 reset in 373 ms.
Built C files in :
/tmp/ltsmin6644112652449198425
[2025-06-07 05:50:24] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-06-07 05:50:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:50:24] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-06-07 05:50:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:50:24] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-06-07 05:50:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 05:50:24] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6644112652449198425
Running compilation step : cd /tmp/ltsmin6644112652449198425;'/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 441 ms.
Running link step : cd /tmp/ltsmin6644112652449198425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6644112652449198425;'/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/stateBased575128297525116710.hoa' '--buchi-type=spotba'
LTSmin run took 1561 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-03 finished in 23165 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(p1)&&F(p2))||p0)) U p3)&&F(p4))))'
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 9 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 05:50:26] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 05:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:26] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:50: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/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8758 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17534 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26331ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 26332ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26488 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p4) (NOT p3)), (OR (NOT p4) (NOT p3)), (NOT p4), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-04
Product exploration explored 100000 steps with 18981 reset in 259 ms.
Product exploration explored 100000 steps with 18942 reset in 372 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 p4) p3 p0 (NOT p2) (NOT p1)), (X p3), (X (NOT p4)), (X (X (NOT p2))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p4))), (X (X p4))]
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 7 states, 10 edges and 5 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p4), (NOT p4), (NOT p4)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p4) p3 p0 (NOT p2) (NOT p1)), (X p3), (X (NOT p4)), (X (X (NOT p2))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p4))), (X (X p4)), (F p4)]
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p4), (NOT p4), (NOT p4)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p4), (NOT p4), (NOT p4)]
[2025-06-07 05:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:50:55] [INFO ] [Real]Absence check using 22 positive place invariants in 40 ms returned sat
[2025-06-07 05:50:55] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-06-07 05:50:55] [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:50:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 26 ms returned sat
[2025-06-07 05:50:56] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2025-06-07 05:50:56] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 05:50:56] [INFO ] Added : 110 causal constraints over 22 iterations in 407 ms. Result :sat
Could not prove EG (NOT p4)
Support contains 23 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2025-06-07 05:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 05:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:50:56] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8736 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17358 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26135ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 26136ms
Finished structural reductions in LTL mode , in 1 iterations and 26295 ms. Remains : 153/153 places, 210/210 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 : [(NOT p4)]
False Knowledge obtained : [(X (X (NOT p4))), (X (X p4))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p4), (NOT p4), (NOT p4)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p4)]
False Knowledge obtained : [(X (X (NOT p4))), (X (X p4)), (F p4)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p4), (NOT p4), (NOT p4)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p4), (NOT p4), (NOT p4)]
[2025-06-07 05:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:51:23] [INFO ] [Real]Absence check using 22 positive place invariants in 40 ms returned sat
[2025-06-07 05:51:24] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2025-06-07 05:51:24] [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:51:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 26 ms returned sat
[2025-06-07 05:51:24] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-06-07 05:51:24] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 05:51:24] [INFO ] Added : 110 causal constraints over 22 iterations in 412 ms. Result :sat
Could not prove EG (NOT p4)
Stuttering acceptance computed with spot in 113 ms :[(NOT p4), (NOT p4), (NOT p4)]
Product exploration explored 100000 steps with 18957 reset in 224 ms.
Product exploration explored 100000 steps with 18955 reset in 231 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(NOT p4), (NOT p4), (NOT p4)]
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 230
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 60 place count 153 transition count 210
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 60 rules in 19 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:51:25] [INFO ] Redundant transitions in 7 ms returned []
Running 200 sub problems to find dead transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 05:51:25] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:51:26] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 10/153 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:51:28] [INFO ] Deduced a trap composed of 9 places in 30 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:51:28] [INFO ] Deduced a trap composed of 9 places in 26 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:51:28] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 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:51:28] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 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:51:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 2 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:51:28] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 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:51:28] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:51:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:51:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:51:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 10/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 210/363 variables, 153/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 186 constraints, problems are : Problem set: 60 solved, 140 unsolved in 8064 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 50/153 variables, 22/23 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 10/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 210/363 variables, 153/186 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 140/326 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/326 constraints. Problems are: Problem set: 60 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/326 constraints. Problems are: Problem set: 60 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 326 constraints, problems are : Problem set: 60 solved, 140 unsolved in 10912 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 140/200 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19002ms problems are : Problem set: 60 solved, 140 unsolved
Search for dead transitions found 60 dead transitions in 19004ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 150/210 transitions.
Graph (complete) has 250 edges and 153 vertex of which 113 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 113 /153 variables (removed 40) and now considering 150/150 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/153 places, 150/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19063 ms. Remains : 113/153 places, 150/210 transitions.
Built C files in :
/tmp/ltsmin7123821182993292214
[2025-06-07 05:51:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7123821182993292214
Running compilation step : cd /tmp/ltsmin7123821182993292214;'/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 318 ms.
Running link step : cd /tmp/ltsmin7123821182993292214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7123821182993292214;'/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/stateBased7937348273312967056.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 05:52:00] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:52:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 05:52:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:52:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:52:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8392 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17076 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25506ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25507ms
Finished structural reductions in LTL mode , in 1 iterations and 25675 ms. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin16289810337543725147
[2025-06-07 05:52:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16289810337543725147
Running compilation step : cd /tmp/ltsmin16289810337543725147;'/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 373 ms.
Running link step : cd /tmp/ltsmin16289810337543725147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16289810337543725147;'/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/stateBased7843047241055601861.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 05:52:40] [INFO ] Flatten gal took : 11 ms
[2025-06-07 05:52:40] [INFO ] Flatten gal took : 11 ms
[2025-06-07 05:52:40] [INFO ] Time to serialize gal into /tmp/LTL5446404225262648494.gal : 3 ms
[2025-06-07 05:52:40] [INFO ] Time to serialize properties into /tmp/LTL13584826046033210602.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/LTL5446404225262648494.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4363380467043917076.hoa' '-atoms' '/tmp/LTL13584826046033210602.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...318
Loading property file /tmp/LTL13584826046033210602.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4363380467043917076.hoa
Detected timeout of ITS tools.
[2025-06-07 05:52:55] [INFO ] Flatten gal took : 10 ms
[2025-06-07 05:52:55] [INFO ] Flatten gal took : 10 ms
[2025-06-07 05:52:55] [INFO ] Time to serialize gal into /tmp/LTL17941856870393601257.gal : 3 ms
[2025-06-07 05:52:55] [INFO ] Time to serialize properties into /tmp/LTL10754053365013066479.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/LTL17941856870393601257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10754053365013066479.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(((X((((((X("(((((Finished_6>=1)||(Finished_7>=1))||((Finished_4>=1)||(Finished_5>=1)))||(((Finished_8>=1)||(Finished_9>=1))||((Fi...2816
Formula 0 simplified : X(G!"((((((((IdleTechs_1>=1)&&(OpenRequests_2_1>=1))&&(Idles>=1))||(((IdleTechs_1>=1)&&(OpenRequests_3_1>=1))&&(Idles>=1)))||((((Idl...2983
Detected timeout of ITS tools.
[2025-06-07 05:53:11] [INFO ] Flatten gal took : 10 ms
[2025-06-07 05:53:11] [INFO ] Applying decomposition
[2025-06-07 05:53:11] [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/graph7419583477595588612.txt' '-o' '/tmp/graph7419583477595588612.bin' '-w' '/tmp/graph7419583477595588612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7419583477595588612.bin' '-l' '-1' '-v' '-w' '/tmp/graph7419583477595588612.weights' '-q' '0' '-e' '0.001'
[2025-06-07 05:53:11] [INFO ] Decomposing Gal with order
[2025-06-07 05:53:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 05:53:11] [INFO ] Removed a total of 240 redundant transitions.
[2025-06-07 05:53:11] [INFO ] Flatten gal took : 59 ms
[2025-06-07 05:53:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 12 ms.
[2025-06-07 05:53:11] [INFO ] Time to serialize gal into /tmp/LTL17698601495896123199.gal : 5 ms
[2025-06-07 05:53:11] [INFO ] Time to serialize properties into /tmp/LTL18317099657338209880.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/LTL17698601495896123199.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18317099657338209880.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(((X((((((X("(((((i2.i1.u43.Finished_6>=1)||(i4.i1.u4.Finished_7>=1))||((i9.i1.u42.Finished_4>=1)||(i0.i0.u3.Finished_5>=1)))||(((...4090
Formula 0 simplified : X(G!"((((((((i1.i0.u13.IdleTechs_1>=1)&&(i1.i0.u7.OpenRequests_2_1>=1))&&(i6.i0.u23.Idles>=1))||(((i1.i0.u13.IdleTechs_1>=1)&&(i5.i0...4351
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
10 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,0.134583,23460,1,0,10804,331,1887,16014,161,780,21900
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-04 finished in 164695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p1))&&p0)))'
Support contains 70 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 133 transition count 190
Applied a total of 80 rules in 13 ms. Remains 133 /173 variables (removed 40) and now considering 190/230 (removed 40) transitions.
// Phase 1: matrix 190 rows 133 cols
[2025-06-07 05:53:11] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:53:11] [INFO ] Implicit Places using invariants in 94 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/173 places, 190/230 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 132/173 places, 190/230 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 393 ms.
Stack based approach found an accepted trace after 4231 steps with 0 reset with depth 4232 and stack size 4231 in 24 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-05 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F((F(p2)&&p1)))))))'
Support contains 63 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2025-06-07 05:53:12] [INFO ] Computed 22 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:53:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 05:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:53:12] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 05:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10349 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 15800 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26184ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 26185ms
Finished structural reductions in LTL mode , in 1 iterations and 26413 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-06
Product exploration explored 100000 steps with 26060 reset in 385 ms.
Product exploration explored 100000 steps with 26079 reset in 380 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) p1 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 2123 steps (0 resets) in 22 ms. (92 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 63 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-07 05:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:53:40] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 05:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:53:40] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 05:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10956 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 15934 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26933ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 26933ms
Finished structural reductions in LTL mode , in 1 iterations and 27101 ms. Remains : 173/173 places, 230/230 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) p2 p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
RANDOM walk for 1353 steps (0 resets) in 27 ms. (48 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p2 p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 246 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 26101 reset in 309 ms.
Product exploration explored 100000 steps with 26070 reset in 322 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 63 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 173 transition count 250
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 250
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 20 rules in 10 ms. Remains 173 /173 variables (removed 0) and now considering 250/230 (removed -20) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:54:09] [INFO ] Redundant transitions in 3 ms returned []
Running 240 sub problems to find dead transitions.
// Phase 1: matrix 250 rows 173 cols
[2025-06-07 05:54:09] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:11] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 10/173 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:13] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:13] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:13] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:14] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 2 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:14] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:14] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 2 ms to minimize.
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:54:14] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 10/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 250/423 variables, 173/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 206 constraints, problems are : Problem set: 40 solved, 200 unsolved in 11928 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 30/173 variables, 22/23 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 10/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 250/423 variables, 173/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 200/406 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/406 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/406 constraints. Problems are: Problem set: 40 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 406 constraints, problems are : Problem set: 40 solved, 200 unsolved in 19817 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 200/240 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31789ms problems are : Problem set: 40 solved, 200 unsolved
Search for dead transitions found 40 dead transitions in 31790ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 173/173 places, 210/230 transitions.
Graph (complete) has 390 edges and 173 vertex of which 153 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 153 /173 variables (removed 20) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 153/173 places, 210/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31825 ms. Remains : 153/173 places, 210/230 transitions.
Built C files in :
/tmp/ltsmin3212383453080267169
[2025-06-07 05:54:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3212383453080267169
Running compilation step : cd /tmp/ltsmin3212383453080267169;'/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 361 ms.
Running link step : cd /tmp/ltsmin3212383453080267169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3212383453080267169;'/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/stateBased16956550284004573628.hoa' '--buchi-type=spotba'
LTSmin run took 4955 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-06 finished in 94686 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(p0)||((!p1&&X(p2)) U X(X(G(!p3))))))'
Support contains 80 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2025-06-07 05:54:46] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:54:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-07 05:54:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:54:46] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 05:54:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10797 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 16296 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27128ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 27129ms
Finished structural reductions in LTL mode , in 1 iterations and 27362 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) p3), p3, p3, (AND (NOT p0) p3), p3, true, (AND p3 (NOT p2)), p3, (AND p3 (NOT p0)), (AND (NOT p0) p3), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-07 finished in 27771 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)))&&(G(!p1) U X(p2))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Applied a total of 38 rules in 7 ms. Remains 154 /173 variables (removed 19) and now considering 211/230 (removed 19) transitions.
// Phase 1: matrix 211 rows 154 cols
[2025-06-07 05:55:14] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:55:14] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-07 05:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:55:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-07 05:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 211/365 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 176 constraints, problems are : Problem set: 0 solved, 201 unsolved in 8729 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 211/365 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 201/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 377 constraints, problems are : Problem set: 0 solved, 201 unsolved in 12175 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20947ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 20948ms
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 211/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21159 ms. Remains : 154/173 places, 211/230 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 199 ms.
Stack based approach found an accepted trace after 5902 steps with 0 reset with depth 5903 and stack size 5901 in 18 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-08 finished in 21599 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(((X(p0) U p1)&&F(F(X(p2))))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 4 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 05:55:36] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:55:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 05:55:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:55:36] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:55:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8459 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17164 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25661ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25663ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25883 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-09 finished in 26051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&(G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&F(!p2)))) U ((G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&F(!p2)))&&p3))))'
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Applied a total of 38 rules in 7 ms. Remains 154 /173 variables (removed 19) and now considering 211/230 (removed 19) transitions.
// Phase 1: matrix 211 rows 154 cols
[2025-06-07 05:56:02] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:56:02] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 05:56:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:56:02] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-07 05:56:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 211/365 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 176 constraints, problems are : Problem set: 0 solved, 201 unsolved in 8542 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 211/365 variables, 154/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 201/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 377 constraints, problems are : Problem set: 0 solved, 201 unsolved in 18015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26591ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 26593ms
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 211/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26792 ms. Remains : 154/173 places, 211/230 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-10 finished in 27035 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||F(p1)))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 100 place count 133 transition count 152
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 136 place count 115 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 114 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 114 transition count 132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 148 place count 104 transition count 122
Iterating global reduction 2 with 10 rules applied. Total rules applied 158 place count 104 transition count 122
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 167 place count 95 transition count 104
Iterating global reduction 2 with 9 rules applied. Total rules applied 176 place count 95 transition count 104
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 185 place count 86 transition count 95
Iterating global reduction 2 with 9 rules applied. Total rules applied 194 place count 86 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 203 place count 86 transition count 86
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 203 place count 86 transition count 77
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 221 place count 77 transition count 77
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 264 place count 55 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 282 place count 46 transition count 47
Applied a total of 282 rules in 26 ms. Remains 46 /173 variables (removed 127) and now considering 47/230 (removed 183) transitions.
// Phase 1: matrix 47 rows 46 cols
[2025-06-07 05:56:29] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:56:29] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 05:56:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:56:29] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:56:29] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-07 05:56: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/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 10/46 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 47/93 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 67 constraints, problems are : Problem set: 0 solved, 27 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 10/46 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 47/93 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 94 constraints, problems are : Problem set: 0 solved, 27 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 905ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 906ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/173 places, 47/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1020 ms. Remains : 46/173 places, 47/230 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-12
Product exploration explored 100000 steps with 125 reset in 174 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-12 finished in 1276 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((p0 U (X((X(!p1)&&F(p2)))||F(p3)))))'
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 4 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 05:56:30] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:56:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-07 05:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:56:30] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:56: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/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8778 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17203 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26022ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 26022ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26231 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-13
Product exploration explored 100000 steps with 2626 reset in 205 ms.
Product exploration explored 100000 steps with 2603 reset in 215 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 p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p3) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 447 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
RANDOM walk for 3896 steps (0 resets) in 38 ms. (99 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X p0), (X (NOT p0)), (X (X (AND (NOT p3) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p3 p2))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F (NOT (OR (NOT p0) p3))), (F p3), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F p1), (F (NOT (OR p0 (NOT p1) p3))), (F p0)]
Knowledge based reduction with 8 factoid took 947 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
[2025-06-07 05:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:56:59] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2025-06-07 05:57:00] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-06-07 05:57:00] [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:57:00] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2025-06-07 05:57:00] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2025-06-07 05:57:00] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-07 05:57:00] [INFO ] Added : 57 causal constraints over 12 iterations in 185 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2025-06-07 05:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:57:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 05:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:57:00] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:57:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8692 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17158 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25881ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25881ms
Finished structural reductions in LTL mode , in 1 iterations and 26050 ms. Remains : 153/153 places, 210/210 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 p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3)))))]
False Knowledge obtained : [(X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 565 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
RANDOM walk for 3655 steps (0 resets) in 28 ms. (126 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p3)))))]
False Knowledge obtained : [(X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p3 p2))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F (NOT (OR (NOT p0) p3))), (F p3), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F p1), (F (NOT (OR p0 (NOT p1) p3))), (F p0)]
Knowledge based reduction with 8 factoid took 962 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 353 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
[2025-06-07 05:57:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 05:57:29] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2025-06-07 05:57:29] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-07 05:57:29] [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:57:29] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2025-06-07 05:57:29] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-06-07 05:57:29] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 05:57:29] [INFO ] Added : 57 causal constraints over 12 iterations in 170 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 2640 reset in 200 ms.
Product exploration explored 100000 steps with 2641 reset in 209 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, true]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p3) p1), (AND (NOT p3) (NOT p2)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (NOT p3)]
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 153 transition count 229
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 153 transition count 229
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 0 with 36 rules applied. Total rules applied 55 place count 153 transition count 237
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 74 place count 153 transition count 218
Deduced a syphon composed of 55 places in 0 ms
Applied a total of 74 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 218/210 (removed -8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 05:57:30] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
// Phase 1: matrix 218 rows 153 cols
[2025-06-07 05:57:30] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:31] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 10/153 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:33] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:34] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 05:57:34] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 10/33 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 218/371 variables, 153/186 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/186 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/186 constraints. Problems are: Problem set: 82 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 186 constraints, problems are : Problem set: 82 solved, 118 unsolved in 7559 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 82 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 65/153 variables, 22/23 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 10/33 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/33 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 218/371 variables, 153/186 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 118/304 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/304 constraints. Problems are: Problem set: 82 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/304 constraints. Problems are: Problem set: 82 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 304 constraints, problems are : Problem set: 82 solved, 118 unsolved in 11320 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 118/200 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18910ms problems are : Problem set: 82 solved, 118 unsolved
Search for dead transitions found 82 dead transitions in 18912ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 136/210 transitions.
Graph (complete) has 256 edges and 153 vertex of which 98 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.2 ms
Discarding 55 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 98 /153 variables (removed 55) and now considering 136/136 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/153 places, 136/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18940 ms. Remains : 98/153 places, 136/210 transitions.
Built C files in :
/tmp/ltsmin9375497457658545373
[2025-06-07 05:57:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9375497457658545373
Running compilation step : cd /tmp/ltsmin9375497457658545373;'/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 311 ms.
Running link step : cd /tmp/ltsmin9375497457658545373;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9375497457658545373;'/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/stateBased18244899188016094039.hoa' '--buchi-type=spotba'
LTSmin run took 1418 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-13 finished in 81194 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||G(p2))))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 3 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 05:57:51] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:57:51] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 05:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:57:51] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 05:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8813 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 17192 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26052ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 26053ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26257 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-15 finished in 26419 ms.
All properties solved by simple procedures.
Total runtime 550246 ms.

BK_STOP 1749275898108

--------------------
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-Z2T4N10"
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-Z2T4N10, 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-174915590500836"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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