About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T3N06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 326025.00 | 0.00 | 0.00 | FFTFTTFFFTFFFFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590500843.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is UtilityControlRoom-PT-Z4T3N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590500843
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 59K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 300K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 137K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 104K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 257K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 821K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.9K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 191K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749275908397
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 05:58:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 05:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 05:58:30] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2025-06-07 05:58:30] [INFO ] Transformed 228 places.
[2025-06-07 05:58:30] [INFO ] Transformed 450 transitions.
[2025-06-07 05:58:30] [INFO ] Parsed PT model containing 228 places and 450 transitions and 1446 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 354/354 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 157 transition count 283
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 157 transition count 283
Applied a total of 142 rules in 47 ms. Remains 157 /228 variables (removed 71) and now considering 283/354 (removed 71) transitions.
// Phase 1: matrix 283 rows 157 cols
[2025-06-07 05:58:30] [INFO ] Computed 15 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:58:30] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-07 05:58:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:58:30] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2025-06-07 05:58:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 6/157 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 283/440 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (OVERLAPS) 0/440 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 172 constraints, problems are : Problem set: 0 solved, 277 unsolved in 14367 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (OVERLAPS) 6/157 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 283/440 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 277/449 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 449 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44786ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 44806ms
Starting structural reductions in LTL mode, iteration 1 : 157/228 places, 283/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45371 ms. Remains : 157/228 places, 283/354 transitions.
Support contains 123 out of 157 places after structural reductions.
[2025-06-07 05:59:15] [INFO ] Flatten gal took : 46 ms
[2025-06-07 05:59:15] [INFO ] Flatten gal took : 20 ms
[2025-06-07 05:59:16] [INFO ] Input system was already deterministic with 283 transitions.
RANDOM walk for 40000 steps (8 resets) in 1305 ms. (30 steps per ms) remains 2/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
[2025-06-07 05:59:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 111/440 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/15 constraints, State Equation: 0/157 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 34 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 282
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 156 transition count 281
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 75 place count 120 transition count 245
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 98 place count 120 transition count 222
Applied a total of 98 rules in 30 ms. Remains 120 /157 variables (removed 37) and now considering 222/283 (removed 61) transitions.
// Phase 1: matrix 222 rows 120 cols
[2025-06-07 05:59:17] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:59:17] [INFO ] Implicit Places using invariants in 101 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/157 places, 222/283 transitions.
Applied a total of 0 rules in 8 ms. Remains 119 /119 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 119/157 places, 222/283 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 456 ms.
Stack based approach found an accepted trace after 4117 steps with 0 reset with depth 4118 and stack size 4118 in 18 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-00 finished in 850 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(!p0)&&X(p0))))'
Support contains 30 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Applied a total of 2 rules in 12 ms. Remains 156 /157 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 05:59:17] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:59:17] [INFO ] Implicit Places using invariants in 147 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/157 places, 282/283 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 155/157 places, 282/283 transitions.
Stuttering acceptance computed with spot in 175 ms :[p0, true, true, true, true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 229 steps with 11 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-01 finished in 365 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((G(p1)||X(p2)))))))'
Support contains 34 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Applied a total of 2 rules in 9 ms. Remains 156 /157 variables (removed 1) and now considering 282/283 (removed 1) transitions.
[2025-06-07 05:59:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:59:18] [INFO ] Implicit Places using invariants in 133 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/157 places, 282/283 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 155/157 places, 282/283 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02
Product exploration explored 100000 steps with 20000 reset in 237 ms.
Product exploration explored 100000 steps with 20000 reset in 221 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 p2 (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 58 steps (0 resets) in 9 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 34 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 05:59:20] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:59:20] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-07 05:59:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 05:59:20] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 05:59:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13506 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 26842 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40460ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 40462ms
Finished structural reductions in LTL mode , in 1 iterations and 40709 ms. Remains : 155/155 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 69 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 186 ms.
Product exploration explored 100000 steps with 20000 reset in 199 ms.
Applying partial POR strategy [true, true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 337 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 34 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 155 transition count 300
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 60 place count 155 transition count 276
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 60 rules in 25 ms. Remains 155 /155 variables (removed 0) and now considering 276/282 (removed 6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:00:03] [INFO ] Redundant transitions in 13 ms returned []
Running 252 sub problems to find dead transitions.
// Phase 1: matrix 276 rows 155 cols
[2025-06-07 06:00:03] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:00:04] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 6/155 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:00:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:00:07] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:00:07] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:00:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:00:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:00:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 6/21 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 276/431 variables, 155/176 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/176 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/431 variables, 0/176 constraints. Problems are: Problem set: 54 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 176 constraints, problems are : Problem set: 54 solved, 198 unsolved in 11266 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 54 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 42/155 variables, 14/15 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/21 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 276/431 variables, 155/176 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 198/374 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/374 constraints. Problems are: Problem set: 54 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/431 variables, 0/374 constraints. Problems are: Problem set: 54 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 374 constraints, problems are : Problem set: 54 solved, 198 unsolved in 19092 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 198/252 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30437ms problems are : Problem set: 54 solved, 198 unsolved
Search for dead transitions found 54 dead transitions in 30438ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/155 places, 222/282 transitions.
Graph (complete) has 348 edges and 155 vertex of which 119 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 119 /155 variables (removed 36) and now considering 222/222 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/155 places, 222/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30509 ms. Remains : 119/155 places, 222/282 transitions.
Built C files in :
/tmp/ltsmin12551642721378757887
[2025-06-07 06:00:33] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12551642721378757887
Running compilation step : cd /tmp/ltsmin12551642721378757887;'/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 593 ms.
Running link step : cd /tmp/ltsmin12551642721378757887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12551642721378757887;'/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/stateBased6630144487102788965.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-02 finished in 76778 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 G(!p0)))'
Support contains 54 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 150 transition count 276
Applied a total of 14 rules in 17 ms. Remains 150 /157 variables (removed 7) and now considering 276/283 (removed 7) transitions.
// Phase 1: matrix 276 rows 150 cols
[2025-06-07 06:00:34] [INFO ] Computed 15 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:00:35] [INFO ] Implicit Places using invariants in 100 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/157 places, 276/283 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 125 transition count 252
Applied a total of 48 rules in 9 ms. Remains 125 /149 variables (removed 24) and now considering 252/276 (removed 24) transitions.
// Phase 1: matrix 252 rows 125 cols
[2025-06-07 06:00:35] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:00:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 06:00:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:00:35] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/157 places, 252/283 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 323 ms. Remains : 125/157 places, 252/283 transitions.
Stuttering acceptance computed with spot in 163 ms :[p0, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03
Product exploration explored 100000 steps with 2960 reset in 358 ms.
Stack based approach found an accepted trace after 50247 steps with 1488 reset with depth 42 and stack size 42 in 188 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-03 finished in 1051 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((F(p1)||G(p0)))) U X(p2))))'
Support contains 37 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Applied a total of 2 rules in 2 ms. Remains 156 /157 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 06:00:35] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:00:36] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-07 06:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:00:36] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 06:00:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 171 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13255 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 276/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 447 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43393ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 43394ms
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 282/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43673 ms. Remains : 156/157 places, 282/283 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Product exploration explored 100000 steps with 33333 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-04 finished in 44451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 35 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Applied a total of 2 rules in 4 ms. Remains 156 /157 variables (removed 1) and now considering 282/283 (removed 1) transitions.
[2025-06-07 06:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:01:20] [INFO ] Implicit Places using invariants in 116 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/157 places, 282/283 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 155/157 places, 282/283 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-07 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&X((F(p1)||X(p2))))))))))'
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 282/283 (removed 1) transitions.
[2025-06-07 06:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:01:20] [INFO ] Implicit Places using invariants in 141 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/157 places, 282/283 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 155/157 places, 282/283 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09
Product exploration explored 100000 steps with 16666 reset in 170 ms.
Product exploration explored 100000 steps with 16666 reset in 178 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
// Phase 1: matrix 282 rows 155 cols
[2025-06-07 06:01:22] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/121 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/155 variables, 9/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 2 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 121/437 variables, and 5 constraints, problems are : Problem set: 3 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 5/14 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (G (OR (NOT p0) p1)), (G (OR p0 p1 p2)), (G (OR (NOT p0) p1 p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-07 06:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:01:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-07 06:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:01:23] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 06:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 169 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13272 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/155 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/437 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 276/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 445 constraints, problems are : Problem set: 0 solved, 276 unsolved in 26548 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39944ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 39945ms
Finished structural reductions in LTL mode , in 1 iterations and 40279 ms. Remains : 155/155 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 374 steps (0 resets) in 5 ms. (62 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 162 ms.
Product exploration explored 100000 steps with 20000 reset in 162 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 282/282 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 155 transition count 306
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 155 transition count 306
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 0 with 50 rules applied. Total rules applied 74 place count 155 transition count 324
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 98 place count 155 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 153 transition count 252
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 153 transition count 252
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 134 place count 121 transition count 200
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 166 place count 121 transition count 200
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 190 place count 97 transition count 162
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 214 place count 97 transition count 162
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 234 place count 97 transition count 142
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 238 place count 93 transition count 136
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 242 place count 93 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 246 place count 93 transition count 132
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 246 rules in 47 ms. Remains 93 /155 variables (removed 62) and now considering 132/282 (removed 150) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:02:05] [INFO ] Redundant transitions in 4 ms returned []
Running 120 sub problems to find dead transitions.
// Phase 1: matrix 132 rows 93 cols
[2025-06-07 06:02:05] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:02:05] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 6/93 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:02:06] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:02:06] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:02:06] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:02:06] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:02:06] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 5/20 constraints. Problems are: Problem set: 48 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 48 solved, 72 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 6 (OVERLAPS) 132/225 variables, 93/113 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/113 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/113 constraints. Problems are: Problem set: 58 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 113 constraints, problems are : Problem set: 58 solved, 62 unsolved in 2750 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 58 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 46/93 variables, 14/15 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/20 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 132/225 variables, 93/113 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 62/175 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/175 constraints. Problems are: Problem set: 58 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/175 constraints. Problems are: Problem set: 58 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 175 constraints, problems are : Problem set: 58 solved, 62 unsolved in 2935 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 62/120 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5725ms problems are : Problem set: 58 solved, 62 unsolved
Search for dead transitions found 58 dead transitions in 5727ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 93/155 places, 74/282 transitions.
Graph (complete) has 159 edges and 93 vertex of which 53 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 53 /93 variables (removed 40) and now considering 74/74 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/155 places, 74/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5798 ms. Remains : 53/155 places, 74/282 transitions.
Built C files in :
/tmp/ltsmin12522559396440075116
[2025-06-07 06:02:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12522559396440075116
Running compilation step : cd /tmp/ltsmin12522559396440075116;'/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 403 ms.
Running link step : cd /tmp/ltsmin12522559396440075116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12522559396440075116;'/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/stateBased1988068161244508117.hoa' '--buchi-type=spotba'
LTSmin run took 2288 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-09 finished in 52822 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)&&X(p1))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 283/283 (removed 0) transitions.
// Phase 1: matrix 283 rows 157 cols
[2025-06-07 06:02:13] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:02:13] [INFO ] Implicit Places using invariants in 164 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 283/283 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 156/157 places, 283/283 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-10 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0)) U ((G(p1) U p2)||F(p3))) U !p1)))'
Support contains 6 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Applied a total of 2 rules in 4 ms. Remains 156 /157 variables (removed 1) and now considering 282/283 (removed 1) transitions.
// Phase 1: matrix 282 rows 156 cols
[2025-06-07 06:02:13] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:02:14] [INFO ] Implicit Places using invariants in 307 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/157 places, 282/283 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 324 ms. Remains : 155/157 places, 282/283 transitions.
Stuttering acceptance computed with spot in 301 ms :[p1, p1, (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12
Product exploration explored 100000 steps with 931 reset in 264 ms.
Stack based approach found an accepted trace after 81996 steps with 784 reset with depth 117 and stack size 117 in 209 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-12 finished in 1156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X(p1)))))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 283/283 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 282
Applied a total of 2 rules in 3 ms. Remains 156 /157 variables (removed 1) and now considering 282/283 (removed 1) transitions.
[2025-06-07 06:02:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:02:15] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-06-07 06:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:02:15] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 06:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 171 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13144 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 276/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 447 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43301ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 43302ms
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 282/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43732 ms. Remains : 156/157 places, 282/283 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14
Product exploration explored 100000 steps with 25000 reset in 181 ms.
Product exploration explored 100000 steps with 25000 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 1/3 properties
BEST_FIRST walk for 3708 steps (0 resets) in 7 ms. (463 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-07 06:03:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:03:00] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-07 06:03:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:03:00] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 06:03:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 171 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13233 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 6/156 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 282/438 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 276/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 447 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43348ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 43355ms
Finished structural reductions in LTL mode , in 1 iterations and 43674 ms. Remains : 156/156 places, 282/282 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 1/3 properties
BEST_FIRST walk for 14626 steps (3 resets) in 15 ms. (914 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 180 ms.
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 282/282 transitions.
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 23 Pre rules applied. Total rules applied 0 place count 156 transition count 305
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 156 transition count 305
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 53 place count 156 transition count 323
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 77 place count 156 transition count 299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 154 transition count 251
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 154 transition count 251
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 93 place count 142 transition count 239
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 105 place count 142 transition count 239
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 127 place count 120 transition count 195
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 149 place count 120 transition count 195
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 171 place count 98 transition count 162
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 193 place count 98 transition count 162
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 215 place count 98 transition count 140
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 215 rules in 24 ms. Remains 98 /156 variables (removed 58) and now considering 140/282 (removed 142) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:03:45] [INFO ] Redundant transitions in 1 ms returned []
Running 127 sub problems to find dead transitions.
// Phase 1: matrix 140 rows 98 cols
[2025-06-07 06:03:45] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:03:45] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 6/98 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:03:46] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:03:46] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:03:46] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:03:46] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:03:46] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 5/21 constraints. Problems are: Problem set: 40 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 40 solved, 87 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 6 (OVERLAPS) 140/238 variables, 98/119 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/119 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/119 constraints. Problems are: Problem set: 50 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 119 constraints, problems are : Problem set: 50 solved, 77 unsolved in 3452 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 50 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 37/98 variables, 15/16 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 5/21 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 140/238 variables, 98/119 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 77/196 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/196 constraints. Problems are: Problem set: 50 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/196 constraints. Problems are: Problem set: 50 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 196 constraints, problems are : Problem set: 50 solved, 77 unsolved in 3456 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 77/127 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6965ms problems are : Problem set: 50 solved, 77 unsolved
Search for dead transitions found 50 dead transitions in 6965ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/156 places, 90/282 transitions.
Graph (complete) has 165 edges and 98 vertex of which 67 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 67 /98 variables (removed 31) and now considering 90/90 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/156 places, 90/282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6999 ms. Remains : 67/156 places, 90/282 transitions.
Built C files in :
/tmp/ltsmin17202657801963067312
[2025-06-07 06:03:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17202657801963067312
Running compilation step : cd /tmp/ltsmin17202657801963067312;'/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 418 ms.
Running link step : cd /tmp/ltsmin17202657801963067312;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17202657801963067312;'/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/stateBased12712416197214089007.hoa' '--buchi-type=spotba'
LTSmin run took 1618 ms.
FORMULA UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N06-LTLCardinality-14 finished in 99382 ms.
All properties solved by simple procedures.
Total runtime 324472 ms.
BK_STOP 1749276234422
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T3N06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z4T3N06, examination is LTLCardinality"
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-174915590500843"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T3N06.tgz
mv UtilityControlRoom-PT-Z4T3N06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;