About the Execution of ITS-Tools for UtilityControlRoom-COL-Z2T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 462828.00 | 0.00 | 0.00 | FTFTFTFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590200660.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-Z2T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590200660
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.8K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 3.1K 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 158K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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-Z2T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-COL-Z2T3N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749264353385
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-Z2T3N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-07 02:45:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 02:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 02:45:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-07 02:45:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 02:45:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 636 ms
[2025-06-07 02:45:55] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 174 PT places and 270.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-07 02:45:55] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 6 ms.
[2025-06-07 02:45:55] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 13 to 11
RANDOM walk for 1568 steps (0 resets) in 64 ms. (24 steps per ms) remains 0/11 properties
[2025-06-07 02:45:55] [INFO ] Flatten gal took : 15 ms
[2025-06-07 02:45:55] [INFO ] Flatten gal took : 3 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2025-06-07 02:45:55] [INFO ] Unfolded HLPN to a Petri net with 174 places and 270 transitions 850 arcs in 17 ms.
[2025-06-07 02:45:55] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2025-06-07 02:45:55] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-07 02:45:55] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-07 02:45:55] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-07 02:45:55] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-07 02:45:55] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-07 02:45:55] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
Support contains 153 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2025-06-07 02:45:56] [INFO ] Computed 23 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:45:56] [INFO ] Implicit Places using invariants in 281 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 318 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 173/174 places, 230/230 transitions.
Support contains 153 out of 173 places after structural reductions.
[2025-06-07 02:45:56] [INFO ] Flatten gal took : 30 ms
[2025-06-07 02:45:56] [INFO ] Flatten gal took : 37 ms
[2025-06-07 02:45:56] [INFO ] Input system was already deterministic with 230 transitions.
Reduction of identical properties reduced properties to check from 16 to 13
RANDOM walk for 3683 steps (0 resets) in 137 ms. (26 steps per ms) remains 0/13 properties
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0)))&&((X(p1)&&G(p2)) U (p1&&X(p1)&&G(p2))))))'
Support contains 70 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2025-06-07 02:45:57] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:45:57] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-07 02:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:45:57] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 02:45: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/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11473 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 23527 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35125ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 35136ms
Finished structural reductions in LTL mode , in 1 iterations and 35451 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 489 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-00 finished in 36022 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(p1)&&X(G(p2)))||p0)))'
Support contains 43 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 15 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 02:46:33] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:46:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-07 02:46:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:46:33] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 02:46:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8859 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 16425 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25343ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25345ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25560 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-03 finished in 26201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1&&X(F(!p2)))))))'
Support contains 93 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2025-06-07 02:46:59] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:46:59] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-07 02:46:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:46:59] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 02:46: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/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11387 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 23742 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35193ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 35194ms
Finished structural reductions in LTL mode , in 1 iterations and 35431 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-04
Product exploration explored 100000 steps with 7409 reset in 434 ms.
Product exploration explored 100000 steps with 7395 reset in 449 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
RANDOM walk for 85 steps (0 resets) in 6 ms. (12 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F p1)]
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 141 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
[2025-06-07 02:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:47:37] [INFO ] [Real]Absence check using 22 positive place invariants in 44 ms returned sat
[2025-06-07 02:47:37] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2025-06-07 02:47: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 02:47:38] [INFO ] [Nat]Absence check using 22 positive place invariants in 25 ms returned sat
[2025-06-07 02:47:38] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2025-06-07 02:47:38] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-07 02:47:39] [INFO ] Added : 140 causal constraints over 28 iterations in 862 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 02:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:47:39] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2025-06-07 02:47:39] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-07 02:47:39] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-07 02:47:39] [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 02:47:40] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2025-06-07 02:47:40] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-06-07 02:47:40] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 02:47:40] [INFO ] Added : 40 causal constraints over 8 iterations in 124 ms. Result :sat
Could not prove EG p2
Support contains 63 out of 173 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-07 02:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:47:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 02:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:47:40] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 02:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11305 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 23311 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34678ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 34683ms
Finished structural reductions in LTL mode , in 1 iterations and 34883 ms. Remains : 173/173 places, 230/230 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F p1)]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 155 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
[2025-06-07 02:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:48:16] [INFO ] [Real]Absence check using 22 positive place invariants in 42 ms returned sat
[2025-06-07 02:48:16] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2025-06-07 02:48:17] [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 02:48:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 26 ms returned sat
[2025-06-07 02:48:17] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2025-06-07 02:48:17] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 02:48:18] [INFO ] Added : 140 causal constraints over 28 iterations in 842 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 02:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:48:18] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-07 02:48:18] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-07 02:48:18] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 02:48:18] [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 02:48:19] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2025-06-07 02:48:19] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-06-07 02:48:19] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-07 02:48:19] [INFO ] Added : 40 causal constraints over 8 iterations in 141 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 165 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 7461 reset in 374 ms.
Product exploration explored 100000 steps with 7432 reset in 437 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[p2, (OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2)]
Support contains 63 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 173 transition count 250
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 173 transition count 250
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 20 rules in 26 ms. Remains 173 /173 variables (removed 0) and now considering 250/230 (removed -20) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:48:20] [INFO ] Redundant transitions in 9 ms returned []
Running 240 sub problems to find dead transitions.
// Phase 1: matrix 250 rows 173 cols
[2025-06-07 02:48:20] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:22] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 10/173 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
Problem TDEAD171 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
Problem TDEAD173 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
Problem TDEAD175 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Problem TDEAD176 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
Problem TDEAD177 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:48:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 10/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 250/423 variables, 173/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 206 constraints, problems are : Problem set: 40 solved, 200 unsolved in 12444 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 30/173 variables, 22/23 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 10/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/33 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 250/423 variables, 173/206 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 200/406 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/406 constraints. Problems are: Problem set: 40 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/406 constraints. Problems are: Problem set: 40 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 406 constraints, problems are : Problem set: 40 solved, 200 unsolved in 20170 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 200/240 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32655ms problems are : Problem set: 40 solved, 200 unsolved
Search for dead transitions found 40 dead transitions in 32659ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 173/173 places, 210/230 transitions.
Graph (complete) has 390 edges and 173 vertex of which 153 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 153 /173 variables (removed 20) and now considering 210/210 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 153/173 places, 210/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32712 ms. Remains : 153/173 places, 210/230 transitions.
Built C files in :
/tmp/ltsmin12860898504293050441
[2025-06-07 02:48:53] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12860898504293050441
Running compilation step : cd /tmp/ltsmin12860898504293050441;'/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 509 ms.
Running link step : cd /tmp/ltsmin12860898504293050441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12860898504293050441;'/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/stateBased11877038742113197505.hoa' '--buchi-type=spotba'
LTSmin run took 654 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-04 finished in 115014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)||G(p1))) U (F(G(p3))||p2))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 11 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 02:48:54] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:48:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-07 02:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:48:54] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 02:48:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8946 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 16732 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25712ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25713ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25962 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-05
Product exploration explored 100000 steps with 6963 reset in 416 ms.
Product exploration explored 100000 steps with 6869 reset in 442 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 p3) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 303 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 11 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 462 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 801 ms. (49 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40002 steps (8 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
[2025-06-07 02:49:22] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 40/363 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (G (OR (NOT p2) p3 p0 p1)), (G (OR (NOT p2) (NOT p3) p0 (NOT p1))), (G (OR (NOT p2) p3 p0 (NOT p1))), (G (OR (NOT p2) (NOT p3) p0 p1))]
False Knowledge obtained : [(X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p3) p0 (NOT p1)))), (F (NOT (OR (NOT p3) p0 p1))), (F (NOT (AND (OR p2 (NOT p0)) (OR p2 (NOT p1))))), (F (NOT (OR (NOT p2) p3 (NOT p0) (NOT p1)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p3 p0 (NOT p1)))), (F p2), (F p1), (F (NOT (OR (NOT p2) p3 (NOT p0) p1))), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0) (NOT p1)))), (F p3), (F p0), (F (NOT (OR (NOT p2) (NOT p3) (NOT p0) p1)))]
Knowledge based reduction with 16 factoid took 842 ms. Reduced automaton from 11 states, 37 edges and 4 AP (stutter insensitive) to 11 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 496 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 512 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
[2025-06-07 02:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:49:24] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2025-06-07 02:49:25] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-06-07 02:49:25] [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 02:49:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 29 ms returned sat
[2025-06-07 02:49:25] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2025-06-07 02:49:25] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 02:49:25] [INFO ] Added : 29 causal constraints over 6 iterations in 104 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
[2025-06-07 02:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:49:25] [INFO ] [Real]Absence check using 22 positive place invariants in 39 ms returned sat
[2025-06-07 02:49:25] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-06-07 02:49:25] [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 02:49:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2025-06-07 02:49:26] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-06-07 02:49:26] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-07 02:49:26] [INFO ] Added : 56 causal constraints over 12 iterations in 178 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 40 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 143 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 143 transition count 180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 142 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 142 transition count 160
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 132 transition count 150
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 132 transition count 150
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 122 transition count 130
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 122 transition count 130
Applied a total of 82 rules in 25 ms. Remains 122 /153 variables (removed 31) and now considering 130/210 (removed 80) transitions.
// Phase 1: matrix 130 rows 122 cols
[2025-06-07 02:49:26] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:49:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 02:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:49:26] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:49:26] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-07 02:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/122 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/252 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 144 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3497 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/122 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/252 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 110/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 254 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4806 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8320ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8320ms
Starting structural reductions in SI_LTL mode, iteration 1 : 122/153 places, 130/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8501 ms. Remains : 122/153 places, 130/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 35 factoid took 432 ms. Reduced automaton from 11 states, 37 edges and 4 AP (stutter insensitive) to 11 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 523 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 525 ms. (76 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
[2025-06-07 02:49:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
Problem apf7 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Real declared 40/252 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (AND (NOT p0) p1 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (G (OR p0 (NOT p2) (NOT p1) p3)), (G (OR p0 (NOT p2) (NOT p1) (NOT p3))), (G (OR p0 (NOT p2) p1 (NOT p3))), (G (OR p0 (NOT p2) p1 p3))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR (NOT p0) p2) (OR p2 (NOT p1))))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1) p3))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p2) p1 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) p1 p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 (NOT p3)))), (F p1), (F p3), (F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (F p2), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1) (NOT p3))))]
Knowledge based reduction with 39 factoid took 1099 ms. Reduced automaton from 11 states, 37 edges and 4 AP (stutter insensitive) to 11 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 500 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 454 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
[2025-06-07 02:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:49:38] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2025-06-07 02:49:38] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-07 02:49:38] [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 02:49:38] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2025-06-07 02:49:38] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-06-07 02:49:38] [INFO ] Computed and/alt/rep : 110/180/110 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-07 02:49:38] [INFO ] Added : 52 causal constraints over 11 iterations in 147 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p3))
[2025-06-07 02:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:49:38] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2025-06-07 02:49:38] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-07 02:49:38] [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 02:49:39] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2025-06-07 02:49:39] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-07 02:49:39] [INFO ] Computed and/alt/rep : 110/180/110 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-07 02:49:39] [INFO ] Added : 90 causal constraints over 18 iterations in 193 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 491 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 6662 reset in 543 ms.
Product exploration explored 100000 steps with 6695 reset in 569 ms.
Built C files in :
/tmp/ltsmin12438934858348126319
[2025-06-07 02:49:40] [INFO ] Computing symmetric may disable matrix : 130 transitions.
[2025-06-07 02:49:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:49:40] [INFO ] Computing symmetric may enable matrix : 130 transitions.
[2025-06-07 02:49:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:49:40] [INFO ] Computing Do-Not-Accords matrix : 130 transitions.
[2025-06-07 02:49:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:49:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12438934858348126319
Running compilation step : cd /tmp/ltsmin12438934858348126319;'/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 248 ms.
Running link step : cd /tmp/ltsmin12438934858348126319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12438934858348126319;'/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/stateBased6859732428262193458.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 40 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2025-06-07 02:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:49:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 02:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:49:56] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:49:56] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-07 02:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/122 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/252 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 144 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3750 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/122 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/252 variables, 122/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 110/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 254 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4832 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8592ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8593ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8742 ms. Remains : 122/122 places, 130/130 transitions.
Built C files in :
/tmp/ltsmin6265581428072044521
[2025-06-07 02:50:04] [INFO ] Computing symmetric may disable matrix : 130 transitions.
[2025-06-07 02:50:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:50:04] [INFO ] Computing symmetric may enable matrix : 130 transitions.
[2025-06-07 02:50:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:50:04] [INFO ] Computing Do-Not-Accords matrix : 130 transitions.
[2025-06-07 02:50:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 02:50:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6265581428072044521
Running compilation step : cd /tmp/ltsmin6265581428072044521;'/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 251 ms.
Running link step : cd /tmp/ltsmin6265581428072044521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6265581428072044521;'/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/stateBased3835017611696337641.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 02:50:20] [INFO ] Flatten gal took : 12 ms
[2025-06-07 02:50:20] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:50:20] [INFO ] Time to serialize gal into /tmp/LTL5307072698074609943.gal : 2 ms
[2025-06-07 02:50:20] [INFO ] Time to serialize properties into /tmp/LTL8384061331830102935.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5307072698074609943.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18377502404516485806.hoa' '-atoms' '/tmp/LTL8384061331830102935.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8384061331830102935.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18377502404516485806.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
46 unique states visited
0 strongly connected components in search stack
45 transitions explored
24 items max in DFS search stack
575 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.79685,203468,1,0,335,1.00238e+06,102,191,3107,1.18078e+06,1424
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-05 finished in 92428 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((!p1 U (p2||G(!p1))))||p0) U p3))'
Support contains 53 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 120 place count 123 transition count 160
Applied a total of 120 rules in 23 ms. Remains 123 /173 variables (removed 50) and now considering 160/230 (removed 70) transitions.
// Phase 1: matrix 160 rows 123 cols
[2025-06-07 02:50:27] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:50:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 02:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:50:27] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:50:27] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2025-06-07 02:50:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 10/123 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 160/283 variables, 123/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 145 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4820 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 10/123 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 160/283 variables, 123/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 130/275 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 275 constraints, problems are : Problem set: 0 solved, 130 unsolved in 6872 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11716ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11717ms
Starting structural reductions in SI_LTL mode, iteration 1 : 123/173 places, 160/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11911 ms. Remains : 123/173 places, 160/230 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p3), (AND (NOT p2) p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-06
Product exploration explored 100000 steps with 2726 reset in 662 ms.
Stack based approach found an accepted trace after 51597 steps with 1460 reset with depth 39 and stack size 39 in 351 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-06 finished in 13017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(X((p1 U X(p2))) U (X(G((p1 U X(p2))))||(G(p0)&&X((p1 U X(p2))))))))'
Support contains 63 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 4 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 02:50:40] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:50:40] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-07 02:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:50:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 02:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9143 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 16371 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25549ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25549ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25704 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 478 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-08 finished in 26210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0) U p1)) U X(p2)))'
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 173 cols
[2025-06-07 02:51:06] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:51:06] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 02:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:51:06] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 02:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 195 constraints, problems are : Problem set: 0 solved, 220 unsolved in 11510 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/173 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/403 variables, 173/195 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 220/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 220 unsolved in 24955 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36503ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 36504ms
Finished structural reductions in LTL mode , in 1 iterations and 36696 ms. Remains : 173/173 places, 230/230 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (NOT p2), (AND p1 p0 (NOT p2)), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-09
Product exploration explored 100000 steps with 12159 reset in 449 ms.
Product exploration explored 100000 steps with 12434 reset in 416 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 354 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 11 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), p0, (NOT p1), (NOT p1), false, false, false, false, false, false]
RANDOM walk for 452 steps (0 resets) in 15 ms. (28 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 781 ms. Reduced automaton from 11 states, 34 edges and 3 AP (stutter insensitive) to 11 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), p0, (NOT p1), (NOT p1), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), p0, (NOT p1), (NOT p1), false, false, false, false, false, false]
[2025-06-07 02:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:51:46] [INFO ] [Real]Absence check using 22 positive place invariants in 25 ms returned sat
[2025-06-07 02:51:47] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2025-06-07 02:51:47] [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 02:51:47] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2025-06-07 02:51:47] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2025-06-07 02:51:47] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-07 02:51:47] [INFO ] Added : 80 causal constraints over 16 iterations in 286 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 02:51:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:51:48] [INFO ] [Real]Absence check using 22 positive place invariants in 44 ms returned sat
[2025-06-07 02:51:49] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2025-06-07 02:51:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:51:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 26 ms returned sat
[2025-06-07 02:51:49] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2025-06-07 02:51:49] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-07 02:51:50] [INFO ] Added : 140 causal constraints over 28 iterations in 816 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-07 02:51:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:51:50] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-07 02:51:50] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-07 02:51:50] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 02:51:50] [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 02:51:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2025-06-07 02:51:51] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-07 02:51:51] [INFO ] Computed and/alt/rep : 220/330/220 causal constraints (skipped 0 transitions) in 22 ms.
[2025-06-07 02:51:51] [INFO ] Added : 40 causal constraints over 8 iterations in 145 ms. Result :sat
Could not prove EG p0
Support contains 73 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 173 transition count 210
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 153 transition count 210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 143 transition count 200
Applied a total of 60 rules in 10 ms. Remains 143 /173 variables (removed 30) and now considering 200/230 (removed 30) transitions.
// Phase 1: matrix 200 rows 143 cols
[2025-06-07 02:51:51] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:51:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 02:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:51:51] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:51:51] [INFO ] Redundant transitions in 1 ms returned []
Running 170 sub problems to find dead transitions.
[2025-06-07 02:51: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/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/143 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 200/343 variables, 143/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 165 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7352 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/143 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 200/343 variables, 143/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 170/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 335 constraints, problems are : Problem set: 0 solved, 170 unsolved in 11279 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18666ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 18667ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/173 places, 200/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18867 ms. Remains : 143/173 places, 200/230 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 14 factoid took 901 ms. Reduced automaton from 11 states, 34 edges and 3 AP (stutter insensitive) to 11 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 441 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), p0, (NOT p1), (NOT p1), false, false, false, false, false, false]
RANDOM walk for 1372 steps (0 resets) in 13 ms. (98 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F p2), (F p1), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 14 factoid took 1302 ms. Reduced automaton from 11 states, 34 edges and 3 AP (stutter insensitive) to 11 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), p0, (NOT p1), (NOT p1), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), p0, (NOT p1), (NOT p1), false, false, false, false, false, false]
[2025-06-07 02:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:52:13] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2025-06-07 02:52:14] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2025-06-07 02:52:14] [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 02:52:14] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2025-06-07 02:52:14] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-07 02:52:14] [INFO ] Computed and/alt/rep : 170/300/170 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 02:52:14] [INFO ] Added : 71 causal constraints over 16 iterations in 289 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-07 02:52:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:52:14] [INFO ] [Real]Absence check using 22 positive place invariants in 45 ms returned sat
[2025-06-07 02:52:15] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2025-06-07 02:52:15] [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 02:52:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2025-06-07 02:52:15] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-07 02:52:15] [INFO ] Computed and/alt/rep : 170/300/170 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-07 02:52:16] [INFO ] Added : 75 causal constraints over 16 iterations in 289 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-07 02:52:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:52:16] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-06-07 02:52:16] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-07 02:52:16] [INFO ] Computed and/alt/rep : 170/300/170 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 02:52:16] [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 02:52:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2025-06-07 02:52:16] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-07 02:52:16] [INFO ] Computed and/alt/rep : 170/300/170 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-07 02:52:16] [INFO ] Added : 17 causal constraints over 4 iterations in 59 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), p0, (NOT p1), (NOT p1), false, false, false, false, false, false]
Product exploration explored 100000 steps with 10339 reset in 468 ms.
Stack based approach found an accepted trace after 48042 steps with 4989 reset with depth 27 and stack size 27 in 240 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-09 finished in 71603 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 20 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 120 place count 113 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 112 transition count 130
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 143 place count 111 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 153 place count 101 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 163 place count 101 transition count 110
Applied a total of 163 rules in 22 ms. Remains 101 /173 variables (removed 72) and now considering 110/230 (removed 120) transitions.
// Phase 1: matrix 110 rows 101 cols
[2025-06-07 02:52:17] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:17] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 02:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:18] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:52:18] [INFO ] Redundant transitions in 0 ms returned []
Running 90 sub problems to find dead transitions.
[2025-06-07 02:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 122 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2698 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2890 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5597ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/173 places, 110/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5785 ms. Remains : 101/173 places, 110/230 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 218 ms.
Stack based approach found an accepted trace after 359 steps with 0 reset with depth 360 and stack size 360 in 2 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-10 finished in 6062 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 10 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 112 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 102 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 102 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 92 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 82 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 212 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 232 place count 72 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 252 place count 62 transition count 60
Applied a total of 252 rules in 17 ms. Remains 62 /173 variables (removed 111) and now considering 60/230 (removed 170) transitions.
// Phase 1: matrix 60 rows 62 cols
[2025-06-07 02:52:23] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 02:52:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:24] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:52:24] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2025-06-07 02:52: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/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 84 constraints, problems are : Problem set: 0 solved, 50 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 10/62 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 60/122 variables, 62/84 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 50/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 134 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2172ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/173 places, 60/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2307 ms. Remains : 62/173 places, 60/230 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-11
Product exploration explored 100000 steps with 2544 reset in 184 ms.
Stack based approach found an accepted trace after 2394 steps with 58 reset with depth 20 and stack size 20 in 5 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-11 finished in 2589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 53 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 173 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 133 transition count 170
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 120 place count 123 transition count 160
Applied a total of 120 rules in 10 ms. Remains 123 /173 variables (removed 50) and now considering 160/230 (removed 70) transitions.
// Phase 1: matrix 160 rows 123 cols
[2025-06-07 02:52:26] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 02:52:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:26] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:52:26] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2025-06-07 02:52:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 10/123 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 160/283 variables, 123/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 145 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4760 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 10/123 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 160/283 variables, 123/145 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 130/275 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 275 constraints, problems are : Problem set: 0 solved, 130 unsolved in 7259 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12050ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12050ms
Starting structural reductions in SI_LTL mode, iteration 1 : 123/173 places, 160/230 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12184 ms. Remains : 123/173 places, 160/230 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-13
Product exploration explored 100000 steps with 15 reset in 306 ms.
Stack based approach found an accepted trace after 3663 steps with 195 reset with depth 1226 and stack size 1226 in 13 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-13 finished in 12638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0||X((X(X(G(!p1))) U (!p0&&X(X(G(!p1)))))))) U (p1&&X(p2))))'
Support contains 40 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 4 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 153 cols
[2025-06-07 02:52:39] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 02:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:52:39] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 02:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9303 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 16906 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26248ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 26249ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26446 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (OR p1 p0), p1, p1, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-14
Product exploration explored 100000 steps with 33367 reset in 288 ms.
Product exploration explored 100000 steps with 33407 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 12 factoid took 324 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (OR p1 p0), p1, p1, true]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 990 ms. (40 steps per ms) remains 1/1 properties
[2025-06-07 02:53:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
After SMT solving in domain Real declared 30/363 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/153 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR p2 (NOT p0)))), (F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 665 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (OR p1 p0), p1, p1, true]
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), (OR p1 p0), p1, p1, true]
[2025-06-07 02:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:53:08] [INFO ] [Real]Absence check using 22 positive place invariants in 38 ms returned unsat
Proved EG (NOT p1)
[2025-06-07 02:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 02:53:08] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned sat
[2025-06-07 02:53:09] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-06-07 02:53:09] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-07 02:53:09] [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 02:53:09] [INFO ] [Nat]Absence check using 22 positive place invariants in 21 ms returned sat
[2025-06-07 02:53:09] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-06-07 02:53:09] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-07 02:53:09] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR p2 (NOT p0)))), (F p2), (F p1), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 13 factoid took 701 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-14 finished in 30981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((G(!p1)&&X(F(!p0)))))||G(p2)))'
Support contains 50 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 210
Applied a total of 40 rules in 3 ms. Remains 153 /173 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2025-06-07 02:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:53:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 02:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:53:10] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 02:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9090 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 16126 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25253ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 25254ms
Starting structural reductions in LTL mode, iteration 1 : 153/173 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25455 ms. Remains : 153/173 places, 210/230 transitions.
Stuttering acceptance computed with spot in 551 ms :[p1, (AND p1 (NOT p2)), true, (OR p0 p1), (OR p0 p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR p1 p0), (OR p0 p1), (NOT p2), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T3N10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T3N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T3N10-LTLFireability-15 finished in 26034 ms.
All properties solved by simple procedures.
Total runtime 461385 ms.
BK_STOP 1749264816213
--------------------
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-Z2T3N10"
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-Z2T3N10, 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-174915590200660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T3N10.tgz
mv UtilityControlRoom-COL-Z2T3N10 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 '
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 ;