Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007300060.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 FunctionPointer-PT-b002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007300060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748739896363

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 01:04:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 01:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:04:59] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2025-06-01 01:04:59] [INFO ] Transformed 306 places.
[2025-06-01 01:04:59] [INFO ] Transformed 840 transitions.
[2025-06-01 01:04:59] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 536 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 84 places in 13 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 528
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 528
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 94 place count 189 transition count 490
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 176 transition count 464
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 176 transition count 464
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 132 place count 176 transition count 452
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 138 place count 170 transition count 440
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 170 transition count 440
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 150 place count 164 transition count 416
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 164 transition count 416
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 161 place count 159 transition count 406
Iterating global reduction 3 with 5 rules applied. Total rules applied 166 place count 159 transition count 406
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 156 transition count 394
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 156 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 154 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 154 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 152 transition count 382
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 152 transition count 382
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 182 place count 150 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 150 transition count 378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 149 transition count 376
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 149 transition count 376
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 148 transition count 374
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 148 transition count 374
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 147 transition count 372
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 147 transition count 372
Applied a total of 190 rules in 237 ms. Remains 147 /222 variables (removed 75) and now considering 372/648 (removed 276) transitions.
[2025-06-01 01:05:00] [INFO ] Flow matrix only has 252 transitions (discarded 120 similar events)
// Phase 1: matrix 252 rows 147 cols
[2025-06-01 01:05:00] [INFO ] Computed 2 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:05:00] [INFO ] Implicit Places using invariants in 558 ms returned []
[2025-06-01 01:05:00] [INFO ] Flow matrix only has 252 transitions (discarded 120 similar events)
[2025-06-01 01:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:05:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-01 01:05:01] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-01 01:05:01] [INFO ] Flow matrix only has 252 transitions (discarded 120 similar events)
[2025-06-01 01:05:01] [INFO ] Invariant cache hit.
[2025-06-01 01:05:01] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 252/399 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 55/204 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 370 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 204 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25252 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 252/399 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 55/204 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 370/574 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:43] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:43] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:43] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:43] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:43] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:43] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:44] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:45] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 8/582 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 582 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 56003ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 56039ms
Starting structural reductions in LTL mode, iteration 1 : 147/222 places, 372/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57826 ms. Remains : 147/222 places, 372/648 transitions.
Support contains 21 out of 147 places after structural reductions.
[2025-06-01 01:05:58] [INFO ] Flatten gal took : 112 ms
[2025-06-01 01:05:58] [INFO ] Flatten gal took : 58 ms
[2025-06-01 01:05:58] [INFO ] Input system was already deterministic with 372 transitions.
RANDOM walk for 40000 steps (73 resets) in 1364 ms. (29 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40003 steps (13 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
[2025-06-01 01:05:58] [INFO ] Flow matrix only has 252 transitions (discarded 120 similar events)
[2025-06-01 01:05:58] [INFO ] Invariant cache hit.
[2025-06-01 01:05:58] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/175 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 161/336 variables, 60/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 40/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/337 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 43/380 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/396 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/399 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/399 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/399 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 204 constraints, problems are : Problem set: 0 solved, 2 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 125/175 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:59] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:59] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 161/336 variables, 60/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 40/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:59] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:05:59] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/337 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 43/380 variables, 29/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:00] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:00] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:00] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 16/396 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 3/399 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/399 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 2192ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 137 transition count 342
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 137 transition count 342
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 137 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 131 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 131 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 125 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 115 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 110 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 99 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 97 transition count 234
Applied a total of 110 rules in 134 ms. Remains 97 /147 variables (removed 50) and now considering 234/372 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 97/147 places, 234/372 transitions.
RANDOM walk for 39108 steps (117 resets) in 1681 ms. (23 steps per ms) remains 0/2 properties
FORMULA FunctionPointer-PT-b002-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X((X(G(p0))&&F(p1)))))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 138 transition count 344
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 138 transition count 344
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 138 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 132 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 132 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 126 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 116 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 116 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 111 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 111 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 107 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 107 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 103 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 103 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 100 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 98 transition count 240
Applied a total of 104 rules in 45 ms. Remains 98 /147 variables (removed 49) and now considering 240/372 (removed 132) transitions.
[2025-06-01 01:06:02] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2025-06-01 01:06:02] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:06:02] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-01 01:06:02] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 01:06:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:06:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 01:06:02] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-06-01 01:06:02] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2025-06-01 01:06:02] [INFO ] Invariant cache hit.
[2025-06-01 01:06:02] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 13177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:06:24] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 383 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 43391ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 43395ms
Starting structural reductions in LTL mode, iteration 1 : 98/147 places, 240/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43978 ms. Remains : 98/147 places, 240/372 transitions.
Stuttering acceptance computed with spot in 762 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-01
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-01 finished in 44846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U p1))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 138 transition count 348
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 138 transition count 348
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 30 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 133 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 133 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 128 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 128 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 124 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 113 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 111 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 107 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 107 transition count 256
Applied a total of 96 rules in 118 ms. Remains 107 /147 variables (removed 40) and now considering 256/372 (removed 116) transitions.
[2025-06-01 01:06:47] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
// Phase 1: matrix 175 rows 107 cols
[2025-06-01 01:06:47] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:06:47] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-01 01:06:47] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2025-06-01 01:06:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:06:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 01:06:47] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:06:47] [INFO ] Redundant transitions in 22 ms returned []
Running 254 sub problems to find dead transitions.
[2025-06-01 01:06:47] [INFO ] Flow matrix only has 175 transitions (discarded 81 similar events)
[2025-06-01 01:06:47] [INFO ] Invariant cache hit.
[2025-06-01 01:06:47] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 151 constraints, problems are : Problem set: 0 solved, 254 unsolved in 11448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 175/282 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 254/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:08] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:08] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:08] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:08] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:08] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:08] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:08] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 7/412 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:18] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 413 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 41630ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 41632ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/147 places, 256/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42414 ms. Remains : 107/147 places, 256/372 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), p0]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-02
Product exploration explored 100000 steps with 545 reset in 612 ms.
Stack based approach found an accepted trace after 10226 steps with 50 reset with depth 21 and stack size 21 in 50 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-02 finished in 43217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 138 transition count 344
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 138 transition count 344
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 138 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 133 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 133 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 129 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 125 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 125 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 121 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 117 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 114 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 111 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 107 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 107 transition count 258
Applied a total of 90 rules in 93 ms. Remains 107 /147 variables (removed 40) and now considering 258/372 (removed 114) transitions.
[2025-06-01 01:07:30] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2025-06-01 01:07:30] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:07:30] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-01 01:07:30] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 01:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:07:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 01:07:30] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:07:30] [INFO ] Redundant transitions in 14 ms returned []
Running 256 sub problems to find dead transitions.
[2025-06-01 01:07:30] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2025-06-01 01:07:30] [INFO ] Invariant cache hit.
[2025-06-01 01:07:30] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 151 constraints, problems are : Problem set: 0 solved, 256 unsolved in 14520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 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/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/407 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:53] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:53] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:53] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:53] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:53] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:53] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:53] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:07:57] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 283/283 variables, and 415 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 44676ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 44678ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/147 places, 258/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45509 ms. Remains : 107/147 places, 258/372 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-05
Product exploration explored 100000 steps with 518 reset in 482 ms.
Stack based approach found an accepted trace after 18050 steps with 107 reset with depth 40 and stack size 40 in 102 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-05 finished in 46154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U G(p0))))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 137 transition count 342
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 137 transition count 342
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 137 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 131 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 131 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 125 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 125 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 115 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 110 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 99 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 97 transition count 236
Applied a total of 108 rules in 27 ms. Remains 97 /147 variables (removed 50) and now considering 236/372 (removed 136) transitions.
[2025-06-01 01:08:16] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2025-06-01 01:08:16] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:08:16] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-01 01:08:16] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2025-06-01 01:08:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:08:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 01:08:16] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2025-06-01 01:08:16] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2025-06-01 01:08:16] [INFO ] Invariant cache hit.
[2025-06-01 01:08:16] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 11571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:36] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:36] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:36] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:36] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:36] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:36] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:36] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:08:38] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 41692ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 41693ms
Starting structural reductions in LTL mode, iteration 1 : 97/147 places, 236/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42301 ms. Remains : 97/147 places, 236/372 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-07
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-07 finished in 42466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X((p0||X(G(p2))))&&(!p0 U (p1||G(!p0)))))))'
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 138 transition count 344
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 138 transition count 344
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 138 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 130 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 130 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 127 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 127 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 124 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 121 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 121 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 119 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 119 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 117 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 117 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 115 transition count 282
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 115 transition count 282
Applied a total of 72 rules in 15 ms. Remains 115 /147 variables (removed 32) and now considering 282/372 (removed 90) transitions.
[2025-06-01 01:08:58] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
// Phase 1: matrix 192 rows 115 cols
[2025-06-01 01:08:58] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:08:58] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-06-01 01:08:58] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:08:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:08:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 01:08:59] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2025-06-01 01:08:59] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:08:59] [INFO ] Invariant cache hit.
[2025-06-01 01:08:59] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/307 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 160 constraints, problems are : Problem set: 0 solved, 280 unsolved in 15396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/307 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 280/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:24] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:24] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:24] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:24] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:24] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:24] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:24] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:25] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 448 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 45626ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 45628ms
Starting structural reductions in LTL mode, iteration 1 : 115/147 places, 282/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46427 ms. Remains : 115/147 places, 282/372 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (AND p0 (NOT p1)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-09
Product exploration explored 100000 steps with 347 reset in 561 ms.
Product exploration explored 100000 steps with 381 reset in 549 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 157 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (83 resets) in 814 ms. (49 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
[2025-06-01 01:09:47] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:09:47] [INFO ] Invariant cache hit.
[2025-06-01 01:09:47] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/80 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/252 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/258 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 302/307 variables, and 149 constraints, problems are : Problem set: 1 solved, 0 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/115 constraints, ReadFeed: 35/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (G (OR p0 p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 p1 p2))), (F p0), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 533 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 272 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-01 01:09:48] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:09:48] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-01 01:09:48] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:09:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 01:09:49] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2025-06-01 01:09:49] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:09:49] [INFO ] Invariant cache hit.
[2025-06-01 01:09:49] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/307 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 160 constraints, problems are : Problem set: 0 solved, 280 unsolved in 14872 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/307 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 280/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:13] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:13] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:13] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:13] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:13] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:13] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:14] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:14] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 448 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 45101ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 45104ms
Finished structural reductions in LTL mode , in 1 iterations and 45786 ms. Remains : 115/115 places, 282/282 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 221 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
RANDOM walk for 40001 steps (80 resets) in 284 ms. (140 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2025-06-01 01:10:35] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:10:35] [INFO ] Invariant cache hit.
[2025-06-01 01:10:35] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/80 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/252 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/258 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/302 variables, 32/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 8/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/306 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/307 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/80 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/252 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/258 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 44/302 variables, 32/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/306 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/307 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/307 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 910ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3993 steps, including 397 resets, run visited all 1 properties in 20 ms. (steps per millisecond=199 )
Parikh walk visited 1 properties in 28 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1 p2))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 696 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 287 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 251 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 374 reset in 452 ms.
Product exploration explored 100000 steps with 339 reset in 652 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 204 ms :[true, false, (NOT p2), (AND (NOT p2) p0 (NOT p1)), false, (AND p0 (NOT p1))]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 282/282 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 276
Applied a total of 6 rules in 26 ms. Remains 115 /115 variables (removed 0) and now considering 276/282 (removed 6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:10:39] [INFO ] Redundant transitions in 7 ms returned []
Running 274 sub problems to find dead transitions.
[2025-06-01 01:10:39] [INFO ] Flow matrix only has 189 transitions (discarded 87 similar events)
// Phase 1: matrix 189 rows 115 cols
[2025-06-01 01:10:39] [INFO ] Computed 2 invariants in 2 ms
[2025-06-01 01:10:39] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 274 unsolved in 14258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 274/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:03] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:03] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:03] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:03] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:03] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:03] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:03] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:05] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 442 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 44471ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 44474ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/115 places, 276/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44516 ms. Remains : 115/115 places, 276/282 transitions.
Built C files in :
/tmp/ltsmin17600283022260984261
[2025-06-01 01:11:23] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17600283022260984261
Running compilation step : cd /tmp/ltsmin17600283022260984261;'/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 953 ms.
Running link step : cd /tmp/ltsmin17600283022260984261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin17600283022260984261;'/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/stateBased10186321780529649150.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2025-06-01 01:11:38] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
// Phase 1: matrix 192 rows 115 cols
[2025-06-01 01:11:38] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:11:39] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-01 01:11:39] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:11:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-01 01:11:39] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2025-06-01 01:11:39] [INFO ] Flow matrix only has 192 transitions (discarded 90 similar events)
[2025-06-01 01:11:39] [INFO ] Invariant cache hit.
[2025-06-01 01:11:39] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/307 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 160 constraints, problems are : Problem set: 0 solved, 280 unsolved in 15777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 192/307 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 280/440 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:05] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:05] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:05] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:05] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:05] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:05] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:05] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:06] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 448 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 45905ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 45906ms
Finished structural reductions in LTL mode , in 1 iterations and 46419 ms. Remains : 115/115 places, 282/282 transitions.
Built C files in :
/tmp/ltsmin5772666276499262266
[2025-06-01 01:12:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5772666276499262266
Running compilation step : cd /tmp/ltsmin5772666276499262266;'/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 644 ms.
Running link step : cd /tmp/ltsmin5772666276499262266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5772666276499262266;'/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/stateBased5469433675355709767.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 01:12:40] [INFO ] Flatten gal took : 21 ms
[2025-06-01 01:12:40] [INFO ] Flatten gal took : 19 ms
[2025-06-01 01:12:40] [INFO ] Time to serialize gal into /tmp/LTL14279352300052986821.gal : 6 ms
[2025-06-01 01:12:40] [INFO ] Time to serialize properties into /tmp/LTL845305826230590013.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14279352300052986821.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16814354146754655097.hoa' '-atoms' '/tmp/LTL845305826230590013.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL845305826230590013.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16814354146754655097.hoa
Detected timeout of ITS tools.
[2025-06-01 01:12:55] [INFO ] Flatten gal took : 30 ms
[2025-06-01 01:12:55] [INFO ] Flatten gal took : 30 ms
[2025-06-01 01:12:55] [INFO ] Time to serialize gal into /tmp/LTL7503310014142007715.gal : 8 ms
[2025-06-01 01:12:55] [INFO ] Time to serialize properties into /tmp/LTL539947383039253915.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7503310014142007715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL539947383039253915.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((!("((s1>=1)&&(l245>=1))"))U((G(!("((s1>=1)&&(l245>=1))")))||("((!((s1>=1)&&(l245>=1)))&&(!((s4>=1)&&(l148>=1))))")))U((G((!("((s1...453
Formula 0 simplified : ("((s1>=1)&&(l245>=1))" M !"((!((s1>=1)&&(l245>=1)))&&(!((s4>=1)&&(l148>=1))))") R (F(!"((!((s1>=1)&&(l245>=1)))&&(!((s4>=1)&&(l148>...331
Detected timeout of ITS tools.
[2025-06-01 01:13:10] [INFO ] Flatten gal took : 28 ms
[2025-06-01 01:13:10] [INFO ] Applying decomposition
[2025-06-01 01:13:10] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5511636200438179277.txt' '-o' '/tmp/graph5511636200438179277.bin' '-w' '/tmp/graph5511636200438179277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5511636200438179277.bin' '-l' '-1' '-v' '-w' '/tmp/graph5511636200438179277.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:13:11] [INFO ] Decomposing Gal with order
[2025-06-01 01:13:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:13:11] [INFO ] Removed a total of 475 redundant transitions.
[2025-06-01 01:13:11] [INFO ] Flatten gal took : 130 ms
[2025-06-01 01:13:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 34 ms.
[2025-06-01 01:13:11] [INFO ] Time to serialize gal into /tmp/LTL13997269246029378181.gal : 10 ms
[2025-06-01 01:13:11] [INFO ] Time to serialize properties into /tmp/LTL17488440286013538191.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13997269246029378181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17488440286013538191.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((!("((i2.u1.s1>=1)&&(i10.u31.l245>=1))"))U((G(!("((i2.u1.s1>=1)&&(i10.u31.l245>=1))")))||("((!((i2.u1.s1>=1)&&(i10.u31.l245>=1)))&...648
Formula 0 simplified : ("((i2.u1.s1>=1)&&(i10.u31.l245>=1))" M !"((!((i2.u1.s1>=1)&&(i10.u31.l245>=1)))&&(!((i7.u0.s4>=1)&&(i6.u23.l148>=1))))") R (F(!"((!...484
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b002-LTLFireability-09 finished in 267608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 139 transition count 350
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 139 transition count 350
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 28 place count 139 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 135 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 135 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 131 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 131 transition count 314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 127 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 123 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 123 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 119 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 119 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 116 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 113 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 111 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 109 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 109 transition count 260
Applied a total of 92 rules in 58 ms. Remains 109 /147 variables (removed 38) and now considering 260/372 (removed 112) transitions.
[2025-06-01 01:13:26] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2025-06-01 01:13:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:13:26] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-06-01 01:13:26] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:13:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:13:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 01:13:27] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:13:27] [INFO ] Redundant transitions in 4 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 01:13:27] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:13:27] [INFO ] Invariant cache hit.
[2025-06-01 01:13:27] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 14092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:50] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:50] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:50] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:50] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:51] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:51] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:51] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:13:56] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 419 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 44278ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 44280ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/147 places, 260/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45119 ms. Remains : 109/147 places, 260/372 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-13
Product exploration explored 100000 steps with 599 reset in 196 ms.
Product exploration explored 100000 steps with 651 reset in 236 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5504 steps (14 resets) in 14 ms. (366 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 260/260 transitions.
Applied a total of 0 rules in 12 ms. Remains 109 /109 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 01:14:12] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:14:12] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-01 01:14:12] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:14:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 01:14:13] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:14:13] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 01:14:13] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:14:13] [INFO ] Invariant cache hit.
[2025-06-01 01:14:13] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 12089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:33] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:34] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:34] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:34] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:34] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:34] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:34] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:14:39] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 419 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 42240ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 42242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42968 ms. Remains : 109/109 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6183 steps (24 resets) in 14 ms. (412 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 617 reset in 329 ms.
Product exploration explored 100000 steps with 640 reset in 358 ms.
Built C files in :
/tmp/ltsmin16733075113692393018
[2025-06-01 01:14:56] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2025-06-01 01:14:56] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:14:56] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2025-06-01 01:14:56] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:14:56] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2025-06-01 01:14:56] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:14:56] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16733075113692393018
Running compilation step : cd /tmp/ltsmin16733075113692393018;'/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 1044 ms.
Running link step : cd /tmp/ltsmin16733075113692393018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16733075113692393018;'/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/stateBased14938447983810963127.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 260/260 transitions.
Applied a total of 0 rules in 13 ms. Remains 109 /109 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2025-06-01 01:15:11] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:15:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:15:11] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-01 01:15:11] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:15:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:15:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-01 01:15:12] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:15:12] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2025-06-01 01:15:12] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2025-06-01 01:15:12] [INFO ] Invariant cache hit.
[2025-06-01 01:15:12] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 14124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:35] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:35] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:35] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:35] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:35] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:35] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:35] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:15:40] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 287/287 variables, and 419 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 44272ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 44275ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44885 ms. Remains : 109/109 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin4797599887437016281
[2025-06-01 01:15:56] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2025-06-01 01:15:56] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:15:56] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2025-06-01 01:15:56] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:15:56] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2025-06-01 01:15:56] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:15:56] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4797599887437016281
Running compilation step : cd /tmp/ltsmin4797599887437016281;'/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 1065 ms.
Running link step : cd /tmp/ltsmin4797599887437016281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin4797599887437016281;'/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/stateBased1724105343633259146.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 01:16:11] [INFO ] Flatten gal took : 16 ms
[2025-06-01 01:16:11] [INFO ] Flatten gal took : 16 ms
[2025-06-01 01:16:11] [INFO ] Time to serialize gal into /tmp/LTL4018267696397589838.gal : 6 ms
[2025-06-01 01:16:11] [INFO ] Time to serialize properties into /tmp/LTL9662770379347890600.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4018267696397589838.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10802197432590375046.hoa' '-atoms' '/tmp/LTL9662770379347890600.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9662770379347890600.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10802197432590375046.hoa
Detected timeout of ITS tools.
[2025-06-01 01:16:27] [INFO ] Flatten gal took : 24 ms
[2025-06-01 01:16:27] [INFO ] Flatten gal took : 23 ms
[2025-06-01 01:16:27] [INFO ] Time to serialize gal into /tmp/LTL8192371431320689196.gal : 4 ms
[2025-06-01 01:16:27] [INFO ] Time to serialize properties into /tmp/LTL1690848995719820846.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8192371431320689196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1690848995719820846.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((s0<1)||(l128<1))&&((s1<1)||(l177<1)))"))))
Formula 0 simplified : FG!"(((s0<1)||(l128<1))&&((s1<1)||(l177<1)))"
Detected timeout of ITS tools.
[2025-06-01 01:16:42] [INFO ] Flatten gal took : 13 ms
[2025-06-01 01:16:42] [INFO ] Applying decomposition
[2025-06-01 01:16:42] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9514976424993288570.txt' '-o' '/tmp/graph9514976424993288570.bin' '-w' '/tmp/graph9514976424993288570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9514976424993288570.bin' '-l' '-1' '-v' '-w' '/tmp/graph9514976424993288570.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:16:42] [INFO ] Decomposing Gal with order
[2025-06-01 01:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:16:42] [INFO ] Removed a total of 433 redundant transitions.
[2025-06-01 01:16:42] [INFO ] Flatten gal took : 31 ms
[2025-06-01 01:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 12 ms.
[2025-06-01 01:16:42] [INFO ] Time to serialize gal into /tmp/LTL17883548227766802234.gal : 3 ms
[2025-06-01 01:16:42] [INFO ] Time to serialize properties into /tmp/LTL5967687730332734714.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17883548227766802234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5967687730332734714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i9.u0.s0<1)||(i7.u20.l128<1))&&((i4.u1.s1<1)||(i11.u28.l177<1)))"))))
Formula 0 simplified : FG!"(((i9.u0.s0<1)||(i7.u20.l128<1))&&((i4.u1.s1<1)||(i11.u28.l177<1)))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b002-LTLFireability-13 finished in 210881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 138 transition count 344
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 138 transition count 344
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 138 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 132 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 132 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 126 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 116 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 116 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 111 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 111 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 107 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 107 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 103 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 103 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 100 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 98 transition count 238
Applied a total of 106 rules in 49 ms. Remains 98 /147 variables (removed 49) and now considering 238/372 (removed 134) transitions.
[2025-06-01 01:16:57] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2025-06-01 01:16:57] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:16:57] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-01 01:16:57] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2025-06-01 01:16:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:16:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 01:16:57] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:16:57] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2025-06-01 01:16:57] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2025-06-01 01:16:57] [INFO ] Invariant cache hit.
[2025-06-01 01:16:57] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:16] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:16] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:16] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:16] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:16] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:16] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:16] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:17:26] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 381 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 40771ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 40773ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/147 places, 238/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41325 ms. Remains : 98/147 places, 238/372 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-14
Product exploration explored 100000 steps with 526 reset in 305 ms.
Product exploration explored 100000 steps with 543 reset in 335 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 4370 steps (9 resets) in 20 ms. (208 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 238/238 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2025-06-01 01:17:39] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2025-06-01 01:17:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:17:39] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-01 01:17:39] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2025-06-01 01:17:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:17:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-01 01:17:40] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:17:40] [INFO ] Redundant transitions in 2 ms returned []
Running 236 sub problems to find dead transitions.
[2025-06-01 01:17:40] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2025-06-01 01:17:40] [INFO ] Invariant cache hit.
[2025-06-01 01:17:40] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 12117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:00] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:00] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:00] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:00] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:00] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:00] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:00] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:09] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 2)
(t2 1)
(t3 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 381 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 42247ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 42249ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42922 ms. Remains : 98/98 places, 238/238 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 8263 steps (27 resets) in 40 ms. (201 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 569 reset in 307 ms.
Stack based approach found an accepted trace after 54576 steps with 300 reset with depth 492 and stack size 490 in 182 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-14 finished in 86388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 372/372 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 139 transition count 348
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 139 transition count 348
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 139 transition count 340
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 135 transition count 330
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 135 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 131 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 131 transition count 316
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 128 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 128 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 125 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 125 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 122 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 122 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 119 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 119 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 116 transition count 282
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 116 transition count 282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 114 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 114 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 114 transition count 272
Applied a total of 80 rules in 48 ms. Remains 114 /147 variables (removed 33) and now considering 272/372 (removed 100) transitions.
[2025-06-01 01:18:23] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
// Phase 1: matrix 187 rows 114 cols
[2025-06-01 01:18:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:18:23] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-01 01:18:23] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2025-06-01 01:18:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:18:24] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-01 01:18:24] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:18:24] [INFO ] Redundant transitions in 1 ms returned []
Running 270 sub problems to find dead transitions.
[2025-06-01 01:18:24] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2025-06-01 01:18:24] [INFO ] Invariant cache hit.
[2025-06-01 01:18:24] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/301 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/301 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 160 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 187/301 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 44/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 270/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:49] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:49] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:49] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:49] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:49] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:49] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:49] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:18:50] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 438 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 45260ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 45262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/147 places, 272/372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46180 ms. Remains : 114/147 places, 272/372 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-15
Stuttering criterion allowed to conclude after 142 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-15 finished in 46344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X((p0||X(G(p2))))&&(!p0 U (p1||G(!p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2025-06-01 01:19:10] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12685169157590446365
[2025-06-01 01:19:10] [INFO ] Computing symmetric may disable matrix : 372 transitions.
[2025-06-01 01:19:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:19:10] [INFO ] Applying decomposition
[2025-06-01 01:19:10] [INFO ] Computing symmetric may enable matrix : 372 transitions.
[2025-06-01 01:19:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:19:10] [INFO ] Flatten gal took : 25 ms
[2025-06-01 01:19:10] [INFO ] Computing Do-Not-Accords matrix : 372 transitions.
[2025-06-01 01:19:10] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 01:19:10] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12685169157590446365
Running compilation step : cd /tmp/ltsmin12685169157590446365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4768084814697376873.txt' '-o' '/tmp/graph4768084814697376873.bin' '-w' '/tmp/graph4768084814697376873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4768084814697376873.bin' '-l' '-1' '-v' '-w' '/tmp/graph4768084814697376873.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:19:10] [INFO ] Decomposing Gal with order
[2025-06-01 01:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:19:10] [INFO ] Removed a total of 638 redundant transitions.
[2025-06-01 01:19:10] [INFO ] Flatten gal took : 98 ms
[2025-06-01 01:19:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 50 ms.
[2025-06-01 01:19:10] [INFO ] Time to serialize gal into /tmp/LTLFireability16772530737390355183.gal : 9 ms
[2025-06-01 01:19:10] [INFO ] Time to serialize properties into /tmp/LTLFireability14049779445395621172.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16772530737390355183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14049779445395621172.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((((!("((i0.u0.s1>=1)&&(i10.i1.u41.l245>=1))"))U((G(!("((i0.u0.s1>=1)&&(i10.i1.u41.l245>=1))")))||("((!((i0.u0.s1>=1)&&(i10.i1.u41.l2...691
Formula 0 simplified : ("((i0.u0.s1>=1)&&(i10.i1.u41.l245>=1))" M !"((!((i0.u0.s1>=1)&&(i10.i1.u41.l245>=1)))&&(!((i10.i1.u1.s4>=1)&&(i8.u29.l148>=1))))") ...518
Compilation finished in 1540 ms.
Running link step : cd /tmp/ltsmin12685169157590446365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12685169157590446365;'/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' '--ltl' '((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||(X(((LTLAPp0==true)||X([]((LTLAPp2==true)))))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin12685169157590446365;'/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' '--ltl' '((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true))) U ([]((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||(X(((LTLAPp0==true)||X([]((LTLAPp2==true)))))&&(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12685169157590446365;'/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' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: Initializing POR dependencies: labels 376, guards 372
pins2lts-mc-linux64( 4/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 1.077: LTL layer: formula: [](<>((LTLAPp3==true)))
pins2lts-mc-linux64( 1/ 8), 1.077: "[](<>((LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 1.077: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.167: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.174: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.184: There are 378 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.184: State length is 148, there are 375 groups
pins2lts-mc-linux64( 0/ 8), 1.184: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.184: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.184: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.184: Visible groups: 0 / 375, labels: 1 / 378
pins2lts-mc-linux64( 0/ 8), 1.184: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.184: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.242: [Blue] ~120 levels ~960 states ~2600 transitions
pins2lts-mc-linux64( 0/ 8), 1.287: [Blue] ~240 levels ~1920 states ~5232 transitions
pins2lts-mc-linux64( 0/ 8), 1.373: [Blue] ~480 levels ~3840 states ~10472 transitions
pins2lts-mc-linux64( 0/ 8), 1.728: [Blue] ~960 levels ~7680 states ~20944 transitions
pins2lts-mc-linux64( 0/ 8), 2.423: [Blue] ~1920 levels ~15360 states ~41888 transitions
pins2lts-mc-linux64( 6/ 8), 3.536: [Blue] ~2296 levels ~30720 states ~91864 transitions
pins2lts-mc-linux64( 6/ 8), 5.393: [Blue] ~4524 levels ~61440 states ~183248 transitions
pins2lts-mc-linux64( 6/ 8), 8.825: [Blue] ~8994 levels ~122880 states ~366232 transitions
pins2lts-mc-linux64( 6/ 8), 14.857: [Blue] ~17920 levels ~245760 states ~731944 transitions
pins2lts-mc-linux64( 6/ 8), 25.436: [Blue] ~35782 levels ~491520 states ~1463560 transitions
pins2lts-mc-linux64( 6/ 8), 45.507: [Blue] ~71504 levels ~983040 states ~2926560 transitions
pins2lts-mc-linux64( 6/ 8), 85.061: [Blue] ~142947 levels ~1966080 states ~5852928 transitions
pins2lts-mc-linux64( 6/ 8), 164.485: [Blue] ~285828 levels ~3932160 states ~11705416 transitions
pins2lts-mc-linux64( 6/ 8), 323.411: [Blue] ~571598 levels ~7864320 states ~23410472 transitions
pins2lts-mc-linux64( 1/ 8), 563.921: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 564.092:
pins2lts-mc-linux64( 0/ 8), 564.092: Explored 10063668 states 34243435 transitions, fanout: 3.403
pins2lts-mc-linux64( 0/ 8), 564.092: Total exploration time 562.900 sec (562.720 sec minimum, 562.778 sec on average)
pins2lts-mc-linux64( 0/ 8), 564.092: States per second: 17878, Transitions per second: 60834
pins2lts-mc-linux64( 0/ 8), 564.092:
pins2lts-mc-linux64( 0/ 8), 564.092: State space has 30884973 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 564.092: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 564.092: blue states: 10063668 (32.58%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 564.092: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 564.092: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 564.092:
pins2lts-mc-linux64( 0/ 8), 564.092: Total memory used for local state coloring: 142.7MB
pins2lts-mc-linux64( 0/ 8), 564.092:
pins2lts-mc-linux64( 0/ 8), 564.092: Queue width: 8B, total height: 9352148, memory: 71.35MB
pins2lts-mc-linux64( 0/ 8), 564.092: Tree memory: 491.6MB, 16.7 B/state, compr.: 2.8%
pins2lts-mc-linux64( 0/ 8), 564.092: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 564.092: Stored 374 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 564.092: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 564.092: Est. total memory use: 563.0MB (~1095.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12685169157590446365;'/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' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12685169157590446365;'/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' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 01:43:54] [INFO ] Flatten gal took : 14 ms
[2025-06-01 01:43:54] [INFO ] Time to serialize gal into /tmp/LTLFireability10106017125902018593.gal : 8 ms
[2025-06-01 01:43:54] [INFO ] Time to serialize properties into /tmp/LTLFireability223664221440019159.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10106017125902018593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability223664221440019159.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((((!("((s1>=1)&&(l245>=1))"))U((G(!("((s1>=1)&&(l245>=1))")))||("((!((s1>=1)&&(l245>=1)))&&(!((s4>=1)&&(l148>=1))))")))U((G((!("((s1...453
Formula 0 simplified : ("((s1>=1)&&(l245>=1))" M !"((!((s1>=1)&&(l245>=1)))&&(!((s4>=1)&&(l148>=1))))") R (F(!"((!((s1>=1)&&(l245>=1)))&&(!((s4>=1)&&(l148>...331

BK_TIME_CONFINEMENT_REACHED

--------------------
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="FunctionPointer-PT-b002"
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 FunctionPointer-PT-b002, 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 r100-smll-174867007300060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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