About the Execution of ITS-Tools for UtilityControlRoom-PT-Z4T3N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1029143.00 | 0.00 | 0.00 | TTFFFFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590600860.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-Z4T3N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590600860
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 35K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 119K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 468K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 30K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 162K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 254K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 905K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K 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 319K 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-Z4T3N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749278887279
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T3N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 06:48:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 06:48:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 06:48:08] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2025-06-07 06:48:08] [INFO ] Transformed 376 places.
[2025-06-07 06:48:08] [INFO ] Transformed 750 transitions.
[2025-06-07 06:48:08] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 317 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 15 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2025-06-07 06:48:09] [INFO ] Computed 23 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:09] [INFO ] Implicit Places using invariants in 323 ms returned [305]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 375 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 375/376 places, 590/590 transitions.
Applied a total of 0 rules in 7 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 415 ms. Remains : 375/376 places, 590/590 transitions.
Support contains 317 out of 375 places after structural reductions.
[2025-06-07 06:48:09] [INFO ] Flatten gal took : 81 ms
[2025-06-07 06:48:10] [INFO ] Flatten gal took : 70 ms
[2025-06-07 06:48:10] [INFO ] Input system was already deterministic with 590 transitions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (8 resets) in 1067 ms. (37 steps per ms) remains 1/30 properties
BEST_FIRST walk for 23126 steps (5 resets) in 83 ms. (275 steps per ms) remains 0/1 properties
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 60 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 363 place count 212 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 366 place count 212 transition count 270
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 396 place count 182 transition count 240
Iterating global reduction 2 with 30 rules applied. Total rules applied 426 place count 182 transition count 240
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 446 place count 172 transition count 230
Applied a total of 446 rules in 68 ms. Remains 172 /375 variables (removed 203) and now considering 230/590 (removed 360) transitions.
// Phase 1: matrix 230 rows 172 cols
[2025-06-07 06:48:11] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:11] [INFO ] Implicit Places using invariants in 90 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/375 places, 230/590 transitions.
Applied a total of 0 rules in 7 ms. Remains 171 /171 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 171/375 places, 230/590 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-00
Product exploration explored 100000 steps with 4994 reset in 598 ms.
Product exploration explored 100000 steps with 5033 reset in 494 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1067 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 67 steps (0 resets) in 7 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
// Phase 1: matrix 230 rows 171 cols
[2025-06-07 06:48:14] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:48:14] [INFO ] [Real]Absence check using 21 positive place invariants in 64 ms returned sat
[2025-06-07 06:48:14] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2025-06-07 06:48:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:48:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 42 ms returned sat
[2025-06-07 06:48:15] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-06-07 06:48:15] [INFO ] Computed and/alt/rep : 190/490/190 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-07 06:48:16] [INFO ] Added : 190 causal constraints over 38 iterations in 847 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 60 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 230/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-07 06:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-07 06:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:16] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:48:16] [INFO ] Redundant transitions in 9 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-07 06:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/171 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 230/401 variables, 171/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 192 constraints, problems are : Problem set: 0 solved, 190 unsolved in 9269 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/171 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 230/401 variables, 171/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 190/382 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 382 constraints, problems are : Problem set: 0 solved, 190 unsolved in 11321 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20664ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 20669ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20891 ms. Remains : 171/171 places, 230/230 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 79 steps (0 resets) in 8 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2025-06-07 06:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:48:37] [INFO ] [Real]Absence check using 21 positive place invariants in 36 ms returned sat
[2025-06-07 06:48:37] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-06-07 06:48:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:48:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 44 ms returned sat
[2025-06-07 06:48:38] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2025-06-07 06:48:38] [INFO ] Computed and/alt/rep : 190/490/190 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-07 06:48:39] [INFO ] Added : 190 causal constraints over 38 iterations in 793 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5005 reset in 428 ms.
Product exploration explored 100000 steps with 5023 reset in 449 ms.
Built C files in :
/tmp/ltsmin12894214372524142985
[2025-06-07 06:48:40] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2025-06-07 06:48:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:48:40] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2025-06-07 06:48:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:48:40] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2025-06-07 06:48:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:48:40] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12894214372524142985
Running compilation step : cd /tmp/ltsmin12894214372524142985;'/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 575 ms.
Running link step : cd /tmp/ltsmin12894214372524142985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12894214372524142985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15235178170719685028.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 60 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 230/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 171 /171 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-07 06:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 06:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:48:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:48:55] [INFO ] Redundant transitions in 9 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-07 06:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/171 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 230/401 variables, 171/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 192 constraints, problems are : Problem set: 0 solved, 190 unsolved in 8899 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/171 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 230/401 variables, 171/192 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 190/382 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 382 constraints, problems are : Problem set: 0 solved, 190 unsolved in 11401 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20332ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 20334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20558 ms. Remains : 171/171 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin18409223187502619260
[2025-06-07 06:49:15] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2025-06-07 06:49:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:49:15] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2025-06-07 06:49:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:49:15] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2025-06-07 06:49:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:49:15] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18409223187502619260
Running compilation step : cd /tmp/ltsmin18409223187502619260;'/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 432 ms.
Running link step : cd /tmp/ltsmin18409223187502619260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18409223187502619260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6540431499093744996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 06:49:31] [INFO ] Flatten gal took : 10 ms
[2025-06-07 06:49:31] [INFO ] Flatten gal took : 10 ms
[2025-06-07 06:49:31] [INFO ] Time to serialize gal into /tmp/LTL14077247293860697295.gal : 3 ms
[2025-06-07 06:49:31] [INFO ] Time to serialize properties into /tmp/LTL13981292046583698827.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14077247293860697295.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9099416404448524793.hoa' '-atoms' '/tmp/LTL13981292046583698827.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13981292046583698827.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9099416404448524793.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
213 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.16349,94100,1,0,134,511056,17,28,4267,288626,273
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-00 finished in 82333 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(F(p0))||G(p1))))'
Support contains 85 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 06:49:33] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:49:33] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-07 06:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:49:34] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60477ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60823 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 931 ms.
Product exploration explored 100000 steps with 33333 reset in 946 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 10 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-01 finished in 62919 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(((X(p0)&&F(!p1))||G(p0)))))'
Support contains 90 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 360 place count 195 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 400 place count 195 transition count 370
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 403 place count 192 transition count 250
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 407 place count 191 transition count 250
Applied a total of 407 rules in 49 ms. Remains 191 /375 variables (removed 184) and now considering 250/590 (removed 340) transitions.
// Phase 1: matrix 250 rows 191 cols
[2025-06-07 06:50:36] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:50:36] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 06:50:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:50:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:50:36] [INFO ] Redundant transitions in 3 ms returned []
Running 210 sub problems to find dead transitions.
[2025-06-07 06:50: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/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 10/191 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 250/441 variables, 191/212 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 212 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10941 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 10/191 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 250/441 variables, 191/212 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 210/422 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/441 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 422 constraints, problems are : Problem set: 0 solved, 210 unsolved in 17661 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28643ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 28644ms
Starting structural reductions in SI_LTL mode, iteration 1 : 191/375 places, 250/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28889 ms. Remains : 191/375 places, 250/590 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-02
Product exploration explored 100000 steps with 3362 reset in 410 ms.
Stack based approach found an accepted trace after 13266 steps with 445 reset with depth 45 and stack size 45 in 78 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-02 finished in 29557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 50 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 363 place count 212 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 366 place count 212 transition count 270
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 396 place count 182 transition count 240
Iterating global reduction 2 with 30 rules applied. Total rules applied 426 place count 182 transition count 240
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 61 rules applied. Total rules applied 487 place count 151 transition count 210
Applied a total of 487 rules in 48 ms. Remains 151 /375 variables (removed 224) and now considering 210/590 (removed 380) transitions.
// Phase 1: matrix 210 rows 151 cols
[2025-06-07 06:51:06] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 06:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:06] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:51:06] [INFO ] Redundant transitions in 2 ms returned []
Running 170 sub problems to find dead transitions.
[2025-06-07 06:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 172 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7030 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/151 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 210/361 variables, 151/172 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 170/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 342 constraints, problems are : Problem set: 0 solved, 170 unsolved in 10458 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17521ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 17522ms
Starting structural reductions in SI_LTL mode, iteration 1 : 151/375 places, 210/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17734 ms. Remains : 151/375 places, 210/590 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 454 ms.
Stack based approach found an accepted trace after 138 steps with 0 reset with depth 139 and stack size 139 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-03 finished in 18258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1))&&F((G(F(!p2))||(F(!p2)&&X(!p0)))))))'
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 7 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 375 cols
[2025-06-07 06:51:24] [INFO ] Computed 22 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:24] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-07 06:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:24] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-07 06:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Finished structural reductions in LTL mode , in 1 iterations and 60704 ms. Remains : 375/375 places, 590/590 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-06
Product exploration explored 100000 steps with 6788 reset in 1602 ms.
Product exploration explored 100000 steps with 6767 reset in 1609 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 185 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
RANDOM walk for 37 steps (0 resets) in 9 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
[2025-06-07 06:52:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:30] [INFO ] [Real]Absence check using 22 positive place invariants in 30 ms returned sat
[2025-06-07 06:52:31] [INFO ] [Real]Absence check using state equation in 998 ms returned sat
[2025-06-07 06:52:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:31] [INFO ] [Nat]Absence check using 22 positive place invariants in 58 ms returned sat
[2025-06-07 06:52:32] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2025-06-07 06:52:32] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-07 06:52:35] [INFO ] Added : 300 causal constraints over 60 iterations in 2528 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-07 06:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:36] [INFO ] [Real]Absence check using 22 positive place invariants in 229 ms returned sat
[2025-06-07 06:52:46] [INFO ] [Real]Absence check using state equation in 9930 ms returned sat
[2025-06-07 06:52:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:48] [INFO ] [Nat]Absence check using 22 positive place invariants in 116 ms returned sat
[2025-06-07 06:52:51] [INFO ] [Nat]Absence check using state equation in 3748 ms returned sat
[2025-06-07 06:52:51] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-07 06:52:59] [INFO ] Added : 412 causal constraints over 83 iterations in 7184 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Applied a total of 0 rules in 8 ms. Remains 375 /375 variables (removed 0) and now considering 590/590 (removed 0) transitions.
[2025-06-07 06:52:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:59] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-07 06:52:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:59] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2025-06-07 06:52:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 965/965 variables, and 397 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (OVERLAPS) 10/375 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 590/965 variables, 375/397 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/965 variables, 580/977 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 965/965 variables, and 977 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 375/375 places, 590/590 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
RANDOM walk for 40 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p2 p0))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 7 factoid took 358 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
[2025-06-07 06:54:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:54:01] [INFO ] [Real]Absence check using 22 positive place invariants in 31 ms returned sat
[2025-06-07 06:54:02] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2025-06-07 06:54:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:54:02] [INFO ] [Nat]Absence check using 22 positive place invariants in 58 ms returned sat
[2025-06-07 06:54:03] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2025-06-07 06:54:03] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 33 ms.
[2025-06-07 06:54:06] [INFO ] Added : 300 causal constraints over 60 iterations in 2356 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-07 06:54:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:54:07] [INFO ] [Real]Absence check using 22 positive place invariants in 220 ms returned sat
[2025-06-07 06:54:17] [INFO ] [Real]Absence check using state equation in 9809 ms returned sat
[2025-06-07 06:54:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:54:18] [INFO ] [Nat]Absence check using 22 positive place invariants in 116 ms returned sat
[2025-06-07 06:54:22] [INFO ] [Nat]Absence check using state equation in 3750 ms returned sat
[2025-06-07 06:54:22] [INFO ] Computed and/alt/rep : 580/890/580 causal constraints (skipped 0 transitions) in 37 ms.
[2025-06-07 06:54:30] [INFO ] Added : 412 causal constraints over 83 iterations in 7396 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
Product exploration explored 100000 steps with 6820 reset in 1809 ms.
Product exploration explored 100000 steps with 6834 reset in 1839 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p1), (AND p0 p2), p2]
Support contains 215 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 375 transition count 630
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 375 transition count 630
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 40 rules in 22 ms. Remains 375 /375 variables (removed 0) and now considering 630/590 (removed -40) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:54:34] [INFO ] Redundant transitions in 5 ms returned []
Running 620 sub problems to find dead transitions.
// Phase 1: matrix 630 rows 375 cols
[2025-06-07 06:54:34] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:54:44] [INFO ] Deduced a trap composed of 251 places in 201 ms of which 46 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/365 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 10/375 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:54:57] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:54:58] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:54:58] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:54:58] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:55:01] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 2 ms to minimize.
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:55:01] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:55:01] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 2 ms to minimize.
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:55:01] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:55:01] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 2 ms to minimize.
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 06:55:01] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 2 ms to minimize.
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 10/33 constraints. Problems are: Problem set: 80 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 375/1005 variables, and 33 constraints, problems are : Problem set: 80 solved, 540 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/375 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 80 solved, 540 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 1/1 constraints. Problems are: Problem set: 80 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/1 constraints. Problems are: Problem set: 80 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 50/375 variables, 22/23 constraints. Problems are: Problem set: 80 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 10/33 constraints. Problems are: Problem set: 80 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/33 constraints. Problems are: Problem set: 80 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 630/1005 variables, 375/408 constraints. Problems are: Problem set: 80 solved, 540 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1005 variables, 540/948 constraints. Problems are: Problem set: 80 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1005 variables, and 948 constraints, problems are : Problem set: 80 solved, 540 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 375/375 constraints, PredecessorRefiner: 540/620 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60339ms problems are : Problem set: 80 solved, 540 unsolved
Search for dead transitions found 80 dead transitions in 60341ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 375/375 places, 550/590 transitions.
Graph (complete) has 1050 edges and 375 vertex of which 335 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 335 /375 variables (removed 40) and now considering 550/550 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 335/375 places, 550/590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60388 ms. Remains : 335/375 places, 550/590 transitions.
Built C files in :
/tmp/ltsmin12817351694672085266
[2025-06-07 06:55:34] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12817351694672085266
Running compilation step : cd /tmp/ltsmin12817351694672085266;'/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 943 ms.
Running link step : cd /tmp/ltsmin12817351694672085266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12817351694672085266;'/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/stateBased1601513986660577186.hoa' '--buchi-type=spotba'
LTSmin run took 7800 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-06 finished in 259137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((F(!p2)&&X(X(!p3)))||p1)))'
Support contains 95 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 10 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 06:55:43] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:55:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-07 06:55:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:55:43] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:55:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 543 ms :[(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), p2, p3, (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (AND p2 (NOT p0)), (AND (NOT p1) p2), p3, true, (AND (NOT p0) p3), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-07 finished in 61236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U X(X(p1))))))'
Support contains 4 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 375 transition count 431
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 358 place count 216 transition count 391
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 358 place count 216 transition count 351
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 438 place count 176 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 439 place count 175 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 440 place count 175 transition count 311
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 450 place count 165 transition count 301
Iterating global reduction 2 with 10 rules applied. Total rules applied 460 place count 165 transition count 301
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 470 place count 155 transition count 281
Iterating global reduction 2 with 10 rules applied. Total rules applied 480 place count 155 transition count 281
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 488 place count 147 transition count 257
Iterating global reduction 2 with 8 rules applied. Total rules applied 496 place count 147 transition count 257
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 504 place count 147 transition count 249
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 562 place count 118 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 564 place count 117 transition count 219
Applied a total of 564 rules in 39 ms. Remains 117 /375 variables (removed 258) and now considering 219/590 (removed 371) transitions.
// Phase 1: matrix 219 rows 117 cols
[2025-06-07 06:56:44] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:56:44] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-07 06:56:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:56:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:56:45] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-06-07 06:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 10/117 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 219/336 variables, 117/139 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 139 constraints, problems are : Problem set: 0 solved, 186 unsolved in 6791 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 10/117 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 219/336 variables, 117/139 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 186/325 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 325 constraints, problems are : Problem set: 0 solved, 186 unsolved in 13853 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20718ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 20719ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/375 places, 219/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20981 ms. Remains : 117/375 places, 219/590 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-08
Product exploration explored 100000 steps with 10842 reset in 296 ms.
Product exploration explored 100000 steps with 10881 reset in 320 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 244 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false, false]
RANDOM walk for 4651 steps (0 resets) in 66 ms. (69 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 337 ms. Reduced automaton from 6 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
[2025-06-07 06:57:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:57:07] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 1 factoid took 395 ms. Reduced automaton from 5 states, 16 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-08 finished in 23545 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((p0||X(X(p1))))))'
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 7 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 255 cols
[2025-06-07 06:57:08] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:57:08] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-06-07 06:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:57:08] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60910 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-09 finished in 61096 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(((p1 U (p2||F(!p3)))&&X(F(p4))&&p0))))'
Support contains 9 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 7 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 06:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:58:09] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-07 06:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:58:09] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60291ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60767 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p4) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p4) (AND (NOT p2) p3)), (OR (NOT p0) (NOT p4) (AND (NOT p2) p3)), true, p3, (NOT p4), (AND (NOT p2) p3)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-10 finished in 61086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((((X(p0) U p1)&&F(p2)) U (X(p2)||p2))) U p2))'
Support contains 6 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 9 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 06:59:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:59:10] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-07 06:59:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:59:11] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 06:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60819 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-11 finished in 61005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 7 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 07:00:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:00:11] [INFO ] Implicit Places using invariants in 306 ms returned []
[2025-06-07 07:00:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:00:12] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 07:00:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60877 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-12
Entered a terminal (fully accepting) state of product in 18626 steps with 0 reset in 60 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-12 finished in 61061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(X(F(!(p1 U p2)))||(p2 U X(p1)))))'
Support contains 7 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 10 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 07:01:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:01:12] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-07 07:01:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:01:12] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 07:01:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60685 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (NOT p0), true, p2]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-13 finished in 60950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X((!((F(p0) U p1) U !p2)||G(!p2)))))))'
Support contains 6 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 255 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 255 transition count 470
Applied a total of 240 rules in 12 ms. Remains 255 /375 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2025-06-07 07:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:02:13] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-07 07:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:02:14] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 07:02:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Starting structural reductions in LTL mode, iteration 1 : 255/375 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60888 ms. Remains : 255/375 places, 470/590 transitions.
Stuttering acceptance computed with spot in 235 ms :[false, false, false, false, false, false]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 519 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[false, false, false, false, false, false]
RANDOM walk for 36911 steps (8 resets) in 224 ms. (164 steps per ms) remains 0/15 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 706 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 248 ms :[false, false, false, false, false, false]
Support contains 6 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2025-06-07 07:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:03:17] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-07 07:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:03:17] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 07:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/725 variables, and 277 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 10/255 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 470/725 variables, 255/277 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/725 variables, 460/737 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 737 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Finished structural reductions in LTL mode , in 1 iterations and 60800 ms. Remains : 255/255 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 312 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[false, false, false, false, false, false]
RANDOM walk for 37857 steps (8 resets) in 252 ms. (149 steps per ms) remains 0/15 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 695 ms. Reduced automaton from 6 states, 26 edges and 3 AP (stutter sensitive) to 6 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 234 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 231 ms :[false, false, false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 379 ms.
Product exploration explored 100000 steps with 0 reset in 418 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 211 ms :[false, false, false, false, false, false]
Support contains 6 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 255 transition count 510
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 255 transition count 510
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 0 with 68 rules applied. Total rules applied 108 place count 255 transition count 534
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 148 place count 255 transition count 494
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 254 transition count 454
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 254 transition count 454
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 180 place count 224 transition count 404
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 210 place count 224 transition count 404
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 228 place count 206 transition count 370
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 246 place count 206 transition count 370
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 262 place count 206 transition count 354
Deduced a syphon composed of 78 places in 0 ms
Applied a total of 262 rules in 33 ms. Remains 206 /255 variables (removed 49) and now considering 354/470 (removed 116) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:04:21] [INFO ] Redundant transitions in 1 ms returned []
Running 328 sub problems to find dead transitions.
// Phase 1: matrix 354 rows 206 cols
[2025-06-07 07:04:21] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:23] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 10/206 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 2 ms to minimize.
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 07:04:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
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 07:04:27] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 07:04:27] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 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
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 10/33 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 354/560 variables, 206/239 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/239 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/560 variables, 0/239 constraints. Problems are: Problem set: 124 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 239 constraints, problems are : Problem set: 124 solved, 204 unsolved in 16858 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 124 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 88/206 variables, 22/23 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 10/33 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 354/560 variables, 206/239 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 204/443 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/443 constraints. Problems are: Problem set: 124 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/560 variables, 0/443 constraints. Problems are: Problem set: 124 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 443 constraints, problems are : Problem set: 124 solved, 204 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 204/328 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46976ms problems are : Problem set: 124 solved, 204 unsolved
Search for dead transitions found 124 dead transitions in 46977ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 206/255 places, 230/470 transitions.
Graph (complete) has 386 edges and 206 vertex of which 128 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.3 ms
Discarding 78 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 128 /206 variables (removed 78) and now considering 230/230 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/255 places, 230/470 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47027 ms. Remains : 128/255 places, 230/470 transitions.
Built C files in :
/tmp/ltsmin7007803117054853838
[2025-06-07 07:05:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7007803117054853838
Running compilation step : cd /tmp/ltsmin7007803117054853838;'/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 693 ms.
Running link step : cd /tmp/ltsmin7007803117054853838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7007803117054853838;'/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/stateBased2372803997090894610.hoa' '--buchi-type=spotba'
LTSmin run took 5541 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-14 finished in 181127 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||G((F(p1) U !p2))))))'
Support contains 5 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 590/590 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 375 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 215 transition count 390
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 360 place count 215 transition count 352
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 436 place count 177 transition count 352
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 439 place count 174 transition count 232
Iterating global reduction 2 with 3 rules applied. Total rules applied 442 place count 174 transition count 232
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 472 place count 144 transition count 202
Iterating global reduction 2 with 30 rules applied. Total rules applied 502 place count 144 transition count 202
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 530 place count 116 transition count 146
Iterating global reduction 2 with 28 rules applied. Total rules applied 558 place count 116 transition count 146
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 586 place count 88 transition count 118
Iterating global reduction 2 with 28 rules applied. Total rules applied 614 place count 88 transition count 118
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 642 place count 88 transition count 90
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 642 place count 88 transition count 82
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 658 place count 80 transition count 82
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 703 place count 57 transition count 60
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 717 place count 50 transition count 53
Applied a total of 717 rules in 26 ms. Remains 50 /375 variables (removed 325) and now considering 53/590 (removed 537) transitions.
// Phase 1: matrix 53 rows 50 cols
[2025-06-07 07:05:14] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:05:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 07:05:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 07:05:14] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 07:05:14] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-07 07:05:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 10/50 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 53/103 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/103 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 71 constraints, problems are : Problem set: 0 solved, 34 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 10/50 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 53/103 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 34/105 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 105 constraints, problems are : Problem set: 0 solved, 34 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1231ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/375 places, 53/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1356 ms. Remains : 50/375 places, 53/590 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLFireability-15
Product exploration explored 100000 steps with 844 reset in 239 ms.
Stack based approach found an accepted trace after 275 steps with 2 reset with depth 69 and stack size 69 in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLFireability-15 finished in 1742 ms.
All properties solved by simple procedures.
Total runtime 1027812 ms.
BK_STOP 1749279916422
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T3N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z4T3N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915590600860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z4T3N10.tgz
mv UtilityControlRoom-PT-Z4T3N10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;