About the Execution of ITS-Tools for IBM319-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 240123.00 | 0.00 | 0.00 | TFFFFTFTTFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500332.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 IBM319-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422500332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 184K May 29 14:32 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 IBM319-PT-none-LTLFireability-00
FORMULA_NAME IBM319-PT-none-LTLFireability-01
FORMULA_NAME IBM319-PT-none-LTLFireability-02
FORMULA_NAME IBM319-PT-none-LTLFireability-03
FORMULA_NAME IBM319-PT-none-LTLFireability-04
FORMULA_NAME IBM319-PT-none-LTLFireability-05
FORMULA_NAME IBM319-PT-none-LTLFireability-06
FORMULA_NAME IBM319-PT-none-LTLFireability-07
FORMULA_NAME IBM319-PT-none-LTLFireability-08
FORMULA_NAME IBM319-PT-none-LTLFireability-09
FORMULA_NAME IBM319-PT-none-LTLFireability-10
FORMULA_NAME IBM319-PT-none-LTLFireability-11
FORMULA_NAME IBM319-PT-none-LTLFireability-12
FORMULA_NAME IBM319-PT-none-LTLFireability-13
FORMULA_NAME IBM319-PT-none-LTLFireability-14
FORMULA_NAME IBM319-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748835300459
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:35:01] [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-02 03:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:35:02] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-02 03:35:02] [INFO ] Transformed 253 places.
[2025-06-02 03:35:02] [INFO ] Transformed 178 transitions.
[2025-06-02 03:35:02] [INFO ] Found NUPN structural information;
[2025-06-02 03:35:02] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IBM319-PT-none-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 66 places
Reduce places removed 74 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 178 transition count 178
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 84 place count 169 transition count 169
Iterating global reduction 1 with 9 rules applied. Total rules applied 93 place count 169 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 169 transition count 168
Applied a total of 94 rules in 65 ms. Remains 169 /253 variables (removed 84) and now considering 168/178 (removed 10) transitions.
// Phase 1: matrix 168 rows 169 cols
[2025-06-02 03:35:02] [INFO ] Computed 13 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:02] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-02 03:35:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:03] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2025-06-02 03:35:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 168/336 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/337 variables, 1/182 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/182 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/337 variables, 0/182 constraints. Problems are: Problem set: 8 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 182 constraints, problems are : Problem set: 8 solved, 159 unsolved in 24545 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 12/12 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 2/158 variables, 1/13 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 161/319 variables, 158/171 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 151/322 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/322 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 8/327 variables, 6/328 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 8/336 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/336 constraints. Problems are: Problem set: 8 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 4/331 variables, 2/338 constraints. Problems are: Problem set: 8 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 331/337 variables, and 338 constraints, problems are : Problem set: 8 solved, 159 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 166/169 constraints, PredecessorRefiner: 159/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54640ms problems are : Problem set: 8 solved, 159 unsolved
Search for dead transitions found 8 dead transitions in 54652ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 169/253 places, 160/178 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 161 transition count 160
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 8 rules in 9 ms. Remains 161 /169 variables (removed 8) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 161 cols
[2025-06-02 03:35:57] [INFO ] Computed 14 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:57] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-02 03:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:58] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/253 places, 160/178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55676 ms. Remains : 161/253 places, 160/178 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Support contains 33 out of 159 places after structural reductions.
[2025-06-02 03:35:58] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-02 03:35:58] [INFO ] Flatten gal took : 35 ms
FORMULA IBM319-PT-none-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:35:58] [INFO ] Flatten gal took : 30 ms
[2025-06-02 03:35:58] [INFO ] Input system was already deterministic with 160 transitions.
RANDOM walk for 24566 steps (474 resets) in 716 ms. (34 steps per ms) remains 0/22 properties
Computed a total of 159 stabilizing places and 160 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 160
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U (p1&&X(p0)))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Graph (complete) has 183 edges and 159 vertex of which 70 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.2 ms
Discarding 89 places :
Also discarding 92 output transitions
Drop transitions (Output transitions of discarded places.) removed 92 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 66 transition count 25
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 51 rules applied. Total rules applied 94 place count 24 transition count 16
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 18 transition count 16
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 100 place count 18 transition count 9
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 116 place count 9 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 117 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 7 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 6 transition count 8
Applied a total of 121 rules in 13 ms. Remains 6 /159 variables (removed 153) and now considering 8/160 (removed 152) transitions.
// Phase 1: matrix 8 rows 6 cols
[2025-06-02 03:35:59] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 03:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:35:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:35:59] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:35: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/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 93 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 210 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 322ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/159 places, 8/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 6/159 places, 8/160 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA IBM319-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-01 finished in 722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U p1) U (p2&&X(F(p1)))) U X(p2)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Ensure Unique test removed 9 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 148 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 144 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 144 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 141 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 141 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 139 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 139 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 137 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 137 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 136 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 136 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 135 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 135 transition count 147
Applied a total of 37 rules in 46 ms. Remains 135 /159 variables (removed 24) and now considering 147/160 (removed 13) transitions.
// Phase 1: matrix 147 rows 135 cols
[2025-06-02 03:36:00] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:00] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 03:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:00] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10341 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21702 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32075ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 32076ms
Starting structural reductions in LTL mode, iteration 1 : 135/159 places, 147/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32418 ms. Remains : 135/159 places, 147/160 transitions.
Stuttering acceptance computed with spot in 492 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-02 finished in 32951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(X(X(p1)))&&G(!p0))))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Ensure Unique test removed 10 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 143 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 143 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 140 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 138 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 136 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 135 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 134 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 134 transition count 147
Applied a total of 38 rules in 19 ms. Remains 134 /159 variables (removed 25) and now considering 147/160 (removed 13) transitions.
// Phase 1: matrix 147 rows 134 cols
[2025-06-02 03:36:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 03:36:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:36:33] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:36:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10021 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 21044 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31081ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 31083ms
Starting structural reductions in LTL mode, iteration 1 : 134/159 places, 147/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31504 ms. Remains : 134/159 places, 147/160 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : IBM319-PT-none-LTLFireability-03
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-03 finished in 31856 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(((!X(X(p0)) U p1)&&(X(p2)||F(p0))))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Ensure Unique test removed 8 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 149 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 147 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 147 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 145 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 145 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 144 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 144 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 143 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 143 transition count 154
Applied a total of 22 rules in 18 ms. Remains 143 /159 variables (removed 16) and now considering 154/160 (removed 6) transitions.
// Phase 1: matrix 154 rows 143 cols
[2025-06-02 03:37:04] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 03:37:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:04] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-02 03:37:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/296 variables, 142/146 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 1/297 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 147 constraints, problems are : Problem set: 0 solved, 153 unsolved in 12089 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 154/296 variables, 142/146 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 153/299 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 1/297 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 300 constraints, problems are : Problem set: 0 solved, 153 unsolved in 27135 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39238ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 39240ms
Starting structural reductions in LTL mode, iteration 1 : 143/159 places, 154/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39432 ms. Remains : 143/159 places, 154/160 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-04
Product exploration explored 100000 steps with 28616 reset in 209 ms.
Product exploration explored 100000 steps with 28617 reset in 142 ms.
Computed a total of 143 stabilizing places and 154 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 143 transition count 154
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 163 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND p0 (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (832 resets) in 851 ms. (46 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40003 steps (471 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (444 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
[2025-06-02 03:37:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 15/26 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 20/46 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 32/78 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/99 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/122 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/136 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 11/147 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/153 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/153 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/159 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/159 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 8/167 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/167 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 9/176 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/176 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 11/187 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 11/198 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 17/215 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/215 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 16/231 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/231 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 16/247 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/247 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 8/255 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/255 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 3/258 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/258 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 2/260 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 2/262 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 2/264 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 2/266 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/266 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 2/268 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/268 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 2/270 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/270 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 3/273 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/273 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 5/278 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/278 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 5/283 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/283 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 4/287 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/287 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 6/293 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/293 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 297/297 variables, and 147 constraints, problems are : Problem set: 2 solved, 0 unsolved in 362 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 366ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2)), (G (OR p2 p0 (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p1), (F p0), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 20 factoid took 213 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA IBM319-PT-none-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-04 finished in 41650 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 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Graph (complete) has 183 edges and 159 vertex of which 85 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.2 ms
Discarding 74 places :
Also discarding 75 output transitions
Drop transitions (Output transitions of discarded places.) removed 75 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 81 transition count 32
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 61 rules applied. Total rules applied 114 place count 29 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 120 place count 23 transition count 23
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 120 place count 23 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 138 place count 13 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 12 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 143 place count 11 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 144 place count 10 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 144 place count 10 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 146 place count 9 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 150 place count 7 transition count 9
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 152 place count 7 transition count 7
Applied a total of 152 rules in 15 ms. Remains 7 /159 variables (removed 152) and now considering 7/160 (removed 153) transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-06-02 03:37:46] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:37:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:37:46] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:37:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/14 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/159 places, 7/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 7/159 places, 7/160 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-07
Product exploration explored 100000 steps with 28547 reset in 112 ms.
Product exploration explored 100000 steps with 28672 reset in 106 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM319-PT-none-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-07 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Graph (complete) has 183 edges and 159 vertex of which 94 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 88 transition count 32
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 71 rules applied. Total rules applied 135 place count 26 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 20 transition count 23
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 141 place count 20 transition count 15
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 159 place count 10 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 161 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 7 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 165 place count 7 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 6 transition count 11
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 173 place count 3 transition count 6
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 175 place count 3 transition count 4
Applied a total of 175 rules in 12 ms. Remains 3 /159 variables (removed 156) and now considering 4/160 (removed 156) transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-02 03:37:46] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-02 03:37:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:46] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:37:46] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-02 03:37:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/159 places, 4/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 3/159 places, 4/160 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-08
Product exploration explored 100000 steps with 33351 reset in 54 ms.
Product exploration explored 100000 steps with 33386 reset in 52 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM319-PT-none-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-08 finished in 369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Ensure Unique test removed 10 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 160
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 143 transition count 156
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 143 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 140 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 140 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 138 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 138 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 136 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 136 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 135 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 135 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 134 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 134 transition count 147
Applied a total of 38 rules in 25 ms. Remains 134 /159 variables (removed 25) and now considering 147/160 (removed 13) transitions.
// Phase 1: matrix 147 rows 134 cols
[2025-06-02 03:37:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:47] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 03:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:37:47] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 03:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9994 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 20833 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30844ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 30847ms
Starting structural reductions in LTL mode, iteration 1 : 134/159 places, 147/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31058 ms. Remains : 134/159 places, 147/160 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-09 finished in 31202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Graph (complete) has 183 edges and 159 vertex of which 130 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 26 output transitions
Drop transitions (Output transitions of discarded places.) removed 26 transitions
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 123 transition count 48
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 94 rules applied. Total rules applied 180 place count 38 transition count 39
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 186 place count 32 transition count 39
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 186 place count 32 transition count 26
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 214 place count 17 transition count 26
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 216 place count 16 transition count 25
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 219 place count 15 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 14 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 220 place count 14 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 13 transition count 22
Performed 6 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 234 place count 7 transition count 13
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 237 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 239 place count 6 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 240 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 241 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 241 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 243 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 244 place count 5 transition count 6
Applied a total of 244 rules in 15 ms. Remains 5 /159 variables (removed 154) and now considering 6/160 (removed 154) transitions.
// Phase 1: matrix 6 rows 5 cols
[2025-06-02 03:38:18] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:18] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-02 03:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:38:18] [INFO ] Redundant transitions in 14 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-02 03:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/11 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 6 constraints, problems are : Problem set: 0 solved, 3 unsolved in 41 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/11 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/159 places, 6/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 5/159 places, 6/160 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-10 finished in 250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((!p0&&F(p1)&&X(!p0))) U X(p2))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Ensure Unique test removed 8 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 149 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 146 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 146 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 145 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 145 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 144 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 144 transition count 155
Applied a total of 20 rules in 6 ms. Remains 144 /159 variables (removed 15) and now considering 155/160 (removed 5) transitions.
// Phase 1: matrix 155 rows 144 cols
[2025-06-02 03:38:18] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-02 03:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:18] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-02 03:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/298 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 1/299 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/299 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 148 constraints, problems are : Problem set: 0 solved, 154 unsolved in 11875 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (OVERLAPS) 155/298 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 154/301 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 1/299 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 302 constraints, problems are : Problem set: 0 solved, 154 unsolved in 25000 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36891ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 36892ms
Starting structural reductions in LTL mode, iteration 1 : 144/159 places, 155/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37058 ms. Remains : 144/159 places, 155/160 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : IBM319-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-11 finished in 37420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Graph (complete) has 183 edges and 159 vertex of which 98 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 61 output transitions
Drop transitions (Output transitions of discarded places.) removed 61 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 93 transition count 36
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 71 rules applied. Total rules applied 134 place count 31 transition count 27
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 140 place count 25 transition count 27
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 140 place count 25 transition count 19
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 157 place count 16 transition count 19
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 159 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 162 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 13 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 163 place count 13 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 165 place count 12 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 169 place count 10 transition count 13
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 172 place count 10 transition count 10
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 7 with 2 rules applied. Total rules applied 174 place count 9 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 175 place count 9 transition count 8
Applied a total of 175 rules in 8 ms. Remains 9 /159 variables (removed 150) and now considering 8/160 (removed 152) transitions.
// Phase 1: matrix 8 rows 9 cols
[2025-06-02 03:38:56] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:56] [INFO ] Implicit Places using invariants in 22 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/159 places, 8/160 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 7
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-06-02 03:38:56] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:56] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 03:38:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/159 places, 7/160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 7/159 places, 7/160 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-12
Product exploration explored 100000 steps with 39942 reset in 109 ms.
Product exploration explored 100000 steps with 39938 reset in 111 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 315 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 46 steps (14 resets) in 5 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 455 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2025-06-02 03:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 03:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:38:57] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/14 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 7/7 places, 7/7 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 315 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 50 steps (13 resets) in 4 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 40047 reset in 75 ms.
Product exploration explored 100000 steps with 39953 reset in 76 ms.
Built C files in :
/tmp/ltsmin521951144416332518
[2025-06-02 03:38:59] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2025-06-02 03:38:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:38:59] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2025-06-02 03:38:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:38:59] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2025-06-02 03:38:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:38:59] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin521951144416332518
Running compilation step : cd /tmp/ltsmin521951144416332518;'/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 271 ms.
Running link step : cd /tmp/ltsmin521951144416332518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin521951144416332518;'/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/stateBased11395563362023297050.hoa' '--buchi-type=spotba'
LTSmin run took 70 ms.
FORMULA IBM319-PT-none-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM319-PT-none-LTLFireability-12 finished in 3354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Graph (complete) has 183 edges and 159 vertex of which 139 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 130 transition count 55
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 96 rules applied. Total rules applied 185 place count 43 transition count 46
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 37 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 193 place count 36 transition count 45
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 193 place count 36 transition count 33
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 219 place count 22 transition count 33
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 221 place count 21 transition count 32
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 224 place count 20 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 225 place count 19 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 225 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 227 place count 18 transition count 29
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 228 place count 17 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 17 transition count 28
Performed 8 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 245 place count 9 transition count 16
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 248 place count 9 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 250 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 8 transition count 12
Applied a total of 251 rules in 9 ms. Remains 8 /159 variables (removed 151) and now considering 12/160 (removed 148) transitions.
// Phase 1: matrix 12 rows 8 cols
[2025-06-02 03:38:59] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:59] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 03:38:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:38:59] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-02 03:38: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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 11 unsolved in 86 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/20 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 98 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/159 places, 12/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 8/159 places, 12/160 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-13
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-13 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 160/160 transitions.
Graph (complete) has 183 edges and 159 vertex of which 47 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.1 ms
Discarding 112 places :
Also discarding 112 output transitions
Drop transitions (Output transitions of discarded places.) removed 112 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 45 transition count 18
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 16 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 14 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 64 place count 14 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 10 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 77 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 78 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 78 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 80 place count 6 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 6 transition count 7
Applied a total of 81 rules in 6 ms. Remains 6 /159 variables (removed 153) and now considering 7/160 (removed 153) transitions.
// Phase 1: matrix 7 rows 6 cols
[2025-06-02 03:38:59] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 03:38:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:38:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:38:59] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:38: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/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/11 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/11 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/13 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/159 places, 7/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 6/159 places, 7/160 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-14 finished in 283 ms.
All properties solved by simple procedures.
Total runtime 238237 ms.
BK_STOP 1748835540582
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="IBM319-PT-none"
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 IBM319-PT-none, 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 r114-tall-174876422500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM319-PT-none.tgz
mv IBM319-PT-none 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 ;