Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 138K 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-08-LTLFireability-00
FORMULA_NAME CO4-PT-08-LTLFireability-01
FORMULA_NAME CO4-PT-08-LTLFireability-02
FORMULA_NAME CO4-PT-08-LTLFireability-03
FORMULA_NAME CO4-PT-08-LTLFireability-04
FORMULA_NAME CO4-PT-08-LTLFireability-05
FORMULA_NAME CO4-PT-08-LTLFireability-06
FORMULA_NAME CO4-PT-08-LTLFireability-07
FORMULA_NAME CO4-PT-08-LTLFireability-08
FORMULA_NAME CO4-PT-08-LTLFireability-09
FORMULA_NAME CO4-PT-08-LTLFireability-10
FORMULA_NAME CO4-PT-08-LTLFireability-11
FORMULA_NAME CO4-PT-08-LTLFireability-12
FORMULA_NAME CO4-PT-08-LTLFireability-13
FORMULA_NAME CO4-PT-08-LTLFireability-14
FORMULA_NAME CO4-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748606186870

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 11:56:28] [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 11:56:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:56:28] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-05-30 11:56:28] [INFO ] Transformed 467 places.
[2025-05-30 11:56:28] [INFO ] Transformed 600 transitions.
[2025-05-30 11:56:28] [INFO ] Found NUPN structural information;
[2025-05-30 11:56:28] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 186 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 1 formulas.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 443
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 95 place count 266 transition count 361
Iterating global reduction 1 with 80 rules applied. Total rules applied 175 place count 266 transition count 361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 179 place count 266 transition count 357
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 217 place count 228 transition count 303
Iterating global reduction 2 with 38 rules applied. Total rules applied 255 place count 228 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 257 place count 228 transition count 301
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 265 place count 220 transition count 287
Iterating global reduction 3 with 8 rules applied. Total rules applied 273 place count 220 transition count 287
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 279 place count 214 transition count 281
Iterating global reduction 3 with 6 rules applied. Total rules applied 285 place count 214 transition count 281
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 210 transition count 277
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 210 transition count 277
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 297 place count 210 transition count 273
Applied a total of 297 rules in 94 ms. Remains 210 /359 variables (removed 149) and now considering 273/445 (removed 172) transitions.
// Phase 1: matrix 273 rows 210 cols
[2025-05-30 11:56:28] [INFO ] Computed 6 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:28] [INFO ] Implicit Places using invariants in 430 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 478 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 209/359 places, 273/445 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 590 ms. Remains : 209/359 places, 273/445 transitions.
Support contains 22 out of 209 places after structural reductions.
[2025-05-30 11:56:29] [INFO ] Flatten gal took : 54 ms
[2025-05-30 11:56:29] [INFO ] Flatten gal took : 41 ms
[2025-05-30 11:56:29] [INFO ] Input system was already deterministic with 273 transitions.
Support contains 20 out of 209 places (down from 22) after GAL structural reductions.
RANDOM walk for 40000 steps (191 resets) in 1073 ms. (37 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40000 steps (87 resets) in 363 ms. (109 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (264 resets) in 296 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (198 resets) in 258 ms. (154 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (205 resets) in 348 ms. (114 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40002 steps (219 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (54 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (248 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (198 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (147 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (162 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (288 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
// Phase 1: matrix 273 rows 209 cols
[2025-05-30 11:56:40] [INFO ] Computed 5 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 77/114 variables, 37/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 190/304 variables, 69/111 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 150/454 variables, 84/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 23/477 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 5/482 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/482 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 214 constraints, problems are : Problem set: 0 solved, 10 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:41] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 8 ms to minimize.
Problem AtomicPropp5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/37 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 77/114 variables, 37/43 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/45 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 190/304 variables, 69/114 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 7/121 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 150/454 variables, 84/205 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 23/477 variables, 16/221 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/477 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 5/482 variables, 3/224 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/482 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 224 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2589ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 557 steps, including 24 resets, run visited all 1 properties in 2 ms. (steps per millisecond=278 )
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 9 properties in 434 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA CO4-PT-08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 23 stable transitions
Graph (complete) has 392 edges and 209 vertex of which 205 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 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) U p1)||G(p2)) U X(p1)))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 203 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 203 transition count 265
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 200 transition count 262
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 200 transition count 262
Applied a total of 18 rules in 9 ms. Remains 200 /209 variables (removed 9) and now considering 262/273 (removed 11) transitions.
// Phase 1: matrix 262 rows 200 cols
[2025-05-30 11:56:44] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:44] [INFO ] Implicit Places using invariants in 113 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/209 places, 262/273 transitions.
Applied a total of 0 rules in 10 ms. Remains 199 /199 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 199/209 places, 262/273 transitions.
Stuttering acceptance computed with spot in 389 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-08-LTLFireability-00
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA CO4-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-00 finished in 1139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Graph (trivial) has 212 edges and 209 vertex of which 2 / 209 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 391 edges and 208 vertex of which 204 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 203 transition count 196
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 133 transition count 194
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 144 place count 133 transition count 172
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 188 place count 111 transition count 172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 191 place count 108 transition count 167
Iterating global reduction 2 with 3 rules applied. Total rules applied 194 place count 108 transition count 167
Performed 35 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 264 place count 73 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 267 place count 73 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 71 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 71 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 69 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 69 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
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 304 place count 55 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 313 place count 55 transition count 107
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 324 place count 44 transition count 85
Iterating global reduction 5 with 11 rules applied. Total rules applied 335 place count 44 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 342 place count 44 transition count 78
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 345 place count 41 transition count 69
Iterating global reduction 6 with 3 rules applied. Total rules applied 348 place count 41 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 350 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 357 place count 41 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 359 place count 39 transition count 58
Applied a total of 359 rules in 49 ms. Remains 39 /209 variables (removed 170) and now considering 58/273 (removed 215) transitions.
[2025-05-30 11:56:45] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
// Phase 1: matrix 54 rows 39 cols
[2025-05-30 11:56:45] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:45] [INFO ] Implicit Places using invariants in 29 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/209 places, 58/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 38/209 places, 58/273 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1064 steps with 116 reset in 13 ms.
FORMULA CO4-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-02 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 202 transition count 264
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 202 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 15 place count 202 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 200 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 200 transition count 261
Applied a total of 19 rules in 8 ms. Remains 200 /209 variables (removed 9) and now considering 261/273 (removed 12) transitions.
// Phase 1: matrix 261 rows 200 cols
[2025-05-30 11:56:45] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:45] [INFO ] Implicit Places using invariants in 58 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/209 places, 261/273 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 199/209 places, 261/273 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 173 ms.
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 358 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (165 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (174 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 783368 steps, run visited all 1 properties in 861 ms. (steps per millisecond=909 )
Probabilistic random walk after 783368 steps, saw 122253 distinct states, run finished after 876 ms. (steps per millisecond=894 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 261/261 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 261/261 (removed 0) transitions.
// Phase 1: matrix 261 rows 199 cols
[2025-05-30 11:56:47] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-30 11:56:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:56:47] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-05-30 11:56:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:50] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/460 variables, 199/205 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:56:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 206 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18521 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/460 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 260/466 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:14] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 467 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48630ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48631ms
Finished structural reductions in LTL mode , in 1 iterations and 48858 ms. Remains : 199/199 places, 261/261 transitions.
Computed a total of 13 stabilizing places and 19 stable transitions
Graph (complete) has 358 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 19 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (157 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (153 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 783368 steps, run visited all 1 properties in 826 ms. (steps per millisecond=948 )
Probabilistic random walk after 783368 steps, saw 122253 distinct states, run finished after 826 ms. (steps per millisecond=948 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 84 ms.
Product exploration explored 100000 steps with 25000 reset in 115 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 261/261 transitions.
Graph (trivial) has 209 edges and 199 vertex of which 2 / 199 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 357 edges and 198 vertex of which 195 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 195 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 195 transition count 255
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 69 place count 195 transition count 274
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 90 place count 195 transition count 274
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 180 transition count 259
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 180 transition count 259
Performed 31 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 151 place count 180 transition count 279
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 158 place count 180 transition count 272
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 177 place count 161 transition count 251
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 196 place count 161 transition count 251
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 161 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 202 place count 161 transition count 247
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 208 place count 155 transition count 241
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 214 place count 155 transition count 241
Performed 23 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 237 place count 155 transition count 343
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 255 place count 155 transition count 325
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 298 place count 112 transition count 225
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 5 with 43 rules applied. Total rules applied 341 place count 112 transition count 225
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 355 place count 112 transition count 211
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 380 place count 87 transition count 164
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 6 with 25 rules applied. Total rules applied 405 place count 87 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 408 place count 87 transition count 161
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 414 place count 81 transition count 149
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 420 place count 81 transition count 149
Deduced a syphon composed of 43 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 437 place count 81 transition count 132
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 438 place count 80 transition count 131
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 439 place count 80 transition count 131
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 439 rules in 54 ms. Remains 80 /199 variables (removed 119) and now considering 131/261 (removed 130) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:57:38] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2025-05-30 11:57:38] [INFO ] Flow matrix only has 126 transitions (discarded 5 similar events)
// Phase 1: matrix 126 rows 80 cols
[2025-05-30 11:57:38] [INFO ] Computed 4 invariants in 1 ms
[2025-05-30 11:57:38] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:39] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:39] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:39] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 5 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:57:39] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 27 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 4/8 constraints. Problems are: Problem set: 9 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 121 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 4 (OVERLAPS) 125/205 variables, 80/88 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 13/101 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/206 variables, 1/102 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 70 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 70 solved, 60 unsolved in 3945 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 70 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/47 variables, 4/4 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 4/8 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 118/165 variables, 47/55 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 13/68 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 60/128 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/128 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 40/205 variables, 33/161 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/161 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/206 variables, 1/162 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/162 constraints. Problems are: Problem set: 70 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/162 constraints. Problems are: Problem set: 70 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 162 constraints, problems are : Problem set: 70 solved, 60 unsolved in 4053 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 60/130 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8037ms problems are : Problem set: 70 solved, 60 unsolved
Search for dead transitions found 70 dead transitions in 8038ms
Found 70 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 70 transitions
Dead transitions reduction (with SMT) removed 70 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/199 places, 61/261 transitions.
Graph (complete) has 131 edges and 80 vertex of which 38 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 38 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 38 /80 variables (removed 42) and now considering 75/61 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/199 places, 75/261 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8126 ms. Remains : 38/199 places, 75/261 transitions.
Built C files in :
/tmp/ltsmin15627406020528891437
[2025-05-30 11:57:46] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15627406020528891437
Running compilation step : cd /tmp/ltsmin15627406020528891437;'/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 491 ms.
Running link step : cd /tmp/ltsmin15627406020528891437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15627406020528891437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased976119068968422422.hoa' '--buchi-type=spotba'
LTSmin run took 569 ms.
FORMULA CO4-PT-08-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLFireability-07 finished in 62443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Graph (trivial) has 212 edges and 209 vertex of which 2 / 209 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 391 edges and 208 vertex of which 204 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 203 transition count 195
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 132 transition count 193
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 146 place count 132 transition count 172
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 188 place count 111 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 190 place count 109 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 109 transition count 168
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 264 place count 73 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 267 place count 73 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 269 place count 71 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 271 place count 71 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 69 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 69 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
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 304 place count 55 transition count 116
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 312 place count 55 transition count 108
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 322 place count 45 transition count 88
Iterating global reduction 5 with 10 rules applied. Total rules applied 332 place count 45 transition count 88
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 339 place count 45 transition count 81
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 341 place count 43 transition count 75
Iterating global reduction 6 with 2 rules applied. Total rules applied 343 place count 43 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 344 place count 43 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 346 place count 42 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 356 place count 42 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 40 transition count 70
Applied a total of 358 rules in 25 ms. Remains 40 /209 variables (removed 169) and now considering 70/273 (removed 203) transitions.
[2025-05-30 11:57:47] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 40 cols
[2025-05-30 11:57:47] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:47] [INFO ] Implicit Places using invariants in 51 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/209 places, 70/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 39/209 places, 70/273 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-08-LTLFireability-08
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-08 finished in 216 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(((F(G(p0)) U G(p1))&&G(p2))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Graph (trivial) has 213 edges and 209 vertex of which 2 / 209 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 391 edges and 208 vertex of which 204 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 203 transition count 197
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 134 transition count 195
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 142 place count 134 transition count 173
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 186 place count 112 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 189 place count 109 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 192 place count 109 transition count 168
Performed 36 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 264 place count 73 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 268 place count 73 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 270 place count 71 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 71 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 276 place count 69 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 277 place count 69 transition count 113
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
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 305 place count 55 transition count 116
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 312 place count 55 transition count 109
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 322 place count 45 transition count 89
Iterating global reduction 5 with 10 rules applied. Total rules applied 332 place count 45 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 338 place count 45 transition count 83
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 340 place count 43 transition count 77
Iterating global reduction 6 with 2 rules applied. Total rules applied 342 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 343 place count 43 transition count 76
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 7 with 2 rules applied. Total rules applied 345 place count 42 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 355 place count 42 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 357 place count 40 transition count 74
Applied a total of 357 rules in 24 ms. Remains 40 /209 variables (removed 169) and now considering 74/273 (removed 199) transitions.
[2025-05-30 11:57:47] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
// Phase 1: matrix 68 rows 40 cols
[2025-05-30 11:57:47] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:48] [INFO ] Implicit Places using invariants in 72 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/209 places, 74/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 39/209 places, 74/273 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-08-LTLFireability-11
Stuttering criterion allowed to conclude after 28 steps with 2 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-11 finished in 361 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 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Graph (trivial) has 214 edges and 209 vertex of which 2 / 209 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 391 edges and 208 vertex of which 204 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 203 transition count 196
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 145 place count 133 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 132 transition count 193
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 146 place count 132 transition count 171
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 190 place count 110 transition count 171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 193 place count 107 transition count 166
Iterating global reduction 3 with 3 rules applied. Total rules applied 196 place count 107 transition count 166
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 268 place count 71 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 271 place count 71 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 273 place count 69 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 275 place count 69 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 279 place count 67 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 280 place count 67 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 308 place count 53 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 317 place count 53 transition count 105
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 328 place count 42 transition count 83
Iterating global reduction 6 with 11 rules applied. Total rules applied 339 place count 42 transition count 83
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 346 place count 42 transition count 76
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 349 place count 39 transition count 67
Iterating global reduction 7 with 3 rules applied. Total rules applied 352 place count 39 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 354 place count 39 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 356 place count 38 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 363 place count 38 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 365 place count 36 transition count 63
Applied a total of 365 rules in 21 ms. Remains 36 /209 variables (removed 173) and now considering 63/273 (removed 210) transitions.
[2025-05-30 11:57:48] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 36 cols
[2025-05-30 11:57:48] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:48] [INFO ] Implicit Places using invariants in 175 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 176 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/209 places, 63/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 35/209 places, 63/273 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 42 reset in 74 ms.
Product exploration explored 100000 steps with 22 reset in 70 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 40 ms :[(NOT p0)]
RANDOM walk for 1301 steps (156 resets) in 16 ms. (76 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 76 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)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-30 11:57:48] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 35 cols
[2025-05-30 11:57:48] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-30 11:57:48] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2025-05-30 11:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:57:49] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:57:49] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2025-05-30 11:57:49] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2025-05-30 11:57:49] [INFO ] Invariant cache hit.
[2025-05-30 11:57:49] [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/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 58/93 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 1/94 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 40 constraints, problems are : Problem set: 0 solved, 48 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 58/93 variables, 35/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 48/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 88 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2118ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2221 ms. Remains : 35/35 places, 63/63 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 33 ms :[(NOT p0)]
RANDOM walk for 1629 steps (199 resets) in 8 ms. (181 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 86 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22 reset in 34 ms.
Product exploration explored 100000 steps with 65 reset in 130 ms.
Built C files in :
/tmp/ltsmin736626176232657639
[2025-05-30 11:57:51] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2025-05-30 11:57:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:57:51] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2025-05-30 11:57:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:57:51] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2025-05-30 11:57:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:57:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin736626176232657639
Running compilation step : cd /tmp/ltsmin736626176232657639;'/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 147 ms.
Running link step : cd /tmp/ltsmin736626176232657639;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin736626176232657639;'/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/stateBased15263114867051459778.hoa' '--buchi-type=spotba'
LTSmin run took 2486 ms.
FORMULA CO4-PT-08-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-08-LTLFireability-12 finished in 6070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 202 transition count 264
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 202 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 15 place count 202 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 200 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 200 transition count 261
Applied a total of 19 rules in 10 ms. Remains 200 /209 variables (removed 9) and now considering 261/273 (removed 12) transitions.
// Phase 1: matrix 261 rows 200 cols
[2025-05-30 11:57:54] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:54] [INFO ] Implicit Places using invariants in 64 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/209 places, 261/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 199/209 places, 261/273 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 129 reset in 79 ms.
Entered a terminal (fully accepting) state of product in 906 steps with 30 reset in 2 ms.
FORMULA CO4-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-13 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(X(F(p0))))))))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 273/273 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 201 transition count 263
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 201 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 201 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 198 transition count 259
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 198 transition count 259
Applied a total of 23 rules in 6 ms. Remains 198 /209 variables (removed 11) and now considering 259/273 (removed 14) transitions.
// Phase 1: matrix 259 rows 198 cols
[2025-05-30 11:57:54] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:57:54] [INFO ] Implicit Places using invariants in 69 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/209 places, 259/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 197 /197 variables (removed 0) and now considering 259/259 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 197/209 places, 259/273 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CO4-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-08-LTLFireability-15 finished in 215 ms.
All properties solved by simple procedures.
Total runtime 86803 ms.

BK_STOP 1748606274916

--------------------
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-08"
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-08, 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-174854028400436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-08.tgz
mv CO4-PT-08 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 ;