Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.7K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 8.0K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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-Z2T3N06-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749263753376

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-Z2T3N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-07 02:35:54] [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 02:35:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 02:35:54] [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 02:35:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 02:35:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 820 ms
[2025-06-07 02:35:55] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 106 PT places and 162.0 transition bindings in 17 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 02:35:55] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2025-06-07 02:35:55] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-05 FALSE 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
RANDOM walk for 40001 steps (8 resets) in 610 ms. (65 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 1/1 properties
// Phase 1: matrix 11 rows 13 cols
[2025-06-07 02:35:56] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 3/24 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2025-06-07 02:35:56] [INFO ] Flatten gal took : 14 ms
[2025-06-07 02:35:56] [INFO ] Flatten gal took : 4 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(6), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2025-06-07 02:35:56] [INFO ] Unfolded HLPN to a Petri net with 106 places and 162 transitions 510 arcs in 26 ms.
[2025-06-07 02:35:56] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2025-06-07 02:35:56] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-07 02:35:56] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-07 02:35:56] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-07 02:35:56] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-07 02:35:56] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-07 02:35:56] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-07 02:35:56] [INFO ] Reduced 6 identical enabling conditions.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2025-06-07 02:35:56] [INFO ] Computed 15 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:35:56] [INFO ] Implicit Places using invariants in 160 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 185 ms. Remains : 105/106 places, 138/138 transitions.
Support contains 87 out of 105 places after structural reductions.
[2025-06-07 02:35:56] [INFO ] Flatten gal took : 17 ms
[2025-06-07 02:35:56] [INFO ] Flatten gal took : 18 ms
[2025-06-07 02:35:56] [INFO ] Input system was already deterministic with 138 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (8 resets) in 646 ms. (61 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 649 ms. (61 steps per ms) remains 1/1 properties
// Phase 1: matrix 138 rows 105 cols
[2025-06-07 02:35:57] [INFO ] Computed 14 invariants in 3 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 15/243 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/105 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(!p1)||(!p0&&X(!p2)))))'
Support contains 33 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 9 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2025-06-07 02:35:58] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:35:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 02:35:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:35:58] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-07 02:35:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3784 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5304 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9140ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 9141ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9282 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (AND p1 p2) (AND p0 p1)), (AND (NOT p0) p1 p2), (AND p1 p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 1298 ms.
Product exploration explored 100000 steps with 50000 reset in 1069 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) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 102 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-00 finished in 12397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))&&X(X(X(F(!p2))))))'
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 5 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2025-06-07 02:36:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 02:36:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:10] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-07 02:36:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3578 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8666ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8666ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8786 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1)), p2, (NOT p1), p2, p2]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-01
Product exploration explored 100000 steps with 344 reset in 205 ms.
Stack based approach found an accepted trace after 1248 steps with 1 reset with depth 1245 and stack size 1245 in 3 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-01 finished in 9244 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 p1)||X(!p0)) U p0)))'
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2025-06-07 02:36:19] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 02:36:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-07 02:36:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4097 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6155 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10279ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10280ms
Finished structural reductions in LTL mode , in 1 iterations and 10409 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), true, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-02 finished in 10543 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)||(X(X(X(p0)))&&(G(!p1)||(F(p3)&&p2))))))'
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 9 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2025-06-07 02:36:30] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 02:36:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:30] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-07 02:36:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3370 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5240 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8643ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8644ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8785 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 1546 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-03
Product exploration explored 100000 steps with 23167 reset in 451 ms.
Product exploration explored 100000 steps with 23157 reset in 518 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) p2 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 (NOT p3) p0)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p0), (X p1), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0))))]
Knowledge based reduction with 34 factoid took 2575 ms. Reduced automaton from 28 states, 164 edges and 4 AP (stutter sensitive) to 28 states, 164 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1558 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p3))]
Reduction of identical properties reduced properties to check from 22 to 17
RANDOM walk for 40000 steps (8 resets) in 484 ms. (82 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 514 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
[2025-06-07 02:36:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf9 is UNSAT
Problem apf18 is UNSAT
After SMT solving in domain Real declared 27/219 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0 (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 (NOT p3) p0)), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X p0), (X p1), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p0)), (G (OR (NOT p0) p1 p2)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p2) p3)), (G (OR p0 p1 p2)), (G (OR (NOT p0) (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p3), (F (NOT (AND (OR p0 p1) (OR p0 (NOT p2))))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 40 factoid took 1525 ms. Reduced automaton from 28 states, 164 edges and 4 AP (stutter sensitive) to 20 states, 80 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1014 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1023 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 27 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-07 02:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 02:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:36:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-07 02:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3439 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5461 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8916ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8916ms
Finished structural reductions in LTL mode , in 1 iterations and 9033 ms. Remains : 93/93 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p3))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 20 factoid took 602 ms. Reduced automaton from 20 states, 80 edges and 3 AP (stutter sensitive) to 20 states, 80 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1001 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 189 steps (0 resets) in 7 ms. (23 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p3))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p3))), (F p3), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (AND p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT p0)), (F (NOT (AND p0 p2 (NOT p3))))]
Knowledge based reduction with 20 factoid took 1132 ms. Reduced automaton from 20 states, 80 edges and 3 AP (stutter sensitive) to 20 states, 80 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1026 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 946 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 1002 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 23191 reset in 336 ms.
Product exploration explored 100000 steps with 23172 reset in 340 ms.
Built C files in :
/tmp/ltsmin4847946051587747671
[2025-06-07 02:37:05] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4847946051587747671
Running compilation step : cd /tmp/ltsmin4847946051587747671;'/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 368 ms.
Running link step : cd /tmp/ltsmin4847946051587747671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4847946051587747671;'/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/stateBased6307190477509305333.hoa' '--buchi-type=spotba'
LTSmin run took 400 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-03 finished in 36368 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 (!p1||F(!p2)))&&G(p1)) U X(X(p0)))))'
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 7 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2025-06-07 02:37:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:06] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 02:37:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-07 02:37:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3478 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5353 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8864ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8865ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9025 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 600 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), (NOT p0), true, (NOT p0), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p1 p2 (NOT p0)), (NOT p1), p2]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 48 steps with 2 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-04 finished in 9662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(!p1))))'
Support contains 48 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2025-06-07 02:37:16] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 02:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:16] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-07 02:37: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/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4054 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5870 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9948ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 9949ms
Finished structural reductions in LTL mode , in 1 iterations and 10080 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 454 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-07 finished in 10233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!((p0 U X(X(p1))) U p2)||!(p0 U p3))))'
Support contains 48 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2025-06-07 02:37:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 02:37:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:26] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-07 02:37: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/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4150 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6074 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10239ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10241ms
Finished structural reductions in LTL mode , in 1 iterations and 10381 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 386 ms :[(AND p2 p3), true, (AND (NOT p2) p3), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2), p1, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-08 finished in 10797 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 18 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 80 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 80 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 74 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 74 transition count 84
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 111 place count 55 transition count 66
Applied a total of 111 rules in 29 ms. Remains 55 /105 variables (removed 50) and now considering 66/138 (removed 72) transitions.
// Phase 1: matrix 66 rows 55 cols
[2025-06-07 02:37:37] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 02:37:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:37:37] [INFO ] Redundant transitions in 4 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-07 02:37: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/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 6/55 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 66/121 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 68 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 6/55 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 66/121 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 54/122 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 122 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2140ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/105 places, 66/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2256 ms. Remains : 55/105 places, 66/138 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 208 ms.
Stack based approach found an accepted trace after 264 steps with 0 reset with depth 265 and stack size 259 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-10 finished in 2523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(!p1)))))'
Support contains 30 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 126
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 126
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
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 72 place count 69 transition count 102
Applied a total of 72 rules in 26 ms. Remains 69 /105 variables (removed 36) and now considering 102/138 (removed 36) transitions.
// Phase 1: matrix 102 rows 69 cols
[2025-06-07 02:37:39] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:39] [INFO ] Implicit Places using invariants in 60 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/105 places, 102/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 68/105 places, 102/138 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR p0 p1), p0, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 244 ms.
Stack based approach found an accepted trace after 624 steps with 2 reset with depth 566 and stack size 566 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-11 finished in 469 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 G((G(p1) U p2))) U X(!p2)))'
Support contains 63 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 105 cols
[2025-06-07 02:37:40] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-07 02:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:40] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-07 02:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4203 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/105 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/243 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 132/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 251 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6101 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10323ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10323ms
Finished structural reductions in LTL mode , in 1 iterations and 10436 ms. Remains : 105/105 places, 138/138 transitions.
Stuttering acceptance computed with spot in 556 ms :[p2, p2, false, p2, (AND (NOT p1) p2), false, true, (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 556 ms.
Product exploration explored 100000 steps with 50000 reset in 561 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 p1) p0), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 19 ms. Reduced automaton from 14 states, 50 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-13 finished in 12165 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 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 105 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 81 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 81 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 68 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 68 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 62 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 62 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 56 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 56 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 50 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 50 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 50 transition count 48
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 153 place count 37 transition count 36
Applied a total of 153 rules in 19 ms. Remains 37 /105 variables (removed 68) and now considering 36/138 (removed 102) transitions.
// Phase 1: matrix 36 rows 37 cols
[2025-06-07 02:37:52] [INFO ] Computed 13 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 02:37:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:37:52] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-07 02:37:52] [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 405 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 422 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 831ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 831ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/105 places, 36/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 940 ms. Remains : 37/105 places, 36/138 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-14
Product exploration explored 100000 steps with 5753 reset in 135 ms.
Product exploration explored 100000 steps with 5963 reset in 149 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2025-06-07 02:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:37:54] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-07 02:37:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-07 02:37:54] [INFO ] Computed and/alt/rep : 30/42/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 02:37:54] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2025-06-07 02:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 02:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:37:54] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:37:54] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-07 02:37: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/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 419 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 420 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 843ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 844ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 935 ms. Remains : 37/37 places, 36/36 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2025-06-07 02:37:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:37:55] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-07 02:37:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-07 02:37:55] [INFO ] Computed and/alt/rep : 30/42/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-07 02:37:55] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5780 reset in 146 ms.
Product exploration explored 100000 steps with 5925 reset in 147 ms.
Built C files in :
/tmp/ltsmin5182357597742626996
[2025-06-07 02:37:55] [INFO ] Computing symmetric may disable matrix : 36 transitions.
[2025-06-07 02:37:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:37:55] [INFO ] Computing symmetric may enable matrix : 36 transitions.
[2025-06-07 02:37:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:37:55] [INFO ] Computing Do-Not-Accords matrix : 36 transitions.
[2025-06-07 02:37:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:37:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5182357597742626996
Running compilation step : cd /tmp/ltsmin5182357597742626996;'/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 111 ms.
Running link step : cd /tmp/ltsmin5182357597742626996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5182357597742626996;'/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/stateBased4956612828736276507.hoa' '--buchi-type=spotba'
LTSmin run took 6995 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-14 finished in 10864 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(G(!p0)))))'
Support contains 15 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 126
Applied a total of 24 rules in 4 ms. Remains 93 /105 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 93 cols
[2025-06-07 02:38:03] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:38:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 02:38:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:38:03] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-06-07 02:38:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3352 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5410 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8790ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 8791ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8905 ms. Remains : 93/105 places, 126/138 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N06-LTLFireability-15 finished in 9135 ms.
All properties solved by simple procedures.
Total runtime 137564 ms.

BK_STOP 1749263892344

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

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