Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.0K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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-Z4T4N04-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z4T4N04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749269153455

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-Z4T4N04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-07 04:05: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 04:05:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 04:05: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 04:05:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 04:05:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1033 ms
[2025-06-07 04:05:55] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 154 PT places and 300.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-07 04:05:56] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 5 ms.
[2025-06-07 04:05:56] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 12 to 9
RANDOM walk for 643 steps (0 resets) in 21 ms. (29 steps per ms) remains 0/9 properties
[2025-06-07 04:05:56] [INFO ] Flatten gal took : 15 ms
[2025-06-07 04:05:56] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(4), Z(4), Z(4)] of place MovetoZ breaks symmetries in sort Z
[2025-06-07 04:05:56] [INFO ] Unfolded HLPN to a Petri net with 154 places and 300 transitions 964 arcs in 20 ms.
[2025-06-07 04:05:56] [INFO ] Unfolded 14 HLPN properties in 5 ms.
Initial state reduction rules removed 1 formulas.
[2025-06-07 04:05:56] [INFO ] Reduced 12 identical enabling conditions.
[2025-06-07 04:05:56] [INFO ] Reduced 12 identical enabling conditions.
[2025-06-07 04:05:56] [INFO ] Reduced 12 identical enabling conditions.
[2025-06-07 04:05:56] [INFO ] Reduced 12 identical enabling conditions.
[2025-06-07 04:05:56] [INFO ] Reduced 12 identical enabling conditions.
[2025-06-07 04:05:56] [INFO ] Reduced 12 identical enabling conditions.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 137 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 16 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2025-06-07 04:05:56] [INFO ] Computed 11 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:05:56] [INFO ] Implicit Places using invariants in 207 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 153/154 places, 236/236 transitions.
Support contains 137 out of 153 places after structural reductions.
[2025-06-07 04:05:56] [INFO ] Flatten gal took : 25 ms
[2025-06-07 04:05:56] [INFO ] Flatten gal took : 24 ms
[2025-06-07 04:05:56] [INFO ] Input system was already deterministic with 236 transitions.
Reduction of identical properties reduced properties to check from 15 to 11
RANDOM walk for 289 steps (0 resets) in 25 ms. (11 steps per ms) remains 0/11 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((F(G(p1))||(p0 U X(G(p2)))))))'
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 13 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2025-06-07 04:05:57] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:05:57] [INFO ] Implicit Places using invariants in 118 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 263 ms.
Stack based approach found an accepted trace after 1161 steps with 0 reset with depth 1162 and stack size 1162 in 5 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-00 finished in 786 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 p1)&&X(!p2))) U X((X(!p0)||p3))))'
Support contains 105 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2025-06-07 04:05:58] [INFO ] Computed 10 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:05:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 04:05:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:05:58] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2025-06-07 04:05: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/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 4/153 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 236/389 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 232 unsolved in 12524 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 4/153 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 236/389 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 232/395 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 395 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42692ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 42708ms
Finished structural reductions in LTL mode , in 1 iterations and 42912 ms. Remains : 153/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 469 ms :[(AND p0 (NOT p3)), (AND (NOT p3) p0), (AND p0 (NOT p3)), p0, true, (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2 (NOT p3))), (AND p0 (NOT p3)), (NOT p1), (OR (NOT p1) p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 359 ms.
Product exploration explored 100000 steps with 33333 reset in 325 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 p3) (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p3) p2))), (X (NOT p3)), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 25 ms. Reduced automaton from 10 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-01 finished in 44135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 37 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 101 transition count 184
Applied a total of 104 rules in 22 ms. Remains 101 /153 variables (removed 52) and now considering 184/236 (removed 52) transitions.
// Phase 1: matrix 184 rows 101 cols
[2025-06-07 04:06:42] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:06:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 04:06:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:06:42] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:06:42] [INFO ] Redundant transitions in 9 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-07 04:06:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/101 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 184/285 variables, 101/111 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 111 constraints, problems are : Problem set: 0 solved, 164 unsolved in 5461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 4/101 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 184/285 variables, 101/111 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 164/275 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 275 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8921 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14448ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 14449ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/153 places, 184/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14639 ms. Remains : 101/153 places, 184/236 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-02
Product exploration explored 100000 steps with 3853 reset in 255 ms.
Stack based approach found an accepted trace after 9805 steps with 403 reset with depth 51 and stack size 51 in 25 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-02 finished in 14972 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 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 89 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 73 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 70 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 70 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 58 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 58 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 46 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 46 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 34 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 34 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 34 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 34 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 30 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 26 transition count 24
Applied a total of 282 rules in 25 ms. Remains 26 /153 variables (removed 127) and now considering 24/236 (removed 212) transitions.
// Phase 1: matrix 24 rows 26 cols
[2025-06-07 04:06:57] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:06:57] [INFO ] Implicit Places using invariants in 30 ms returned [0, 9]
[2025-06-07 04:06:57] [INFO ] Actually due to overlaps returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/153 places, 24/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 25/153 places, 24/236 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-03
Product exploration explored 100000 steps with 5239 reset in 155 ms.
Stack based approach found an accepted trace after 26 steps with 1 reset with depth 18 and stack size 18 in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-03 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0)) U (!p0||G(!p1))) U (p2&&(G(F(p0)) U (!p0||G(!p1)))))))'
Support contains 29 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 12 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2025-06-07 04:06:57] [INFO ] Computed 10 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:06:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 04:06:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:06:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-07 04:06:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 115 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6315 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 184/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 299 constraints, problems are : Problem set: 0 solved, 184 unsolved in 15205 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21581ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 21582ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21757 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-04
Product exploration explored 100000 steps with 4321 reset in 226 ms.
Product exploration explored 100000 steps with 4284 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT p2)), (X p0), (X p1), (X (NOT (AND p2 p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 557 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 419 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0), false, false, false, (AND p2 p0 p1)]
RANDOM walk for 2103 steps (0 resets) in 77 ms. (26 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT p2)), (X p0), (X p1), (X (NOT (AND p2 p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 7 factoid took 956 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0), false, false, false, (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0), false, false, false, (AND p2 p0 p1)]
[2025-06-07 04:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:07:23] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-07 04:07:23] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-06-07 04:07:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:07:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-07 04:07:23] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-07 04:07:23] [INFO ] Computed and/alt/rep : 184/308/184 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 04:07:23] [INFO ] Added : 49 causal constraints over 10 iterations in 157 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 29 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 188/188 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 105 transition count 172
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 89 transition count 172
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 73 transition count 156
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 80 place count 73 transition count 140
Applied a total of 80 rules in 14 ms. Remains 73 /105 variables (removed 32) and now considering 140/188 (removed 48) transitions.
// Phase 1: matrix 140 rows 73 cols
[2025-06-07 04:07:23] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:07:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 04:07:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:07:24] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:07:24] [INFO ] Redundant transitions in 3 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-07 04:07:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 83 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3432 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 136/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 219 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6148 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9617ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/105 places, 140/188 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9757 ms. Remains : 73/105 places, 140/188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 15 factoid took 696 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0), false, false, false, (AND p2 p0 p1)]
RANDOM walk for 843 steps (0 resets) in 23 ms. (35 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 15 factoid took 1109 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter insensitive) to 10 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0), false, false, false, (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0), false, false, false, (AND p2 p0 p1)]
[2025-06-07 04:07:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:07:37] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-07 04:07:37] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-07 04:07:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:07:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-07 04:07:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-07 04:07:37] [INFO ] Computed and/alt/rep : 136/292/136 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-07 04:07:37] [INFO ] Added : 70 causal constraints over 14 iterations in 149 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 450 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (NOT p0), (AND (NOT p0) p1), (AND p0 p1), (NOT p0), false, false, false, (AND p2 p0 p1)]
Product exploration explored 100000 steps with 5267 reset in 275 ms.
Product exploration explored 100000 steps with 5327 reset in 286 ms.
Built C files in :
/tmp/ltsmin7700563907447165941
[2025-06-07 04:07:38] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-06-07 04:07:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:07:38] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-06-07 04:07:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:07:38] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-06-07 04:07:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:07:38] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7700563907447165941
Running compilation step : cd /tmp/ltsmin7700563907447165941;'/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 456 ms.
Running link step : cd /tmp/ltsmin7700563907447165941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7700563907447165941;'/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/stateBased1803292965362952298.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 29 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 140/140 transitions.
Applied a total of 0 rules in 7 ms. Remains 73 /73 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-07 04:07:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:07:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 04:07:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:07:53] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:07:53] [INFO ] Redundant transitions in 3 ms returned []
Running 136 sub problems to find dead transitions.
[2025-06-07 04:07:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 83 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 136/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 219 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9716ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9717ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9862 ms. Remains : 73/73 places, 140/140 transitions.
Built C files in :
/tmp/ltsmin7506677364522484359
[2025-06-07 04:08:03] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-06-07 04:08:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:08:03] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-06-07 04:08:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:08:03] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-06-07 04:08:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 04:08:03] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7506677364522484359
Running compilation step : cd /tmp/ltsmin7506677364522484359;'/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 308 ms.
Running link step : cd /tmp/ltsmin7506677364522484359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7506677364522484359;'/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/stateBased15731446048388407316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 04:08:18] [INFO ] Flatten gal took : 8 ms
[2025-06-07 04:08:18] [INFO ] Flatten gal took : 7 ms
[2025-06-07 04:08:18] [INFO ] Time to serialize gal into /tmp/LTL16674623492507803784.gal : 3 ms
[2025-06-07 04:08:18] [INFO ] Time to serialize properties into /tmp/LTL14782140021940938902.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16674623492507803784.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2737255085179471600.hoa' '-atoms' '/tmp/LTL14782140021940938902.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14782140021940938902.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2737255085179471600.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
67 unique states visited
11 strongly connected components in search stack
139 transitions explored
32 items max in DFS search stack
540 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.44435,163720,1,0,590,672637,68,229,2511,933873,1731
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-04 finished in 87760 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||G(!p1)))&&(X(X(!p1)) U (X(X(G(!p1)))||(!p2&&X(X(!p1)))))))'
Support contains 41 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 6 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2025-06-07 04:08:25] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:08:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 04:08:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:08:25] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-07 04:08:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 115 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 184/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 299 constraints, problems are : Problem set: 0 solved, 184 unsolved in 14881 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21349ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 21349ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21518 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 228 ms :[p1, (AND p0 p1), p1, p1, p1, true]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Product exploration explored 100000 steps with 33333 reset in 279 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 18 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-05 finished in 22348 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&&X(p1)) U (X((!p0&&X((!p0 U (!p3||G(!p0))))))||p2)))'
Support contains 44 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 6 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
[2025-06-07 04:08:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:08:47] [INFO ] Implicit Places using invariants in 109 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (AND p0 p3)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-07 finished in 314 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((G(!p1)&&p0)))&&(X(!p2) U (X(G(!p2))||(!p3&&X(!p2))))))'
Support contains 109 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2025-06-07 04:08:48] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:08:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 04:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:08:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2025-06-07 04:08:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 4/153 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 236/389 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 232 unsolved in 11441 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 4/153 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 236/389 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 232/395 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 395 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41519ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 41519ms
Finished structural reductions in LTL mode , in 1 iterations and 41676 ms. Remains : 153/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p2, (OR (NOT p0) p1), true, p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-08 finished in 41999 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 (F(p1) U (!p2 U X(X((F(!p0)||p3)))))))'
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 6 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2025-06-07 04:09:30] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:30] [INFO ] Implicit Places using invariants in 98 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 270 ms.
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-09 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 5 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
[2025-06-07 04:09:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:31] [INFO ] Implicit Places using invariants in 116 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-10
Product exploration explored 100000 steps with 23636 reset in 117 ms.
Product exploration explored 100000 steps with 23586 reset in 127 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (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)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 188 rows 104 cols
[2025-06-07 04:09:32] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:09:32] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2025-06-07 04:09:32] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-06-07 04:09:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:09:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-06-07 04:09:32] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-07 04:09:32] [INFO ] Computed and/alt/rep : 184/308/184 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 04:09:32] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-06-07 04:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:32] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 04:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:32] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-07 04:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6237 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 184/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 297 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8831 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15087ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 15088ms
Finished structural reductions in LTL mode , in 1 iterations and 15265 ms. Remains : 104/104 places, 188/188 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)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (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)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-07 04:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 04:09:48] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-06-07 04:09:48] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-07 04:09:48] [INFO ] Computed and/alt/rep : 184/308/184 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 04:09:48] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23630 reset in 121 ms.
Product exploration explored 100000 steps with 23639 reset in 121 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 104 transition count 204
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 104 transition count 204
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 56 place count 104 transition count 216
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 72 place count 104 transition count 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 101 transition count 152
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 101 transition count 152
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 114 place count 65 transition count 92
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 150 place count 65 transition count 92
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 174 place count 41 transition count 68
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 198 place count 41 transition count 68
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 222 place count 41 transition count 44
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 222 rules in 20 ms. Remains 41 /104 variables (removed 63) and now considering 44/188 (removed 144) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:09:49] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 41 cols
[2025-06-07 04:09:49] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:09:49] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 4/41 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:09:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:09:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:09:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 04:09:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 4/14 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 44/85 variables, 41/55 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/55 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/55 constraints. Problems are: Problem set: 24 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 55 constraints, problems are : Problem set: 24 solved, 16 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 24/41 variables, 9/10 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/14 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 44/85 variables, 41/55 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 16/71 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/71 constraints. Problems are: Problem set: 24 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/85 variables, 0/71 constraints. Problems are: Problem set: 24 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 71 constraints, problems are : Problem set: 24 solved, 16 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 16/40 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 896ms problems are : Problem set: 24 solved, 16 unsolved
Search for dead transitions found 24 dead transitions in 896ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/104 places, 20/188 transitions.
Graph (complete) has 44 edges and 41 vertex of which 21 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 21 /41 variables (removed 20) and now considering 20/20 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/104 places, 20/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 928 ms. Remains : 21/104 places, 20/188 transitions.
Built C files in :
/tmp/ltsmin7187923563785852196
[2025-06-07 04:09:50] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7187923563785852196
Running compilation step : cd /tmp/ltsmin7187923563785852196;'/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 282 ms.
Running link step : cd /tmp/ltsmin7187923563785852196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7187923563785852196;'/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/stateBased6535951483093013350.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-10 finished in 19812 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 21 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 89 transition count 140
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 73 transition count 140
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 184 place count 69 transition count 136
Applied a total of 184 rules in 21 ms. Remains 69 /153 variables (removed 84) and now considering 136/236 (removed 100) transitions.
// Phase 1: matrix 136 rows 69 cols
[2025-06-07 04:09:50] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 04:09:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:51] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:09:51] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-07 04:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 136/205 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 79 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2848 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 4/69 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 136/205 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 116/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 195 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5219 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8097ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/153 places, 136/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8224 ms. Remains : 69/153 places, 136/236 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 315 ms.
Stack based approach found an accepted trace after 406 steps with 0 reset with depth 407 and stack size 407 in 2 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-11 finished in 8592 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(G((p0&&X((p0&&X(p0))))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 3 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2025-06-07 04:09:59] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:59] [INFO ] Implicit Places using invariants in 122 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 0 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-13 finished in 274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(!p1)||X(!p0))))))'
Support contains 85 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 153 transition count 220
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 137 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 133 transition count 216
Applied a total of 40 rules in 12 ms. Remains 133 /153 variables (removed 20) and now considering 216/236 (removed 20) transitions.
// Phase 1: matrix 216 rows 133 cols
[2025-06-07 04:09:59] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-07 04:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 04:09:59] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 04:09:59] [INFO ] Redundant transitions in 2 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-07 04:09:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 4/133 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 216/349 variables, 133/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/349 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 143 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8282 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 4/133 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 216/349 variables, 133/143 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 196/339 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 339 constraints, problems are : Problem set: 0 solved, 196 unsolved in 15630 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23963ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 23964ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/153 places, 216/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24145 ms. Remains : 133/153 places, 216/236 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) p1), (AND p0 p1), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z4T4N04-LTLFireability-15
Product exploration explored 100000 steps with 6741 reset in 784 ms.
Stack based approach found an accepted trace after 10204 steps with 707 reset with depth 23 and stack size 23 in 81 ms.
FORMULA UtilityControlRoom-COL-Z4T4N04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z4T4N04-LTLFireability-15 finished in 25150 ms.
All properties solved by simple procedures.
Total runtime 270102 ms.

BK_STOP 1749269424941

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

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