Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 132K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-10-LTLFireability-00
FORMULA_NAME CO4-PT-10-LTLFireability-01
FORMULA_NAME CO4-PT-10-LTLFireability-02
FORMULA_NAME CO4-PT-10-LTLFireability-03
FORMULA_NAME CO4-PT-10-LTLFireability-04
FORMULA_NAME CO4-PT-10-LTLFireability-05
FORMULA_NAME CO4-PT-10-LTLFireability-06
FORMULA_NAME CO4-PT-10-LTLFireability-07
FORMULA_NAME CO4-PT-10-LTLFireability-08
FORMULA_NAME CO4-PT-10-LTLFireability-09
FORMULA_NAME CO4-PT-10-LTLFireability-10
FORMULA_NAME CO4-PT-10-LTLFireability-11
FORMULA_NAME CO4-PT-10-LTLFireability-12
FORMULA_NAME CO4-PT-10-LTLFireability-13
FORMULA_NAME CO4-PT-10-LTLFireability-14
FORMULA_NAME CO4-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748606689226

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 12:04:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 12:04:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:04:50] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2025-05-30 12:04:50] [INFO ] Transformed 544 places.
[2025-05-30 12:04:50] [INFO ] Transformed 615 transitions.
[2025-05-30 12:04:50] [INFO ] Found NUPN structural information;
[2025-05-30 12:04:50] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 194 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 3 formulas.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 375 transition count 435
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 74 place count 316 transition count 374
Iterating global reduction 1 with 59 rules applied. Total rules applied 133 place count 316 transition count 374
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 180 place count 269 transition count 327
Iterating global reduction 1 with 47 rules applied. Total rules applied 227 place count 269 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 230 place count 269 transition count 324
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 252 place count 247 transition count 302
Iterating global reduction 2 with 22 rules applied. Total rules applied 274 place count 247 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 247 transition count 301
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 289 place count 233 transition count 287
Iterating global reduction 3 with 14 rules applied. Total rules applied 303 place count 233 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 306 place count 233 transition count 284
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 311 place count 228 transition count 279
Iterating global reduction 4 with 5 rules applied. Total rules applied 316 place count 228 transition count 279
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 317 place count 227 transition count 278
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 227 transition count 278
Applied a total of 318 rules in 113 ms. Remains 227 /387 variables (removed 160) and now considering 278/438 (removed 160) transitions.
// Phase 1: matrix 278 rows 227 cols
[2025-05-30 12:04:50] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:51] [INFO ] Implicit Places using invariants in 204 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 241 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/387 places, 278/438 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 226/387 places, 278/438 transitions.
Support contains 19 out of 226 places after structural reductions.
[2025-05-30 12:04:51] [INFO ] Flatten gal took : 36 ms
[2025-05-30 12:04:51] [INFO ] Flatten gal took : 15 ms
[2025-05-30 12:04:51] [INFO ] Input system was already deterministic with 278 transitions.
RANDOM walk for 40000 steps (28 resets) in 1390 ms. (28 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (31 resets) in 58 ms. (67 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4002 steps (24 resets) in 53 ms. (74 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4001 steps (20 resets) in 99 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (29 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (31 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (37 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (29 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (22 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (35 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (31 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (31 resets) in 18 ms. (210 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
// Phase 1: matrix 278 rows 226 cols
[2025-05-30 12:04:52] [INFO ] Computed 3 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 54/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 145/212 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 163/375 variables, 73/150 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 13/388 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 89/477 variables, 56/211 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:04:53] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 21/498 variables, 14/226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 5/503 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 1/504 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/504 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 230 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2552 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 54/67 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 145/212 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 163/375 variables, 73/164 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 13/388 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 89/477 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 21/498 variables, 14/240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 1/504 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 0/504 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 244 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2423 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5010ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=121 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 716 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 350 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(!p0)&&G(p1))) U X(p2)))'
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 278/278 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 218 transition count 270
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 218 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 213 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 213 transition count 265
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 210 transition count 262
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 210 transition count 262
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 207 transition count 259
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 206 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 206 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 205 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 205 transition count 257
Applied a total of 42 rules in 26 ms. Remains 205 /226 variables (removed 21) and now considering 257/278 (removed 21) transitions.
// Phase 1: matrix 257 rows 205 cols
[2025-05-30 12:04:58] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-30 12:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:04:58] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-05-30 12:04:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/462 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:03] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 210 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15478 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/462 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 256/466 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:23] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 467 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45551ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 45552ms
Starting structural reductions in LTL mode, iteration 1 : 205/226 places, 257/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45808 ms. Remains : 205/226 places, 257/278 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CO4-PT-10-LTLFireability-00
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 4 ms.
FORMULA CO4-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-00 finished in 46298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 278/278 transitions.
Graph (trivial) has 230 edges and 226 vertex of which 3 / 226 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 348 edges and 224 vertex of which 218 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 217 transition count 177
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 184 place count 126 transition count 177
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 184 place count 126 transition count 155
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 228 place count 104 transition count 155
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 101 transition count 152
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 101 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 234 place count 101 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 100 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 238 place count 98 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 98 transition count 149
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 312 place count 62 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 314 place count 62 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 317 place count 59 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 320 place count 59 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 58 transition count 96
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 348 place count 45 transition count 97
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 356 place count 45 transition count 89
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 366 place count 35 transition count 69
Iterating global reduction 4 with 10 rules applied. Total rules applied 376 place count 35 transition count 69
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 383 place count 35 transition count 62
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 386 place count 32 transition count 53
Iterating global reduction 5 with 3 rules applied. Total rules applied 389 place count 32 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 391 place count 32 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 393 place count 31 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 406 place count 31 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 407 place count 30 transition count 47
Applied a total of 407 rules in 47 ms. Remains 30 /226 variables (removed 196) and now considering 47/278 (removed 231) transitions.
[2025-05-30 12:05:44] [INFO ] Flow matrix only has 43 transitions (discarded 4 similar events)
// Phase 1: matrix 43 rows 30 cols
[2025-05-30 12:05:44] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 12:05:44] [INFO ] Flow matrix only has 43 transitions (discarded 4 similar events)
[2025-05-30 12:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:05:44] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:05:44] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2025-05-30 12:05:44] [INFO ] Flow matrix only has 43 transitions (discarded 4 similar events)
[2025-05-30 12:05:44] [INFO ] Invariant cache hit.
[2025-05-30 12:05:44] [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/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/73 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 34 constraints, problems are : Problem set: 0 solved, 38 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 38/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 72 constraints, problems are : Problem set: 0 solved, 38 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1363ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1364ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/226 places, 47/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1493 ms. Remains : 30/226 places, 47/278 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-10-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-01 finished in 1601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 278/278 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 218 transition count 270
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 218 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 214 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 214 transition count 266
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 211 transition count 263
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 211 transition count 263
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 208 transition count 260
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 208 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 207 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 206 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 206 transition count 258
Applied a total of 40 rules in 19 ms. Remains 206 /226 variables (removed 20) and now considering 258/278 (removed 20) transitions.
// Phase 1: matrix 258 rows 206 cols
[2025-05-30 12:05:46] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:46] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-30 12:05:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:05:46] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:05:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/464 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:05:51] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 211 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15789 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/464 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 257/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:13] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 469 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45840ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45841ms
Starting structural reductions in LTL mode, iteration 1 : 206/226 places, 258/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46030 ms. Remains : 206/226 places, 258/278 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 214 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 327 edges and 206 vertex of which 201 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-10-LTLFireability-02 finished in 46575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((X(X(p1))&&F(p2)))))))'
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 278/278 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 218 transition count 270
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 218 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 214 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 214 transition count 266
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 211 transition count 263
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 211 transition count 263
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 208 transition count 260
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 208 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 207 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 206 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 206 transition count 258
Applied a total of 40 rules in 10 ms. Remains 206 /226 variables (removed 20) and now considering 258/278 (removed 20) transitions.
// Phase 1: matrix 258 rows 206 cols
[2025-05-30 12:06:32] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-30 12:06:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:06:32] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:06:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/464 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:38] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:06:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 211 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15500 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/464 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 257/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:00] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 469 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45551ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45552ms
Starting structural reductions in LTL mode, iteration 1 : 206/226 places, 258/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45730 ms. Remains : 206/226 places, 258/278 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CO4-PT-10-LTLFireability-07
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-07 finished in 46038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U X((p2&&(G(p3)||(p3&&F(p0)))))))'
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 278/278 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 219 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 219 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 216 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 216 transition count 268
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 215 transition count 267
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 215 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 214 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 214 transition count 266
Applied a total of 24 rules in 12 ms. Remains 214 /226 variables (removed 12) and now considering 266/278 (removed 12) transitions.
// Phase 1: matrix 266 rows 214 cols
[2025-05-30 12:07:18] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 12:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:07:18] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-05-30 12:07:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/480 variables, 214/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:24] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 219 constraints, problems are : Problem set: 0 solved, 265 unsolved in 16580 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/480 variables, 214/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 265/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:07:42] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 485 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46613ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 46614ms
Starting structural reductions in LTL mode, iteration 1 : 214/226 places, 266/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46803 ms. Remains : 214/226 places, 266/278 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 10 reset in 79 ms.
Product exploration explored 100000 steps with 6 reset in 160 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 333 edges and 214 vertex of which 209 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X p3), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (AND (NOT p0) p2 p3)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT p0)), (X (NOT (OR (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (AND (NOT p0) p3))), (X (X (NOT p1))), (X (X (NOT (OR (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (AND (NOT p0) p2 p3))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 121 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (53 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (43 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (16 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (41 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (26 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110502 steps, run visited all 4 properties in 519 ms. (steps per millisecond=212 )
Probabilistic random walk after 110502 steps, saw 27372 distinct states, run finished after 523 ms. (steps per millisecond=211 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 p3), (X p2), (X p3), (X (AND (NOT p0) (NOT p1) p2 p3)), (X (AND (NOT p0) p2 p3)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (NOT p0)), (X (NOT (OR (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))), (X (X (AND (NOT p0) p3))), (X (X (NOT p1))), (X (X (NOT (OR (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2 p3))), (X (X (AND (NOT p0) p2 p3))), (X (X (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p3))), (F (NOT p3)), (F p0), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 23 factoid took 238 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 214 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 214 /214 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2025-05-30 12:08:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 12:08:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:08:08] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-05-30 12:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/480 variables, 214/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:13] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:13] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 219 constraints, problems are : Problem set: 0 solved, 265 unsolved in 16436 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/480 variables, 214/219 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 265/484 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:31] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 485 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46475ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 46476ms
Finished structural reductions in LTL mode , in 1 iterations and 46660 ms. Remains : 214/214 places, 266/266 transitions.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 333 edges and 214 vertex of which 209 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) p3), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (27 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (53 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (24 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (46 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (26 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110502 steps, run visited all 4 properties in 428 ms. (steps per millisecond=258 )
Probabilistic random walk after 110502 steps, saw 27372 distinct states, run finished after 428 ms. (steps per millisecond=258 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p3), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p3))), (F (NOT p3)), (F p0), (F (NOT (OR p0 p3)))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 23 reset in 77 ms.
Product exploration explored 100000 steps with 10 reset in 188 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 266/266 transitions.
Graph (trivial) has 222 edges and 214 vertex of which 3 / 214 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 331 edges and 212 vertex of which 207 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 207 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 89 place count 207 transition count 258
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 207 transition count 258
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 121 place count 178 transition count 229
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 150 place count 178 transition count 229
Performed 45 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 195 place count 178 transition count 257
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 201 place count 178 transition count 251
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 242 place count 137 transition count 210
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 283 place count 137 transition count 210
Performed 24 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 307 place count 137 transition count 313
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 336 place count 137 transition count 284
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 374 place count 99 transition count 195
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 3 with 38 rules applied. Total rules applied 412 place count 99 transition count 195
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 426 place count 99 transition count 181
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 449 place count 76 transition count 142
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 472 place count 76 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 473 place count 76 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 475 place count 74 transition count 137
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 477 place count 74 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 478 place count 74 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 485 place count 74 transition count 154
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 488 place count 71 transition count 133
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 491 place count 71 transition count 133
Deduced a syphon composed of 38 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 495 place count 71 transition count 129
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 495 rules in 73 ms. Remains 71 /214 variables (removed 143) and now considering 129/266 (removed 137) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:08:56] [INFO ] Redundant transitions in 3 ms returned []
Running 128 sub problems to find dead transitions.
[2025-05-30 12:08:56] [INFO ] Flow matrix only has 125 transitions (discarded 4 similar events)
// Phase 1: matrix 125 rows 71 cols
[2025-05-30 12:08:56] [INFO ] Computed 3 invariants in 0 ms
[2025-05-30 12:08:56] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:08:57] [INFO ] Deduced a trap composed of 5 places in 23 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 12:08:57] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 3/6 constraints. Problems are: Problem set: 8 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 120 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 4 (OVERLAPS) 124/195 variables, 71/77 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 5/82 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/82 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/83 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/83 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/83 constraints. Problems are: Problem set: 76 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 83 constraints, problems are : Problem set: 76 solved, 52 unsolved in 2819 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 76 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 9/41 variables, 3/3 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/6 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 115/156 variables, 41/47 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 5/52 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 52/104 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/104 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 39/195 variables, 30/134 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/134 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/135 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/135 constraints. Problems are: Problem set: 76 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/135 constraints. Problems are: Problem set: 76 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 135 constraints, problems are : Problem set: 76 solved, 52 unsolved in 3093 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 52/128 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5933ms problems are : Problem set: 76 solved, 52 unsolved
Search for dead transitions found 76 dead transitions in 5933ms
Found 76 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 76 transitions
Dead transitions reduction (with SMT) removed 76 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 71/214 places, 53/266 transitions.
Graph (complete) has 98 edges and 71 vertex of which 33 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 33 /71 variables (removed 38) and now considering 53/53 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/214 places, 53/266 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6018 ms. Remains : 33/214 places, 53/266 transitions.
Built C files in :
/tmp/ltsmin9691777408594279583
[2025-05-30 12:09:02] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9691777408594279583
Running compilation step : cd /tmp/ltsmin9691777408594279583;'/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 466 ms.
Running link step : cd /tmp/ltsmin9691777408594279583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9691777408594279583;'/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/stateBased5043523717504735301.hoa' '--buchi-type=spotba'
LTSmin run took 2744 ms.
FORMULA CO4-PT-10-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-10-LTLFireability-09 finished in 107237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 278/278 transitions.
Graph (trivial) has 229 edges and 226 vertex of which 3 / 226 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 348 edges and 224 vertex of which 218 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 217 transition count 177
Reduce places removed 91 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 126 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 124 transition count 175
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 188 place count 124 transition count 153
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 232 place count 102 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 235 place count 99 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 238 place count 99 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 238 place count 99 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 98 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 242 place count 96 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 244 place count 96 transition count 147
Performed 33 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 310 place count 63 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 312 place count 63 transition count 104
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 315 place count 60 transition count 101
Iterating global reduction 4 with 3 rules applied. Total rules applied 318 place count 60 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 59 transition count 100
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 348 place count 45 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 355 place count 45 transition count 94
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 366 place count 34 transition count 72
Iterating global reduction 5 with 11 rules applied. Total rules applied 377 place count 34 transition count 72
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 383 place count 34 transition count 66
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 386 place count 31 transition count 57
Iterating global reduction 6 with 3 rules applied. Total rules applied 389 place count 31 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 390 place count 31 transition count 56
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 392 place count 30 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 408 place count 30 transition count 48
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 412 place count 30 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 414 place count 28 transition count 46
Applied a total of 414 rules in 29 ms. Remains 28 /226 variables (removed 198) and now considering 46/278 (removed 232) transitions.
[2025-05-30 12:09:05] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 28 cols
[2025-05-30 12:09:05] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-30 12:09:05] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-05-30 12:09:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:09:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:09:05] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2025-05-30 12:09:05] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-05-30 12:09:05] [INFO ] Invariant cache hit.
[2025-05-30 12:09:05] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 43/71 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 1/72 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/72 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 33 constraints, problems are : Problem set: 0 solved, 36 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 43/71 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 36/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 69 constraints, problems are : Problem set: 0 solved, 36 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1203ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/226 places, 46/278 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1292 ms. Remains : 28/226 places, 46/278 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-10-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-10-LTLFireability-12 finished in 1429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))&&(G(p2)||F(p3))))'
Support contains 3 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 278/278 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 219 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 219 transition count 271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 214 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 214 transition count 266
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 211 transition count 263
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 211 transition count 263
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 208 transition count 260
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 208 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 207 transition count 259
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 206 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 206 transition count 258
Applied a total of 40 rules in 16 ms. Remains 206 /226 variables (removed 20) and now considering 258/278 (removed 20) transitions.
// Phase 1: matrix 258 rows 206 cols
[2025-05-30 12:09:07] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 12:09:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:07] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2025-05-30 12:09:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/464 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:13] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:13] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 211 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15777 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/464 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 257/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:09:29] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 469 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45812ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45812ms
Starting structural reductions in LTL mode, iteration 1 : 206/226 places, 258/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45970 ms. Remains : 206/226 places, 258/278 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 324 edges and 206 vertex of which 200 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X (AND p1 p0)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (AND p1 p0))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 105 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (28 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (93 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (77 resets) in 95 ms. (416 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40000 steps (51 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (49 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
[2025-05-30 12:09:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/16 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/34 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 55/89 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 131/220 variables, 52/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 143/363 variables, 72/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/377 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 64/441 variables, 40/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/441 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 22/463 variables, 14/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/463 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 20 (OVERLAPS) 1/464 variables, 1/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/464 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/464 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 209 constraints, problems are : Problem set: 1 solved, 2 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 10/16 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 18/34 variables, 7/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 55/89 variables, 13/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 131/220 variables, 52/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 143/363 variables, 72/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/377 variables, 3/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/377 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 64/441 variables, 40/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/441 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 22/463 variables, 14/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/464 variables, 1/211 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 211 constraints, problems are : Problem set: 1 solved, 2 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p1 p0), (X p2), (X (AND p1 p0)), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (AND p1 p0))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 22 factoid took 284 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), true, (NOT p1)]
Support contains 2 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 258/258 transitions.
Graph (trivial) has 212 edges and 206 vertex of which 3 / 206 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 322 edges and 204 vertex of which 199 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 198 transition count 171
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 120 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 119 transition count 170
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 160 place count 119 transition count 148
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 204 place count 97 transition count 148
Performed 34 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 272 place count 63 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 274 place count 63 transition count 102
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 277 place count 60 transition count 99
Iterating global reduction 4 with 3 rules applied. Total rules applied 280 place count 60 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 282 place count 59 transition count 98
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 310 place count 45 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 316 place count 45 transition count 93
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 327 place count 34 transition count 71
Iterating global reduction 5 with 11 rules applied. Total rules applied 338 place count 34 transition count 71
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 344 place count 34 transition count 65
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 347 place count 31 transition count 56
Iterating global reduction 6 with 3 rules applied. Total rules applied 350 place count 31 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 352 place count 31 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 358 place count 31 transition count 48
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 363 place count 31 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 365 place count 29 transition count 46
Applied a total of 365 rules in 18 ms. Remains 29 /206 variables (removed 177) and now considering 46/258 (removed 212) transitions.
[2025-05-30 12:09:55] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
// Phase 1: matrix 44 rows 29 cols
[2025-05-30 12:09:55] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-30 12:09:55] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-05-30 12:09:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:09:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 12:09:55] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:09:55] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2025-05-30 12:09:55] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-05-30 12:09:55] [INFO ] Invariant cache hit.
[2025-05-30 12:09:55] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 43/72 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 1/73 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/73 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 34 constraints, problems are : Problem set: 0 solved, 36 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 43/72 variables, 29/32 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 36/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 1/73 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 70 constraints, problems are : Problem set: 0 solved, 36 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 29/29 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1212ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1212ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/206 places, 46/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1293 ms. Remains : 29/206 places, 46/258 transitions.
Computed a total of 6 stabilizing places and 11 stable transitions
Graph (complete) has 80 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (5631 resets) in 254 ms. (156 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (935 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2025-05-30 12:09:56] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2025-05-30 12:09:56] [INFO ] Invariant cache hit.
[2025-05-30 12:09:56] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/25 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 51/73 variables, and 16 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, State Equation: 16/29 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 304 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 6 reset in 80 ms.
Product exploration explored 100000 steps with 6 reset in 87 ms.
Built C files in :
/tmp/ltsmin8094804658805540265
[2025-05-30 12:09:57] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2025-05-30 12:09:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:09:57] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2025-05-30 12:09:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:09:57] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2025-05-30 12:09:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 12:09:57] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8094804658805540265
Running compilation step : cd /tmp/ltsmin8094804658805540265;'/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 117 ms.
Running link step : cd /tmp/ltsmin8094804658805540265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8094804658805540265;'/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/stateBased9345489409675433018.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA CO4-PT-10-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-10-LTLFireability-15 finished in 50462 ms.
All properties solved by simple procedures.
Total runtime 307342 ms.

BK_STOP 1748606997817

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

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