Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.4K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 29K 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-COL-Z4T4N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749269569490

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-COL-Z4T4N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-07 04:12:50] [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 04:12:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 04:12:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-07 04:12:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 04:12:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 617 ms
[2025-06-07 04:12:51] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 228 PT places and 450.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2025-06-07 04:12:51] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 5 ms.
[2025-06-07 04:12:51] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 14 to 10
RANDOM walk for 652 steps (0 resets) in 27 ms. (23 steps per ms) remains 0/10 properties
[2025-06-07 04:12:51] [INFO ] Flatten gal took : 15 ms
[2025-06-07 04:12:52] [INFO ] Flatten gal took : 2 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2025-06-07 04:12:52] [INFO ] Unfolded HLPN to a Petri net with 228 places and 450 transitions 1446 arcs in 22 ms.
[2025-06-07 04:12:52] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
[2025-06-07 04:12:52] [INFO ] Reduced 18 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 197 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 228 /228 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 228 cols
[2025-06-07 04:12:52] [INFO ] Computed 15 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:12:52] [INFO ] Implicit Places using invariants in 282 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 227/228 places, 354/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 347 ms. Remains : 227/228 places, 354/354 transitions.
Support contains 197 out of 227 places after structural reductions.
[2025-06-07 04:12:52] [INFO ] Flatten gal took : 35 ms
[2025-06-07 04:12:52] [INFO ] Flatten gal took : 52 ms
[2025-06-07 04:12:52] [INFO ] Input system was already deterministic with 354 transitions.
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 230 steps (0 resets) in 34 ms. (6 steps per ms) remains 0/11 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&G(!p0))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 128 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 128 transition count 162
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 240 place count 110 transition count 144
Iterating global reduction 2 with 18 rules applied. Total rules applied 258 place count 110 transition count 144
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 295 place count 91 transition count 126
Applied a total of 295 rules in 72 ms. Remains 91 /227 variables (removed 136) and now considering 126/354 (removed 228) transitions.
// Phase 1: matrix 126 rows 91 cols
[2025-06-07 04:12:53] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:12:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 04:12:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:12:53] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:12:53] [INFO ] Redundant transitions in 4 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-07 04:12:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 6/91 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 126/217 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/217 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 104 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3234 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 6/91 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 126/217 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 102/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 206 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3724 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7028ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 7035ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/227 places, 126/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7284 ms. Remains : 91/227 places, 126/354 transitions.
Stuttering acceptance computed with spot in 231 ms :[p0, true, (OR p0 p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-00 finished in 7593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(p0)&&G(p1)))))))'
Support contains 53 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 13 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:13:01] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:01] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-07 04:13:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:01] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:13:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13982 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22762 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36936ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36938ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37232 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-01 finished in 37520 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&&F(G(!p0))))&&(F(!p1)||X(p2))))'
Support contains 35 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 17 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2025-06-07 04:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 04:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:13:38] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13887 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23118 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37122ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 37123ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37327 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, true, (AND p1 (NOT p2)), true, p0, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-02 finished in 37550 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(F(p0)))))'
Support contains 29 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 6 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2025-06-07 04:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:14:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 04:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:14:16] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13741 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22824 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36687ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36688ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36888 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-03
Product exploration explored 100000 steps with 16465 reset in 317 ms.
Product exploration explored 100000 steps with 16332 reset in 276 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 : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 29 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-07 04:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:14:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 04:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:14:54] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13835 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22582 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36503ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36504ms
Finished structural reductions in LTL mode , in 1 iterations and 36699 ms. Remains : 155/155 places, 282/282 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 : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16285 reset in 239 ms.
Product exploration explored 100000 steps with 16394 reset in 279 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 29 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 155 transition count 306
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 306
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 306
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 72 place count 155 transition count 282
Deduced a syphon composed of 48 places in 4 ms
Applied a total of 72 rules in 25 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:15:32] [INFO ] Redundant transitions in 12 ms returned []
Running 276 sub problems to find dead transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:15:32] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:34] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 6/155 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:36] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:36] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:36] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:36] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:15:37] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
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
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 6/21 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 282/437 variables, 155/176 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/176 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/176 constraints. Problems are: Problem set: 72 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 176 constraints, problems are : Problem set: 72 solved, 204 unsolved in 12495 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 72 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 54/155 variables, 14/15 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/21 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 282/437 variables, 155/176 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 204/380 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/380 constraints. Problems are: Problem set: 72 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/437 variables, 0/380 constraints. Problems are: Problem set: 72 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 380 constraints, problems are : Problem set: 72 solved, 204 unsolved in 27755 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 204/276 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40317ms problems are : Problem set: 72 solved, 204 unsolved
Search for dead transitions found 72 dead transitions in 40319ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/155 places, 210/282 transitions.
Graph (complete) has 318 edges and 155 vertex of which 107 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.6 ms
Discarding 48 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 107 /155 variables (removed 48) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/155 places, 210/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40379 ms. Remains : 107/155 places, 210/282 transitions.
Built C files in :
/tmp/ltsmin14146235272546775577
[2025-06-07 04:16:13] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14146235272546775577
Running compilation step : cd /tmp/ltsmin14146235272546775577;'/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 611 ms.
Running link step : cd /tmp/ltsmin14146235272546775577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin14146235272546775577;'/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/stateBased1069488940517322409.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 29 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:16:28] [INFO ] Computed 14 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:16:28] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-07 04:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:16:28] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13696 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22685 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36492ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36493ms
Finished structural reductions in LTL mode , in 1 iterations and 36708 ms. Remains : 155/155 places, 282/282 transitions.
Built C files in :
/tmp/ltsmin2826184799607778400
[2025-06-07 04:17:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2826184799607778400
Running compilation step : cd /tmp/ltsmin2826184799607778400;'/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 414 ms.
Running link step : cd /tmp/ltsmin2826184799607778400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2826184799607778400;'/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/stateBased16949337528109666469.hoa' '--buchi-type=spotba'
LTSmin run took 1991 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-03 finished in 171241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 131 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 227 transition count 330
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 203 transition count 330
Applied a total of 48 rules in 13 ms. Remains 203 /227 variables (removed 24) and now considering 330/354 (removed 24) transitions.
// Phase 1: matrix 330 rows 203 cols
[2025-06-07 04:17:07] [INFO ] Computed 14 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:17:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 04:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:17:07] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:17:07] [INFO ] Redundant transitions in 13 ms returned []
Running 324 sub problems to find dead transitions.
[2025-06-07 04:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 6/203 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 330/533 variables, 203/217 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/533 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 533/533 variables, and 217 constraints, problems are : Problem set: 0 solved, 324 unsolved in 20698 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 6/203 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 330/533 variables, 203/217 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 324/541 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 533/533 variables, and 541 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50812ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 50812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 203/227 places, 330/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51054 ms. Remains : 203/227 places, 330/354 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-04
Product exploration explored 100000 steps with 9110 reset in 436 ms.
Stack based approach found an accepted trace after 9464 steps with 826 reset with depth 10 and stack size 10 in 51 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-04 finished in 51630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p1)||p0))))'
Support contains 29 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 227 transition count 258
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 216 place count 131 transition count 234
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 216 place count 131 transition count 210
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 264 place count 107 transition count 210
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 276 place count 101 transition count 204
Applied a total of 276 rules in 18 ms. Remains 101 /227 variables (removed 126) and now considering 204/354 (removed 150) transitions.
// Phase 1: matrix 204 rows 101 cols
[2025-06-07 04:17:58] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:17:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 04:17:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:17:59] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:17:59] [INFO ] Redundant transitions in 2 ms returned []
Running 174 sub problems to find dead transitions.
[2025-06-07 04:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 6/101 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 204/305 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/305 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 115 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5991 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 6/101 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 204/305 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 174/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 289 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9651 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15705ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 15706ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/227 places, 204/354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15865 ms. Remains : 101/227 places, 204/354 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-05
Product exploration explored 100000 steps with 3159 reset in 647 ms.
Product exploration explored 100000 steps with 3171 reset in 661 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 395 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 37 steps (0 resets) in 5 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 483 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 29 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2025-06-07 04:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:18:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 04:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:18:17] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:18:17] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2025-06-07 04:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 6/101 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 204/305 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/305 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 115 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6151 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 6/101 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 204/305 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 174/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 289 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9554 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15778ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 15779ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15940 ms. Remains : 101/101 places, 204/204 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 p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 87 steps (0 resets) in 7 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 420 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 3266 reset in 643 ms.
Product exploration explored 100000 steps with 3158 reset in 647 ms.
Built C files in :
/tmp/ltsmin6683635154196593858
[2025-06-07 04:18:35] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2025-06-07 04:18:35] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:18:35] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2025-06-07 04:18:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:18:35] [INFO ] Computing Do-Not-Accords matrix : 204 transitions.
[2025-06-07 04:18:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:18:35] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6683635154196593858
Running compilation step : cd /tmp/ltsmin6683635154196593858;'/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/ltsmin6683635154196593858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6683635154196593858;'/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/stateBased17794748103544702207.hoa' '--buchi-type=spotba'
LTSmin run took 803 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-05 finished in 38074 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 U G(!p1)) U p2)&&F((!p1&&X(X(p3)))))))'
Support contains 71 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 4 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:18:37] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:18:37] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 04:18:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:18:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:18: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/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13796 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22813 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36710ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36711ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36874 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3) p1), true, p1, (NOT p2), (OR (NOT p3) p1), p1, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-06 finished in 37314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0) U X(X((!p1&&X((!p1 U (!p2||G(!p1))))))))))'
Support contains 65 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 6 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2025-06-07 04:19:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:19:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 04:19:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:19:14] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:19: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/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13715 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36842ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36843ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36986 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 414 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-07
Product exploration explored 100000 steps with 13589 reset in 877 ms.
Product exploration explored 100000 steps with 13496 reset in 881 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
RANDOM walk for 116 steps (0 resets) in 10 ms. (10 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 493 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
Stuttering acceptance computed with spot in 411 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
Support contains 65 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-07 04:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:19:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 04:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:19:55] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:19:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13894 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37037ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 37038ms
Finished structural reductions in LTL mode , in 1 iterations and 37186 ms. Remains : 155/155 places, 282/282 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 p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
RANDOM walk for 172 steps (0 resets) in 14 ms. (11 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 495 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 398 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
Stuttering acceptance computed with spot in 390 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
Stuttering acceptance computed with spot in 385 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
Product exploration explored 100000 steps with 13551 reset in 875 ms.
Product exploration explored 100000 steps with 13579 reset in 888 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 404 ms :[p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), p0]
Support contains 65 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 282
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 48 place count 155 transition count 258
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 48 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 258/282 (removed 24) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:20:37] [INFO ] Redundant transitions in 0 ms returned []
Running 252 sub problems to find dead transitions.
// Phase 1: matrix 258 rows 155 cols
[2025-06-07 04:20:37] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:20:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:20:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:20:39] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:20:39] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:20:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:20:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/20 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 258/413 variables, 155/175 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/175 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/175 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 175 constraints, problems are : Problem set: 24 solved, 228 unsolved in 12138 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 30/155 variables, 14/14 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 6/20 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 258/413 variables, 155/175 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 228/403 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/403 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/403 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 403 constraints, problems are : Problem set: 24 solved, 228 unsolved in 27473 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 228/252 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39673ms problems are : Problem set: 24 solved, 228 unsolved
Search for dead transitions found 24 dead transitions in 39673ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/155 places, 234/282 transitions.
Graph (complete) has 342 edges and 155 vertex of which 131 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 131 /155 variables (removed 24) and now considering 234/234 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 131/155 places, 234/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39698 ms. Remains : 131/155 places, 234/282 transitions.
Built C files in :
/tmp/ltsmin7129363196343271501
[2025-06-07 04:21:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7129363196343271501
Running compilation step : cd /tmp/ltsmin7129363196343271501;'/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 462 ms.
Running link step : cd /tmp/ltsmin7129363196343271501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7129363196343271501;'/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/stateBased6413383293034644002.hoa' '--buchi-type=spotba'
LTSmin run took 96 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-07 finished in 123306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (p1||G(!p0))))))'
Support contains 36 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 3 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:21:17] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:21:17] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-07 04:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:21:17] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13738 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22758 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36600ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36600ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36824 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Product exploration explored 100000 steps with 33333 reset in 204 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 p1 (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-08 finished in 37398 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((G(p0)||F(p1))) U (p2&&G((G(p0)||F(p1)))))))'
Support contains 12 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 4 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
[2025-06-07 04:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:21:55] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-07 04:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:21:55] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13473 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23097 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36657ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36657ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36956 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-09
Product exploration explored 100000 steps with 7294 reset in 219 ms.
Product exploration explored 100000 steps with 7194 reset in 232 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 p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X p0), (X p1)]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X p0), (X p1)]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 351 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2025-06-07 04:22:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:22:33] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2025-06-07 04:22:33] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-06-07 04:22:33] [INFO ] Computed and/alt/rep : 276/462/276 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-07 04:22:33] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 155 transition count 258
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 131 transition count 258
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 156 place count 77 transition count 204
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 180 place count 77 transition count 180
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 74 transition count 108
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 187 place count 73 transition count 108
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 205 place count 55 transition count 72
Iterating global reduction 1 with 18 rules applied. Total rules applied 223 place count 55 transition count 72
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 241 place count 37 transition count 54
Iterating global reduction 1 with 18 rules applied. Total rules applied 259 place count 37 transition count 54
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 277 place count 37 transition count 36
Applied a total of 277 rules in 11 ms. Remains 37 /155 variables (removed 118) and now considering 36/282 (removed 246) transitions.
// Phase 1: matrix 36 rows 37 cols
[2025-06-07 04:22:33] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:22:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-07 04:22:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:22:33] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:22:33] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-07 04:22:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/73 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 50 constraints, problems are : Problem set: 0 solved, 30 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 6/37 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 36/73 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 30/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 80 constraints, problems are : Problem set: 0 solved, 30 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 801ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/155 places, 36/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 897 ms. Remains : 37/155 places, 36/282 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 p1)), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
[2025-06-07 04:22:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:22:35] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-07 04:22:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-07 04:22:35] [INFO ] Computed and/alt/rep : 30/42/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-07 04:22:35] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5346 reset in 144 ms.
Product exploration explored 100000 steps with 5469 reset in 162 ms.
Built C files in :
/tmp/ltsmin3270216389769520481
[2025-06-07 04:22:35] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2025-06-07 04:22:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:22:35] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2025-06-07 04:22:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:22:35] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2025-06-07 04:22:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:22:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3270216389769520481
Running compilation step : cd /tmp/ltsmin3270216389769520481;'/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 110 ms.
Running link step : cd /tmp/ltsmin3270216389769520481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3270216389769520481;'/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/stateBased12374683241415388430.hoa' '--buchi-type=spotba'
LTSmin run took 10466 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-09 finished in 51433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(X(p1)) U ((!p1&&X(X(p1)))||G(X(X(p1))))))||p0)))'
Support contains 24 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 7 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:22:46] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:22:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-07 04:22:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:22:46] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:22: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/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13408 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 23113 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36659ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36660ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36921 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-11 finished in 37166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 96 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 227 transition count 330
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 203 transition count 330
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 120 place count 167 transition count 294
Applied a total of 120 rules in 14 ms. Remains 167 /227 variables (removed 60) and now considering 294/354 (removed 60) transitions.
// Phase 1: matrix 294 rows 167 cols
[2025-06-07 04:23:23] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:23:23] [INFO ] Implicit Places using invariants in 231 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 232 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/227 places, 294/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 166 /166 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 166/227 places, 294/354 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 441 ms.
Stack based approach found an accepted trace after 1441 steps with 0 reset with depth 1442 and stack size 1442 in 7 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-12 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!p0)) U (F(p1) U !p2))||X(X(X(G(p0))))))'
Support contains 126 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 227 cols
[2025-06-07 04:23:24] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:23:24] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-07 04:23:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:23:24] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-07 04:23:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/227 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/581 variables, 227/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 241 constraints, problems are : Problem set: 0 solved, 348 unsolved in 26180 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/227 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/581 variables, 227/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 348/589 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 589 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56306ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 56307ms
Finished structural reductions in LTL mode , in 1 iterations and 56728 ms. Remains : 227/227 places, 354/354 transitions.
Stuttering acceptance computed with spot in 664 ms :[(AND (NOT p1) p0), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND p0 (NOT p1))), (OR (NOT p1) p2), p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p1), false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-14
Product exploration explored 100000 steps with 13117 reset in 990 ms.
Product exploration explored 100000 steps with 13146 reset in 987 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 411 ms. Reduced automaton from 17 states, 57 edges and 3 AP (stutter sensitive) to 9 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
RANDOM walk for 183 steps (0 resets) in 10 ms. (16 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p2 p1 p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2 p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 12 factoid took 919 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 9 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 355 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 126 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2025-06-07 04:24:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:24:26] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-07 04:24:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:24:26] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-07 04:24: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/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/227 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/581 variables, 227/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 241 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25937 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/227 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/581 variables, 227/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 348/589 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 589 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56046ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 56047ms
Finished structural reductions in LTL mode , in 1 iterations and 56459 ms. Remains : 227/227 places, 354/354 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 p1) p2 p0)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 9 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
RANDOM walk for 272 steps (0 resets) in 11 ms. (22 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p1) p2 p0)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p0)), (F (NOT (OR p0 p1 p2))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 366 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 9 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 357 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 334 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 13259 reset in 452 ms.
Product exploration explored 100000 steps with 13250 reset in 455 ms.
Applying partial POR strategy [true, true, true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 327 ms :[p2, (OR (NOT p1) p2), (NOT p1), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 126 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 227 transition count 372
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 36 rules in 13 ms. Remains 227 /227 variables (removed 0) and now considering 372/354 (removed -18) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:25:25] [INFO ] Redundant transitions in 1 ms returned []
Running 348 sub problems to find dead transitions.
// Phase 1: matrix 372 rows 227 cols
[2025-06-07 04:25:25] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:29] [INFO ] Deduced a trap composed of 145 places in 70 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (OVERLAPS) 6/227 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:34] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:34] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:34] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:34] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:34] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:34] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:34] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:35] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:25:35] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 9/24 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/24 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 372/599 variables, 227/251 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/251 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 0/599 variables, 0/251 constraints. Problems are: Problem set: 54 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 251 constraints, problems are : Problem set: 54 solved, 294 unsolved in 25114 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 54 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 42/227 variables, 14/15 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 9/24 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/24 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 372/599 variables, 227/251 constraints. Problems are: Problem set: 54 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 294/545 constraints. Problems are: Problem set: 54 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/599 variables, and 545 constraints, problems are : Problem set: 54 solved, 294 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 294/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55284ms problems are : Problem set: 54 solved, 294 unsolved
Search for dead transitions found 54 dead transitions in 55285ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 227/227 places, 318/354 transitions.
Graph (complete) has 660 edges and 227 vertex of which 191 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 191 /227 variables (removed 36) and now considering 318/318 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 191/227 places, 318/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55314 ms. Remains : 191/227 places, 318/354 transitions.
Built C files in :
/tmp/ltsmin697640734665907104
[2025-06-07 04:26:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin697640734665907104
Running compilation step : cd /tmp/ltsmin697640734665907104;'/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 519 ms.
Running link step : cd /tmp/ltsmin697640734665907104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin697640734665907104;'/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/stateBased18446244423432180844.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 126 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 227 cols
[2025-06-07 04:26:36] [INFO ] Computed 14 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:26:36] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-07 04:26:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:26:36] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-06-07 04:26: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/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/227 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/581 variables, 227/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/581 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 241 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25329 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 6/227 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 354/581 variables, 227/241 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 348/589 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 589 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55465ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 55466ms
Finished structural reductions in LTL mode , in 1 iterations and 55885 ms. Remains : 227/227 places, 354/354 transitions.
Built C files in :
/tmp/ltsmin5016870434192422956
[2025-06-07 04:27:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5016870434192422956
Running compilation step : cd /tmp/ltsmin5016870434192422956;'/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 517 ms.
Running link step : cd /tmp/ltsmin5016870434192422956;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5016870434192422956;'/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/stateBased5655896533513740179.hoa' '--buchi-type=spotba'
LTSmin run took 4482 ms.
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-14 finished in 252993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(X(p1))) U X(!p1)))'
Support contains 35 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 354/354 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 155 transition count 282
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 155 transition count 282
Applied a total of 144 rules in 4 ms. Remains 155 /227 variables (removed 72) and now considering 282/354 (removed 72) transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 04:27:37] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:27:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-07 04:27:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:27:37] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 04:27: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/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13872 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 22703 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36663ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 36664ms
Starting structural reductions in LTL mode, iteration 1 : 155/227 places, 282/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36869 ms. Remains : 155/227 places, 282/354 transitions.
Stuttering acceptance computed with spot in 264 ms :[p1, false, p1, false, (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N06-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Product exploration explored 100000 steps with 50000 reset in 381 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 p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N06-LTLFireability-15 finished in 37932 ms.
All properties solved by simple procedures.
Total runtime 924351 ms.

BK_STOP 1749270495334

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

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