Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 132K 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 CO4-PT-11-LTLFireability-00
FORMULA_NAME CO4-PT-11-LTLFireability-01
FORMULA_NAME CO4-PT-11-LTLFireability-02
FORMULA_NAME CO4-PT-11-LTLFireability-03
FORMULA_NAME CO4-PT-11-LTLFireability-04
FORMULA_NAME CO4-PT-11-LTLFireability-05
FORMULA_NAME CO4-PT-11-LTLFireability-06
FORMULA_NAME CO4-PT-11-LTLFireability-07
FORMULA_NAME CO4-PT-11-LTLFireability-08
FORMULA_NAME CO4-PT-11-LTLFireability-09
FORMULA_NAME CO4-PT-11-LTLFireability-10
FORMULA_NAME CO4-PT-11-LTLFireability-11
FORMULA_NAME CO4-PT-11-LTLFireability-12
FORMULA_NAME CO4-PT-11-LTLFireability-13
FORMULA_NAME CO4-PT-11-LTLFireability-14
FORMULA_NAME CO4-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748606963044

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 12:09:24] [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-05-30 12:09:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:09:24] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-05-30 12:09:24] [INFO ] Transformed 545 places.
[2025-05-30 12:09:24] [INFO ] Transformed 617 transitions.
[2025-05-30 12:09:24] [INFO ] Found NUPN structural information;
[2025-05-30 12:09:24] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 157 places in 10 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 76 place count 315 transition count 374
Iterating global reduction 1 with 61 rules applied. Total rules applied 137 place count 315 transition count 374
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 189 place count 263 transition count 322
Iterating global reduction 1 with 52 rules applied. Total rules applied 241 place count 263 transition count 322
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 243 place count 263 transition count 320
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 268 place count 238 transition count 295
Iterating global reduction 2 with 25 rules applied. Total rules applied 293 place count 238 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 294 place count 238 transition count 294
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 308 place count 224 transition count 280
Iterating global reduction 3 with 14 rules applied. Total rules applied 322 place count 224 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 324 place count 224 transition count 278
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 328 place count 220 transition count 274
Iterating global reduction 4 with 4 rules applied. Total rules applied 332 place count 220 transition count 274
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 333 place count 219 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 219 transition count 273
Applied a total of 334 rules in 126 ms. Remains 219 /388 variables (removed 169) and now considering 273/440 (removed 167) transitions.
// Phase 1: matrix 273 rows 219 cols
[2025-05-30 12:09:24] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:24] [INFO ] Implicit Places using invariants in 214 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/388 places, 273/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 218 /218 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 218/388 places, 273/440 transitions.
Support contains 15 out of 218 places after structural reductions.
[2025-05-30 12:09:25] [INFO ] Flatten gal took : 37 ms
[2025-05-30 12:09:25] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:09:25] [INFO ] Input system was already deterministic with 273 transitions.
RANDOM walk for 40000 steps (74 resets) in 1331 ms. (30 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40000 steps (37 resets) in 407 ms. (98 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (80 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (45 resets) in 274 ms. (145 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (80 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (32 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (46 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (52 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (25 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (56 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (22 resets) in 207 ms. (192 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (96 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
// Phase 1: matrix 273 rows 218 cols
[2025-05-30 12:09:26] [INFO ] Computed 3 invariants in 3 ms
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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 50/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 156/217 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 152/369 variables, 74/151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 14/383 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 70/453 variables, 44/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 29/482 variables, 16/215 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 9/491 variables, 6/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/491 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 221 constraints, problems are : Problem set: 0 solved, 11 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 218/218 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 50/61 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 156/217 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 152/369 variables, 74/162 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 14/383 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 70/453 variables, 44/210 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 29/482 variables, 16/226 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 9/491 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/491 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/491 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 232 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2473ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 112 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=112 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 259 ms.
FORMULA CO4-PT-11-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 341 edges and 218 vertex of which 212 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 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 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 273/273 transitions.
Graph (trivial) has 230 edges and 218 vertex of which 3 / 218 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 339 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 91 place count 209 transition count 174
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 180 place count 120 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 180 place count 120 transition count 154
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 100 transition count 154
Performed 38 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 296 place count 62 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 299 place count 62 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 302 place count 59 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 305 place count 59 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 307 place count 58 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 335 place count 44 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 343 place count 44 transition count 90
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 353 place count 34 transition count 70
Iterating global reduction 4 with 10 rules applied. Total rules applied 363 place count 34 transition count 70
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 370 place count 34 transition count 63
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 373 place count 31 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 376 place count 31 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 378 place count 31 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
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 380 place count 30 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 395 place count 30 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 397 place count 28 transition count 45
Applied a total of 397 rules in 40 ms. Remains 28 /218 variables (removed 190) and now considering 45/273 (removed 228) transitions.
[2025-05-30 12:09:29] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
// Phase 1: matrix 41 rows 28 cols
[2025-05-30 12:09:29] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-30 12:09:29] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2025-05-30 12:09:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:09:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:09:29] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2025-05-30 12:09:29] [INFO ] Flow matrix only has 41 transitions (discarded 4 similar events)
[2025-05-30 12:09:29] [INFO ] Invariant cache hit.
[2025-05-30 12:09:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 1/69 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 32 constraints, problems are : Problem set: 0 solved, 35 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 40/68 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 35/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 67 constraints, problems are : Problem set: 0 solved, 35 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1154ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1154ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/218 places, 45/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1271 ms. Remains : 28/218 places, 45/273 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 3 ms.
FORMULA CO4-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-00 finished in 1492 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)&&F(p1)&&((p2||X(!p1)) U (G((p2||X(!p1)))||(p3&&(p2||X(!p1)))))))'
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 273/273 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 216 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 216 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 214 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 214 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 213 transition count 268
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 213 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 212 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 212 transition count 267
Applied a total of 12 rules in 20 ms. Remains 212 /218 variables (removed 6) and now considering 267/273 (removed 6) transitions.
// Phase 1: matrix 267 rows 212 cols
[2025-05-30 12:09:31] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:31] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 12:09:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:31] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-05-30 12:09:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/479 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:37] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:37] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 217 constraints, problems are : Problem set: 0 solved, 266 unsolved in 16713 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/479 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 266/483 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:57] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 484 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46787ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 46791ms
Starting structural reductions in LTL mode, iteration 1 : 212/218 places, 267/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46995 ms. Remains : 212/218 places, 267/273 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), p1, (NOT p0), (NOT p1), (AND p1 (NOT p2)), true]
Running random walk in product with property : CO4-PT-11-LTLFireability-03
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-03 finished in 47252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(p1||G(p2)))))))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 273/273 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 213 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 213 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 209 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 209 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 209 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 207 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 207 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 205 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 205 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 205 transition count 258
Applied a total of 28 rules in 23 ms. Remains 205 /218 variables (removed 13) and now considering 258/273 (removed 15) transitions.
// Phase 1: matrix 258 rows 205 cols
[2025-05-30 12:10:18] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:18] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-30 12:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:10:18] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:10: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/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:24] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:24] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 16085 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:10:48] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46134ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 46135ms
Starting structural reductions in LTL mode, iteration 1 : 205/218 places, 258/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46511 ms. Remains : 205/218 places, 258/273 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CO4-PT-11-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-07 finished in 46680 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 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 273/273 transitions.
Graph (trivial) has 224 edges and 218 vertex of which 3 / 218 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 339 edges and 216 vertex of which 210 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 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 87 rules applied. Total rules applied 89 place count 209 transition count 176
Reduce places removed 87 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 89 rules applied. Total rules applied 178 place count 122 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 180 place count 120 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 180 place count 120 transition count 154
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 220 place count 100 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 221 place count 99 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 99 transition count 153
Performed 37 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 296 place count 62 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 299 place count 62 transition count 101
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 302 place count 59 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 305 place count 59 transition count 98
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 4 with 2 rules applied. Total rules applied 307 place count 58 transition count 97
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 335 place count 44 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 344 place count 44 transition count 89
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 355 place count 33 transition count 67
Iterating global reduction 5 with 11 rules applied. Total rules applied 366 place count 33 transition count 67
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 374 place count 33 transition count 59
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 376 place count 31 transition count 53
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 31 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 379 place count 31 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 381 place count 30 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 387 place count 30 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 389 place count 28 transition count 55
Applied a total of 389 rules in 36 ms. Remains 28 /218 variables (removed 190) and now considering 55/273 (removed 218) transitions.
[2025-05-30 12:11:04] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
// Phase 1: matrix 53 rows 28 cols
[2025-05-30 12:11:04] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-30 12:11:04] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2025-05-30 12:11:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:11:05] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:11:05] [INFO ] Redundant transitions in 12 ms returned []
Running 49 sub problems to find dead transitions.
[2025-05-30 12:11:05] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2025-05-30 12:11:05] [INFO ] Invariant cache hit.
[2025-05-30 12:11:05] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/79 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 33 constraints, problems are : Problem set: 0 solved, 49 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/79 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/81 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 82 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2273ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/218 places, 55/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2437 ms. Remains : 28/218 places, 55/273 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-08
Product exploration explored 100000 steps with 4 reset in 156 ms.
Product exploration explored 100000 steps with 26 reset in 76 ms.
Computed a total of 7 stabilizing places and 21 stable transitions
Computed a total of 7 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 4504 steps (570 resets) in 38 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2025-05-30 12:11:07] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2025-05-30 12:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-05-30 12:11:07] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2025-05-30 12:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:11:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:11:08] [INFO ] Redundant transitions in 11 ms returned []
Running 49 sub problems to find dead transitions.
[2025-05-30 12:11:08] [INFO ] Flow matrix only has 53 transitions (discarded 2 similar events)
[2025-05-30 12:11:08] [INFO ] Invariant cache hit.
[2025-05-30 12:11:08] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/79 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 33 constraints, problems are : Problem set: 0 solved, 49 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/79 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/80 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/81 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 82 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2300ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2300ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2382 ms. Remains : 28/28 places, 55/55 transitions.
Computed a total of 7 stabilizing places and 21 stable transitions
Computed a total of 7 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 569 steps (67 resets) in 5 ms. (94 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 66 ms.
Built C files in :
/tmp/ltsmin5446265856096107558
[2025-05-30 12:11:10] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2025-05-30 12:11:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:10] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2025-05-30 12:11:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:10] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2025-05-30 12:11:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:11:10] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5446265856096107558
Running compilation step : cd /tmp/ltsmin5446265856096107558;'/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 255 ms.
Running link step : cd /tmp/ltsmin5446265856096107558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5446265856096107558;'/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/stateBased8363635867503841182.hoa' '--buchi-type=spotba'
LTSmin run took 185 ms.
FORMULA CO4-PT-11-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-11-LTLFireability-08 finished in 6415 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&&(p1||X(p1))))))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 273/273 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 213 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 213 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 209 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 209 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 209 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 207 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 207 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 205 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 205 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 205 transition count 258
Applied a total of 28 rules in 14 ms. Remains 205 /218 variables (removed 13) and now considering 258/273 (removed 15) transitions.
// Phase 1: matrix 258 rows 205 cols
[2025-05-30 12:11:11] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 12:11:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:11] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:11:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:17] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15641 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:11:40] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45676ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45677ms
Starting structural reductions in LTL mode, iteration 1 : 205/218 places, 258/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45838 ms. Remains : 205/218 places, 258/273 transitions.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-11-LTLFireability-12
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA CO4-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-12 finished in 45917 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 U (G(p0)||(p0&&G(p1))))))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 273/273 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 213 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 213 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 209 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 209 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 209 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 207 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 207 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 205 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 205 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 205 transition count 258
Applied a total of 28 rules in 13 ms. Remains 205 /218 variables (removed 13) and now considering 258/273 (removed 15) transitions.
[2025-05-30 12:11:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:57] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 12:11:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:11:57] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:11: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/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15518 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:26] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45543ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45543ms
Starting structural reductions in LTL mode, iteration 1 : 205/218 places, 258/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45710 ms. Remains : 205/218 places, 258/273 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-11-LTLFireability-13
Product exploration explored 100000 steps with 12 reset in 87 ms.
Product exploration explored 100000 steps with 8 reset in 154 ms.
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 327 edges and 205 vertex of which 200 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 96 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (63 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (16 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (21 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (46 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (57 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (20 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (85 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 92677 steps, run visited all 6 properties in 271 ms. (steps per millisecond=341 )
Probabilistic random walk after 92677 steps, saw 23148 distinct states, run finished after 274 ms. (steps per millisecond=338 ) properties seen :6
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 11 factoid took 300 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-11-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-11-LTLFireability-13 finished in 47361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 273/273 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 213 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 213 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 209 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 209 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 209 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 207 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 207 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 205 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 205 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 205 transition count 258
Applied a total of 28 rules in 13 ms. Remains 205 /218 variables (removed 13) and now considering 258/273 (removed 15) transitions.
[2025-05-30 12:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:44] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 12:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:12:44] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:50] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:12:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15689 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:13:13] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45720ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45720ms
Starting structural reductions in LTL mode, iteration 1 : 205/218 places, 258/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45881 ms. Remains : 205/218 places, 258/273 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-15
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-15 finished in 45971 ms.
All properties solved by simple procedures.
Total runtime 246333 ms.

BK_STOP 1748607210594

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-11"
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 CO4-PT-11, 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 r044-tall-174854028500460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-11.tgz
mv CO4-PT-11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;