About the Execution of ITS-Tools for BusinessProcesses-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 445700.00 | 0.00 | 0.00 | FFFFFFFFFFFTFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300076.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 BusinessProcesses-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 131K 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 BusinessProcesses-PT-10-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748570264750
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 01:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 01:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:57:47] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-05-30 01:57:47] [INFO ] Transformed 518 places.
[2025-05-30 01:57:47] [INFO ] Transformed 471 transitions.
[2025-05-30 01:57:47] [INFO ] Found NUPN structural information;
[2025-05-30 01:57:47] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BusinessProcesses-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 73 place count 445 transition count 399
Iterating global reduction 1 with 72 rules applied. Total rules applied 145 place count 445 transition count 399
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 179 place count 411 transition count 365
Iterating global reduction 1 with 34 rules applied. Total rules applied 213 place count 411 transition count 365
Applied a total of 213 rules in 170 ms. Remains 411 /518 variables (removed 107) and now considering 365/471 (removed 106) transitions.
// Phase 1: matrix 365 rows 411 cols
[2025-05-30 01:57:47] [INFO ] Computed 84 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:48] [INFO ] Implicit Places using invariants in 832 ms returned []
[2025-05-30 01:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:57:49] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-05-30 01:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/411 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:11] [INFO ] Deduced a trap composed of 50 places in 350 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:11] [INFO ] Deduced a trap composed of 69 places in 404 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:12] [INFO ] Deduced a trap composed of 69 places in 351 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:12] [INFO ] Deduced a trap composed of 50 places in 358 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:12] [INFO ] Deduced a trap composed of 69 places in 375 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:13] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:13] [INFO ] Deduced a trap composed of 71 places in 318 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:13] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:14] [INFO ] Deduced a trap composed of 71 places in 354 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:14] [INFO ] Deduced a trap composed of 30 places in 260 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:14] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:15] [INFO ] Deduced a trap composed of 71 places in 275 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:15] [INFO ] Deduced a trap composed of 71 places in 288 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:16] [INFO ] Deduced a trap composed of 70 places in 316 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:16] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:17] [INFO ] Deduced a trap composed of 73 places in 392 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:17] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:18] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:18] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:18] [INFO ] Deduced a trap composed of 29 places in 354 ms of which 40 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 20/104 constraints. Problems are: Problem set: 7 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:19] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:20] [INFO ] Deduced a trap composed of 68 places in 322 ms of which 41 ms to minimize.
SMT process timed out in 30402ms, After SMT, problems are : Problem set: 7 solved, 357 unsolved
Search for dead transitions found 7 dead transitions in 30520ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 411/518 places, 358/471 transitions.
Applied a total of 0 rules in 33 ms. Remains 411 /411 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32901 ms. Remains : 411/518 places, 358/471 transitions.
Support contains 28 out of 411 places after structural reductions.
[2025-05-30 01:58:20] [INFO ] Flatten gal took : 133 ms
[2025-05-30 01:58:21] [INFO ] Flatten gal took : 69 ms
[2025-05-30 01:58:21] [INFO ] Input system was already deterministic with 358 transitions.
Support contains 26 out of 411 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (326 resets) in 1743 ms. (22 steps per ms) remains 7/22 properties
BEST_FIRST walk for 40003 steps (58 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (55 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (55 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (57 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (57 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
// Phase 1: matrix 358 rows 411 cols
[2025-05-30 01:58:22] [INFO ] Computed 84 invariants in 18 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 122/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 160/291 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:22] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:22] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:22] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:22] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:22] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:23] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 113/404 variables, 36/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:23] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:23] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:23] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4/408 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 356/764 variables, 408/501 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:24] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:24] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:25] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:25] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:25] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:25] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:25] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:25] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:26] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:26] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:26] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:27] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 23 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/769 variables, and 513 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 408/411 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 122/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 160/291 variables, 39/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 113/404 variables, 36/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 13/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:27] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:27] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:28] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:28] [INFO ] Deduced a trap composed of 22 places in 319 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:28] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:29] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:29] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:29] [INFO ] Deduced a trap composed of 48 places in 321 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:30] [INFO ] Deduced a trap composed of 49 places in 350 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:30] [INFO ] Deduced a trap composed of 49 places in 360 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:31] [INFO ] Deduced a trap composed of 50 places in 348 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:31] [INFO ] Deduced a trap composed of 49 places in 361 ms of which 85 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 4/408 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 356/764 variables, 408/525 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/769 variables, and 532 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 408/411 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10065ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 358/358 transitions.
Graph (trivial) has 177 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 921 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 405 transition count 315
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 370 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 369 transition count 314
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 74 place count 369 transition count 231
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 251 place count 275 transition count 231
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 270 transition count 226
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 270 transition count 226
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 473 place count 162 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 475 place count 161 transition count 125
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 477 place count 161 transition count 123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 479 place count 159 transition count 123
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 480 place count 159 transition count 123
Applied a total of 480 rules in 188 ms. Remains 159 /411 variables (removed 252) and now considering 123/358 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 159/411 places, 123/358 transitions.
RANDOM walk for 1958 steps (70 resets) in 52 ms. (36 steps per ms) remains 0/7 properties
FORMULA BusinessProcesses-PT-10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 199 stabilizing places and 197 stable transitions
Graph (complete) has 928 edges and 411 vertex of which 410 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 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&&F((G(p0)&&p1)))))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 402 transition count 349
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 402 transition count 349
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 400 transition count 347
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 400 transition count 347
Applied a total of 22 rules in 78 ms. Remains 400 /411 variables (removed 11) and now considering 347/358 (removed 11) transitions.
// Phase 1: matrix 347 rows 400 cols
[2025-05-30 01:58:33] [INFO ] Computed 84 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:33] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-05-30 01:58:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:34] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2025-05-30 01:58:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:53] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:53] [INFO ] Deduced a trap composed of 66 places in 306 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:53] [INFO ] Deduced a trap composed of 47 places in 314 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:54] [INFO ] Deduced a trap composed of 66 places in 325 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:54] [INFO ] Deduced a trap composed of 66 places in 314 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:54] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:54] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:55] [INFO ] Deduced a trap composed of 68 places in 301 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:55] [INFO ] Deduced a trap composed of 68 places in 298 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:55] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:56] [INFO ] Deduced a trap composed of 68 places in 328 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:56] [INFO ] Deduced a trap composed of 68 places in 321 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:56] [INFO ] Deduced a trap composed of 30 places in 304 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:57] [INFO ] Deduced a trap composed of 30 places in 306 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:57] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:59] [INFO ] Deduced a trap composed of 68 places in 1801 ms of which 1556 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:59] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:59] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:58:59] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:00] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 60 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 5 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:01] [INFO ] Deduced a trap composed of 67 places in 325 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:01] [INFO ] Deduced a trap composed of 67 places in 312 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:01] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:02] [INFO ] Deduced a trap composed of 67 places in 324 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:02] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:03] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:03] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:04] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:04] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/747 variables, and 113 constraints, problems are : Problem set: 5 solved, 341 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 341 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 5 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 5 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 5 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 29/113 constraints. Problems are: Problem set: 5 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:10] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:10] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:11] [INFO ] Deduced a trap composed of 48 places in 314 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:12] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:12] [INFO ] Deduced a trap composed of 71 places in 313 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:13] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:13] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:13] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:13] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:14] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:15] [INFO ] Deduced a trap composed of 60 places in 301 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:15] [INFO ] Deduced a trap composed of 61 places in 277 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:15] [INFO ] Deduced a trap composed of 62 places in 307 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:16] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:16] [INFO ] Deduced a trap composed of 61 places in 291 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:16] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:17] [INFO ] Deduced a trap composed of 53 places in 270 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:17] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:17] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 25 ms to minimize.
Problem TDEAD257 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/133 constraints. Problems are: Problem set: 7 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:18] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:18] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:18] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:19] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:19] [INFO ] Deduced a trap composed of 66 places in 320 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:20] [INFO ] Deduced a trap composed of 53 places in 316 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:20] [INFO ] Deduced a trap composed of 49 places in 324 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:21] [INFO ] Deduced a trap composed of 48 places in 350 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:21] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:22] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:23] [INFO ] Deduced a trap composed of 52 places in 341 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:23] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:24] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:24] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:24] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:25] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:25] [INFO ] Deduced a trap composed of 31 places in 257 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:25] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:26] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:26] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 11 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD301 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/153 constraints. Problems are: Problem set: 14 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:27] [INFO ] Deduced a trap composed of 48 places in 290 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:27] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:27] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:28] [INFO ] Deduced a trap composed of 48 places in 278 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:28] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:28] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:28] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:29] [INFO ] Deduced a trap composed of 69 places in 305 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:29] [INFO ] Deduced a trap composed of 69 places in 294 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:29] [INFO ] Deduced a trap composed of 69 places in 267 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:30] [INFO ] Deduced a trap composed of 69 places in 288 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:30] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:31] [INFO ] Deduced a trap composed of 45 places in 322 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:31] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:32] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:32] [INFO ] Deduced a trap composed of 45 places in 297 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:32] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:33] [INFO ] Deduced a trap composed of 8 places in 349 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:33] [INFO ] Deduced a trap composed of 8 places in 343 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/747 variables, and 172 constraints, problems are : Problem set: 14 solved, 332 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 0/346 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 14 solved, 332 unsolved
Search for dead transitions found 14 dead transitions in 60135ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/411 places, 333/358 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 399 transition count 333
Applied a total of 1 rules in 26 ms. Remains 399 /400 variables (removed 1) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 399 cols
[2025-05-30 01:59:34] [INFO ] Computed 85 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:34] [INFO ] Implicit Places using invariants in 465 ms returned []
[2025-05-30 01:59:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:35] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 399/411 places, 333/358 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62709 ms. Remains : 399/411 places, 333/358 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-00 finished in 63180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Graph (trivial) has 189 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 922 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 404 transition count 310
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 364 transition count 310
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 82 place count 364 transition count 222
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 189 rules applied. Total rules applied 271 place count 263 transition count 222
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 280 place count 254 transition count 213
Iterating global reduction 2 with 9 rules applied. Total rules applied 289 place count 254 transition count 213
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 494 place count 149 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 496 place count 148 transition count 116
Applied a total of 496 rules in 80 ms. Remains 148 /411 variables (removed 263) and now considering 116/358 (removed 242) transitions.
// Phase 1: matrix 116 rows 148 cols
[2025-05-30 01:59:36] [INFO ] Computed 66 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:36] [INFO ] Implicit Places using invariants in 292 ms returned [7, 8, 9, 22, 23, 24, 25, 26, 27, 50, 51]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 295 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/411 places, 116/358 transitions.
Applied a total of 0 rules in 16 ms. Remains 137 /137 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 392 ms. Remains : 137/411 places, 116/358 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-02 finished in 512 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(F(p0))||(p1&&F(p2))))&&X((X(p0) U (p0&&X(p0))))))'
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 403 transition count 350
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 403 transition count 350
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 401 transition count 348
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 401 transition count 348
Applied a total of 20 rules in 50 ms. Remains 401 /411 variables (removed 10) and now considering 348/358 (removed 10) transitions.
// Phase 1: matrix 348 rows 401 cols
[2025-05-30 01:59:36] [INFO ] Computed 84 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:36] [INFO ] Implicit Places using invariants in 308 ms returned []
[2025-05-30 01:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:37] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2025-05-30 01:59:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:56] [INFO ] Deduced a trap composed of 47 places in 322 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:57] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:57] [INFO ] Deduced a trap composed of 66 places in 297 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:57] [INFO ] Deduced a trap composed of 66 places in 312 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:58] [INFO ] Deduced a trap composed of 66 places in 314 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:58] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:58] [INFO ] Deduced a trap composed of 48 places in 307 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:59] [INFO ] Deduced a trap composed of 67 places in 336 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:59] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:59] [INFO ] Deduced a trap composed of 68 places in 311 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:00] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:00] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:00] [INFO ] Deduced a trap composed of 68 places in 477 ms of which 236 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:01] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:01] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:01] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:02] [INFO ] Deduced a trap composed of 69 places in 313 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:02] [INFO ] Deduced a trap composed of 69 places in 322 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:02] [INFO ] Deduced a trap composed of 69 places in 299 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:03] [INFO ] Deduced a trap composed of 69 places in 283 ms of which 40 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/104 constraints. Problems are: Problem set: 10 solved, 337 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:04] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:04] [INFO ] Deduced a trap composed of 68 places in 300 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:04] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:05] [INFO ] Deduced a trap composed of 69 places in 298 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:05] [INFO ] Deduced a trap composed of 69 places in 304 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:05] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:06] [INFO ] Deduced a trap composed of 69 places in 302 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:06] [INFO ] Deduced a trap composed of 69 places in 310 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:06] [INFO ] Deduced a trap composed of 69 places in 307 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:07] [INFO ] Deduced a trap composed of 69 places in 316 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:07] [INFO ] Deduced a trap composed of 69 places in 302 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:07] [INFO ] Deduced a trap composed of 69 places in 304 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:08] [INFO ] Deduced a trap composed of 69 places in 278 ms of which 55 ms to minimize.
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 10 solved, 337 unsolved
Search for dead transitions found 10 dead transitions in 30178ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 401/411 places, 338/358 transitions.
Applied a total of 0 rules in 15 ms. Remains 401 /401 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31562 ms. Remains : 401/411 places, 338/358 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-03 finished in 32015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((((p0 U p1) U G(p1)) U X(X(p2)))&&F(p3))))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 404 transition count 351
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 404 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 403 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 403 transition count 350
Applied a total of 16 rules in 59 ms. Remains 403 /411 variables (removed 8) and now considering 350/358 (removed 8) transitions.
// Phase 1: matrix 350 rows 403 cols
[2025-05-30 02:00:08] [INFO ] Computed 84 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:09] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-05-30 02:00:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:10] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2025-05-30 02:00:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:29] [INFO ] Deduced a trap composed of 49 places in 335 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:29] [INFO ] Deduced a trap composed of 68 places in 311 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:29] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:30] [INFO ] Deduced a trap composed of 63 places in 393 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:30] [INFO ] Deduced a trap composed of 63 places in 327 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:31] [INFO ] Deduced a trap composed of 70 places in 249 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:31] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:31] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:32] [INFO ] Deduced a trap composed of 69 places in 330 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:32] [INFO ] Deduced a trap composed of 64 places in 307 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:33] [INFO ] Deduced a trap composed of 63 places in 293 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:33] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:34] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:34] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:34] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:34] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:35] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:35] [INFO ] Deduced a trap composed of 63 places in 293 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:35] [INFO ] Deduced a trap composed of 63 places in 282 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:36] [INFO ] Deduced a trap composed of 63 places in 295 ms of which 62 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/104 constraints. Problems are: Problem set: 13 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:37] [INFO ] Deduced a trap composed of 70 places in 309 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:37] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:37] [INFO ] Deduced a trap composed of 71 places in 299 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:38] [INFO ] Deduced a trap composed of 71 places in 310 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:38] [INFO ] Deduced a trap composed of 71 places in 300 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:39] [INFO ] Deduced a trap composed of 69 places in 577 ms of which 309 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:40] [INFO ] Deduced a trap composed of 69 places in 694 ms of which 431 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/753 variables, and 111 constraints, problems are : Problem set: 13 solved, 336 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/403 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 336 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 13 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 13 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 45/80 constraints. Problems are: Problem set: 13 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 4/84 constraints. Problems are: Problem set: 13 solved, 336 unsolved
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 27/111 constraints. Problems are: Problem set: 20 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:46] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:46] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:46] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:47] [INFO ] Deduced a trap composed of 70 places in 320 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:47] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:47] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:48] [INFO ] Deduced a trap composed of 70 places in 302 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:48] [INFO ] Deduced a trap composed of 70 places in 317 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:49] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:49] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:50] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:50] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:51] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:52] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:52] [INFO ] Deduced a trap composed of 33 places in 293 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:52] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:53] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:53] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:53] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:54] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 26 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 20/131 constraints. Problems are: Problem set: 24 solved, 325 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:54] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:55] [INFO ] Deduced a trap composed of 70 places in 316 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:55] [INFO ] Deduced a trap composed of 71 places in 310 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:56] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:56] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:56] [INFO ] Deduced a trap composed of 71 places in 294 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:57] [INFO ] Deduced a trap composed of 18 places in 313 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:58] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:58] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:58] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:58] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:59] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:59] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:59] [INFO ] Deduced a trap composed of 34 places in 312 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:00] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:00] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:01] [INFO ] Deduced a trap composed of 21 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:02] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:02] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:03] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 31 ms to minimize.
Problem TDEAD303 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 20/151 constraints. Problems are: Problem set: 25 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:03] [INFO ] Deduced a trap composed of 49 places in 314 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:04] [INFO ] Deduced a trap composed of 68 places in 334 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:04] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:04] [INFO ] Deduced a trap composed of 50 places in 296 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:05] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:05] [INFO ] Deduced a trap composed of 71 places in 287 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:05] [INFO ] Deduced a trap composed of 71 places in 305 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:06] [INFO ] Deduced a trap composed of 50 places in 320 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:06] [INFO ] Deduced a trap composed of 71 places in 301 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:06] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:07] [INFO ] Deduced a trap composed of 71 places in 313 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:07] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:07] [INFO ] Deduced a trap composed of 71 places in 318 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:08] [INFO ] Deduced a trap composed of 71 places in 352 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:08] [INFO ] Deduced a trap composed of 50 places in 324 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:08] [INFO ] Deduced a trap composed of 71 places in 341 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:09] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:09] [INFO ] Deduced a trap composed of 64 places in 296 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:10] [INFO ] Deduced a trap composed of 50 places in 297 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:10] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 51 ms to minimize.
SMT process timed out in 60176ms, After SMT, problems are : Problem set: 25 solved, 324 unsolved
Search for dead transitions found 25 dead transitions in 60177ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 403/411 places, 325/358 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 401 transition count 325
Applied a total of 2 rules in 13 ms. Remains 401 /403 variables (removed 2) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 401 cols
[2025-05-30 02:01:10] [INFO ] Computed 87 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:10] [INFO ] Implicit Places using invariants in 489 ms returned []
[2025-05-30 02:01:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:11] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1491 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 400/411 places, 325/358 transitions.
Applied a total of 0 rules in 10 ms. Remains 400 /400 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63275 ms. Remains : 400/411 places, 325/358 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p2), true, (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-04 finished in 63751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Graph (trivial) has 187 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 922 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 404 transition count 311
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 365 transition count 311
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 80 place count 365 transition count 224
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 266 place count 266 transition count 224
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 275 place count 257 transition count 215
Iterating global reduction 2 with 9 rules applied. Total rules applied 284 place count 257 transition count 215
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 493 place count 150 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 495 place count 149 transition count 116
Applied a total of 495 rules in 77 ms. Remains 149 /411 variables (removed 262) and now considering 116/358 (removed 242) transitions.
// Phase 1: matrix 116 rows 149 cols
[2025-05-30 02:01:12] [INFO ] Computed 67 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:12] [INFO ] Implicit Places using invariants in 353 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 21, 22, 26, 27, 28, 51, 52, 116]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 356 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/411 places, 116/358 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 443 ms. Remains : 133/411 places, 116/358 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 20381 reset in 731 ms.
Product exploration explored 100000 steps with 20505 reset in 568 ms.
Computed a total of 62 stabilizing places and 70 stable transitions
Computed a total of 62 stabilizing places and 70 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 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 34 ms :[(NOT p0)]
RANDOM walk for 8769 steps (2008 resets) in 125 ms. (69 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 98 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 133 cols
[2025-05-30 02:01:14] [INFO ] Computed 51 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:14] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-30 02:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 02:01:14] [INFO ] Implicit Places using invariants and state equation in 301 ms returned [16, 24, 73, 79, 85, 87]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 451 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/133 places, 116/116 transitions.
Graph (complete) has 462 edges and 127 vertex of which 118 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 117 transition count 111
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 10 place count 110 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 17 place count 110 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 108 transition count 83
Applied a total of 21 rules in 13 ms. Remains 108 /127 variables (removed 19) and now considering 83/116 (removed 33) transitions.
// Phase 1: matrix 83 rows 108 cols
[2025-05-30 02:01:14] [INFO ] Computed 40 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:15] [INFO ] Implicit Places using invariants in 169 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/133 places, 83/116 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 660 ms. Remains : 107/133 places, 83/116 transitions.
Computed a total of 36 stabilizing places and 37 stable transitions
Computed a total of 36 stabilizing places and 37 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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 50 ms :[(NOT p0)]
RANDOM walk for 7527 steps (1754 resets) in 40 ms. (183 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 139 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 20944 reset in 326 ms.
Product exploration explored 100000 steps with 20875 reset in 363 ms.
Built C files in :
/tmp/ltsmin16325026873022634986
[2025-05-30 02:01:16] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2025-05-30 02:01:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:01:16] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2025-05-30 02:01:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:01:16] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2025-05-30 02:01:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:01:16] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16325026873022634986
Running compilation step : cd /tmp/ltsmin16325026873022634986;'/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 760 ms.
Running link step : cd /tmp/ltsmin16325026873022634986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin16325026873022634986;'/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/stateBased5131772217961307015.hoa' '--buchi-type=spotba'
LTSmin run took 292 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-05 finished in 5287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((X(F(G(!p0)))||X(p0))) U p0) U p0)))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 402 transition count 349
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 402 transition count 349
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 400 transition count 347
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 400 transition count 347
Applied a total of 22 rules in 45 ms. Remains 400 /411 variables (removed 11) and now considering 347/358 (removed 11) transitions.
// Phase 1: matrix 347 rows 400 cols
[2025-05-30 02:01:17] [INFO ] Computed 84 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:18] [INFO ] Implicit Places using invariants in 508 ms returned []
[2025-05-30 02:01:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:19] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2025-05-30 02:01:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 47/82 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 346 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:37] [INFO ] Deduced a trap composed of 47 places in 311 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:38] [INFO ] Deduced a trap composed of 66 places in 320 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:38] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:38] [INFO ] Deduced a trap composed of 66 places in 339 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:39] [INFO ] Deduced a trap composed of 66 places in 307 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:39] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:39] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:39] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:40] [INFO ] Deduced a trap composed of 68 places in 314 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:40] [INFO ] Deduced a trap composed of 68 places in 306 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:40] [INFO ] Deduced a trap composed of 68 places in 330 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:41] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:41] [INFO ] Deduced a trap composed of 30 places in 297 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:41] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:42] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:44] [INFO ] Deduced a trap composed of 68 places in 1746 ms of which 1516 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:44] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:44] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:45] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:45] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 61 ms to minimize.
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 5 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:46] [INFO ] Deduced a trap composed of 67 places in 318 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:46] [INFO ] Deduced a trap composed of 67 places in 306 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:46] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:47] [INFO ] Deduced a trap composed of 67 places in 329 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:48] [INFO ] Deduced a trap composed of 67 places in 331 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:48] [INFO ] Deduced a trap composed of 18 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:48] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:49] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:49] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 26 ms to minimize.
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 5 solved, 341 unsolved
Search for dead transitions found 5 dead transitions in 30228ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 400/411 places, 342/358 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31839 ms. Remains : 400/411 places, 342/358 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), false, p0]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-07
Product exploration explored 100000 steps with 818 reset in 513 ms.
Stack based approach found an accepted trace after 45036 steps with 367 reset with depth 173 and stack size 173 in 209 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-07 finished in 32836 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 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Graph (trivial) has 187 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 922 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 404 transition count 312
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 366 transition count 312
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 78 place count 366 transition count 223
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 191 rules applied. Total rules applied 269 place count 264 transition count 223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 278 place count 255 transition count 214
Iterating global reduction 2 with 9 rules applied. Total rules applied 287 place count 255 transition count 214
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 203 rules applied. Total rules applied 490 place count 151 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 492 place count 150 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 493 place count 149 transition count 117
Applied a total of 493 rules in 44 ms. Remains 149 /411 variables (removed 262) and now considering 117/358 (removed 241) transitions.
// Phase 1: matrix 117 rows 149 cols
[2025-05-30 02:01:50] [INFO ] Computed 66 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:50] [INFO ] Implicit Places using invariants in 168 ms returned [25, 26, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 169 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/411 places, 117/358 transitions.
Applied a total of 0 rules in 7 ms. Remains 146 /146 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 146/411 places, 117/358 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-08 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Graph (trivial) has 185 edges and 411 vertex of which 6 / 411 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 922 edges and 406 vertex of which 405 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 404 transition count 313
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 367 transition count 311
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 365 transition count 311
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 80 place count 365 transition count 224
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 266 place count 266 transition count 224
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 275 place count 257 transition count 215
Iterating global reduction 3 with 9 rules applied. Total rules applied 284 place count 257 transition count 215
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 493 place count 150 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 494 place count 149 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 148 transition count 112
Applied a total of 495 rules in 37 ms. Remains 148 /411 variables (removed 263) and now considering 112/358 (removed 246) transitions.
// Phase 1: matrix 112 rows 148 cols
[2025-05-30 02:01:50] [INFO ] Computed 66 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:50] [INFO ] Implicit Places using invariants in 173 ms returned [0, 1, 2, 3, 4, 5, 6, 21, 22, 23, 24, 25, 26, 51, 118]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 174 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/411 places, 112/358 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 133/411 places, 112/358 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-12 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 404 transition count 351
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 404 transition count 351
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 402 transition count 349
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 402 transition count 349
Applied a total of 18 rules in 34 ms. Remains 402 /411 variables (removed 9) and now considering 349/358 (removed 9) transitions.
// Phase 1: matrix 349 rows 402 cols
[2025-05-30 02:01:51] [INFO ] Computed 84 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:51] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-05-30 02:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:52] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2025-05-30 02:01:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:10] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:10] [INFO ] Deduced a trap composed of 48 places in 297 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:10] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:11] [INFO ] Deduced a trap composed of 69 places in 287 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:11] [INFO ] Deduced a trap composed of 69 places in 286 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:11] [INFO ] Deduced a trap composed of 69 places in 310 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:12] [INFO ] Deduced a trap composed of 69 places in 306 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:12] [INFO ] Deduced a trap composed of 30 places in 303 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:12] [INFO ] Deduced a trap composed of 69 places in 311 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:13] [INFO ] Deduced a trap composed of 54 places in 304 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:13] [INFO ] Deduced a trap composed of 54 places in 307 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:14] [INFO ] Deduced a trap composed of 49 places in 310 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:14] [INFO ] Deduced a trap composed of 48 places in 318 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:15] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:15] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:15] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:16] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:16] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:16] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 8 ms to minimize.
Problem TDEAD259 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 5 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:17] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:17] [INFO ] Deduced a trap composed of 63 places in 279 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:18] [INFO ] Deduced a trap composed of 63 places in 308 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:18] [INFO ] Deduced a trap composed of 63 places in 322 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:18] [INFO ] Deduced a trap composed of 63 places in 293 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:19] [INFO ] Deduced a trap composed of 63 places in 301 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:19] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:20] [INFO ] Deduced a trap composed of 69 places in 303 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:20] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:20] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 69 places in 286 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 63 places in 315 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:22] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/751 variables, and 118 constraints, problems are : Problem set: 5 solved, 343 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/402 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 343 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 35/35 constraints. Problems are: Problem set: 5 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 45/80 constraints. Problems are: Problem set: 5 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 5 solved, 343 unsolved
Problem TDEAD262 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 34/118 constraints. Problems are: Problem set: 15 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:28] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:29] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:29] [INFO ] Deduced a trap composed of 62 places in 306 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:29] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:29] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:30] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:30] [INFO ] Deduced a trap composed of 69 places in 314 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:31] [INFO ] Deduced a trap composed of 69 places in 312 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:31] [INFO ] Deduced a trap composed of 69 places in 268 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:31] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:32] [INFO ] Deduced a trap composed of 67 places in 282 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:32] [INFO ] Deduced a trap composed of 63 places in 326 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:33] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:33] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:33] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:33] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:34] [INFO ] Deduced a trap composed of 61 places in 313 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:34] [INFO ] Deduced a trap composed of 61 places in 312 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:35] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:35] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 8 ms to minimize.
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/138 constraints. Problems are: Problem set: 22 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:36] [INFO ] Deduced a trap composed of 69 places in 309 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:36] [INFO ] Deduced a trap composed of 67 places in 330 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:37] [INFO ] Deduced a trap composed of 67 places in 340 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:37] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:38] [INFO ] Deduced a trap composed of 68 places in 334 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:38] [INFO ] Deduced a trap composed of 68 places in 446 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:39] [INFO ] Deduced a trap composed of 63 places in 330 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:40] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:41] [INFO ] Deduced a trap composed of 62 places in 289 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:41] [INFO ] Deduced a trap composed of 65 places in 317 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:41] [INFO ] Deduced a trap composed of 63 places in 287 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:42] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:42] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:42] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:43] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:43] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:43] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:44] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:44] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:44] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 14 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/158 constraints. Problems are: Problem set: 24 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:45] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:45] [INFO ] Deduced a trap composed of 68 places in 280 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:45] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:46] [INFO ] Deduced a trap composed of 69 places in 335 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:46] [INFO ] Deduced a trap composed of 69 places in 377 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:47] [INFO ] Deduced a trap composed of 69 places in 305 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:47] [INFO ] Deduced a trap composed of 67 places in 317 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:48] [INFO ] Deduced a trap composed of 68 places in 323 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:48] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:48] [INFO ] Deduced a trap composed of 62 places in 297 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:49] [INFO ] Deduced a trap composed of 51 places in 430 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:50] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:50] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:50] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:51] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:52] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:52] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:52] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/751 variables, and 176 constraints, problems are : Problem set: 24 solved, 324 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/402 constraints, PredecessorRefiner: 0/348 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 24 solved, 324 unsolved
Search for dead transitions found 24 dead transitions in 60077ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 402/411 places, 325/358 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 401 transition count 325
Applied a total of 1 rules in 14 ms. Remains 401 /402 variables (removed 1) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 401 cols
[2025-05-30 02:02:52] [INFO ] Computed 88 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:53] [INFO ] Implicit Places using invariants in 482 ms returned []
[2025-05-30 02:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:54] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1545 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 400/411 places, 325/358 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63119 ms. Remains : 400/411 places, 325/358 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-13
Stuttering criterion allowed to conclude after 116 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLFireability-13 finished in 63285 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 X(X(G((p1&&X(p2))))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 358/358 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 404 transition count 351
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 404 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 403 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 403 transition count 350
Applied a total of 16 rules in 34 ms. Remains 403 /411 variables (removed 8) and now considering 350/358 (removed 8) transitions.
// Phase 1: matrix 350 rows 403 cols
[2025-05-30 02:02:54] [INFO ] Computed 84 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:54] [INFO ] Implicit Places using invariants in 539 ms returned []
[2025-05-30 02:02:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:56] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2025-05-30 02:02:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 45/80 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:14] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:15] [INFO ] Deduced a trap composed of 66 places in 327 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:15] [INFO ] Deduced a trap composed of 48 places in 298 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:15] [INFO ] Deduced a trap composed of 49 places in 292 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:15] [INFO ] Deduced a trap composed of 67 places in 288 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:16] [INFO ] Deduced a trap composed of 67 places in 307 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:16] [INFO ] Deduced a trap composed of 62 places in 538 ms of which 308 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:17] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:17] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:17] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:18] [INFO ] Deduced a trap composed of 63 places in 302 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:18] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:18] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:19] [INFO ] Deduced a trap composed of 68 places in 325 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:19] [INFO ] Deduced a trap composed of 30 places in 294 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:19] [INFO ] Deduced a trap composed of 31 places in 290 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:20] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:20] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:20] [INFO ] Deduced a trap composed of 70 places in 315 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:21] [INFO ] Deduced a trap composed of 70 places in 308 ms of which 69 ms to minimize.
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/104 constraints. Problems are: Problem set: 10 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:21] [INFO ] Deduced a trap composed of 62 places in 437 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:22] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:22] [INFO ] Deduced a trap composed of 69 places in 311 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:22] [INFO ] Deduced a trap composed of 69 places in 299 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:23] [INFO ] Deduced a trap composed of 69 places in 299 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:23] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:23] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:24] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:24] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:24] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:25] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:25] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:25] [INFO ] Deduced a trap composed of 69 places in 241 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:25] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:26] [INFO ] Deduced a trap composed of 63 places in 261 ms of which 52 ms to minimize.
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 10 solved, 339 unsolved
Search for dead transitions found 10 dead transitions in 30113ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 403/411 places, 340/358 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 340/340 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31748 ms. Remains : 403/411 places, 340/358 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 24956 reset in 664 ms.
Product exploration explored 100000 steps with 24948 reset in 502 ms.
Computed a total of 196 stabilizing places and 184 stable transitions
Graph (complete) has 896 edges and 403 vertex of which 402 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 196 stabilizing places and 184 stable transitions
Detected a total of 196/403 stabilizing places and 184/340 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 255 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (329 resets) in 242 ms. (164 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (52 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (56 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
// Phase 1: matrix 340 rows 403 cols
[2025-05-30 02:03:28] [INFO ] Computed 84 invariants in 3 ms
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, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 95/98 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 183/281 variables, 41/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:28] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:28] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:28] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 117/398 variables, 37/85 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/400 variables, 2/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 338/738 variables, 400/487 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:29] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/738 variables, 1/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/743 variables, 3/491 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/743 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/743 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 491 constraints, problems are : Problem set: 1 solved, 3 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 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: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 95/98 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 183/281 variables, 41/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 3/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:29] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:29] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:29] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:29] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:29] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:29] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:30] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:30] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:30] [INFO ] Deduced a trap composed of 63 places in 258 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:30] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:31] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:31] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:31] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:31] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:32] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:32] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:32] [INFO ] Deduced a trap composed of 66 places in 219 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:32] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:32] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:33] [INFO ] Deduced a trap composed of 63 places in 214 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 20/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:33] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:33] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:33] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:33] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:34] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:34] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:34] [INFO ] Deduced a trap composed of 64 places in 206 ms of which 22 ms to minimize.
SMT process timed out in 6133ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 340/340 transitions.
Graph (trivial) has 176 edges and 403 vertex of which 6 / 403 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 889 edges and 398 vertex of which 397 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 397 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 361 transition count 296
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 74 place count 361 transition count 212
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 254 place count 265 transition count 212
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 473 place count 153 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 475 place count 152 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 477 place count 152 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 150 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 480 place count 150 transition count 106
Applied a total of 480 rules in 57 ms. Remains 150 /403 variables (removed 253) and now considering 106/340 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 150/403 places, 106/340 transitions.
RANDOM walk for 40000 steps (1757 resets) in 370 ms. (107 steps per ms) remains 1/3 properties
BEST_FIRST walk for 880 steps (9 resets) in 8 ms. (97 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 15 factoid took 775 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 340/340 transitions.
Applied a total of 0 rules in 11 ms. Remains 403 /403 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2025-05-30 02:03:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:36] [INFO ] Implicit Places using invariants in 531 ms returned []
[2025-05-30 02:03:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:37] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned [141, 142]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1584 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/403 places, 340/340 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 340/340 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1608 ms. Remains : 401/403 places, 340/340 transitions.
Computed a total of 194 stabilizing places and 184 stable transitions
Graph (complete) has 886 edges and 401 vertex of which 400 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 194 stabilizing places and 184 stable transitions
Detected a total of 194/401 stabilizing places and 184/340 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p2)), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 318 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (327 resets) in 267 ms. (149 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (54 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (52 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (58 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
// Phase 1: matrix 340 rows 401 cols
[2025-05-30 02:03:38] [INFO ] Computed 82 invariants in 4 ms
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 95/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 183/281 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:39] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:39] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 110/391 variables, 33/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:39] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:39] [INFO ] Deduced a trap composed of 69 places in 296 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:39] [INFO ] Deduced a trap composed of 69 places in 246 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:40] [INFO ] Deduced a trap composed of 69 places in 313 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:40] [INFO ] Deduced a trap composed of 70 places in 347 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:40] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:41] [INFO ] Deduced a trap composed of 70 places in 316 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:41] [INFO ] Deduced a trap composed of 70 places in 333 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:41] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/398 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 338/736 variables, 398/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:42] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/736 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:42] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/736 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/736 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/741 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/741 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/741 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 741/741 variables, and 496 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3930 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 95/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 183/281 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 110/391 variables, 33/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:42] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:43] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:43] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:43] [INFO ] Deduced a trap composed of 58 places in 415 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:44] [INFO ] Deduced a trap composed of 59 places in 409 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:44] [INFO ] Deduced a trap composed of 59 places in 385 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:45] [INFO ] Deduced a trap composed of 59 places in 378 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:45] [INFO ] Deduced a trap composed of 60 places in 362 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:45] [INFO ] Deduced a trap composed of 58 places in 428 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:46] [INFO ] Deduced a trap composed of 58 places in 429 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:46] [INFO ] Deduced a trap composed of 58 places in 400 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:47] [INFO ] Deduced a trap composed of 60 places in 385 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:47] [INFO ] Deduced a trap composed of 59 places in 368 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:47] [INFO ] Deduced a trap composed of 64 places in 358 ms of which 61 ms to minimize.
SMT process timed out in 9199ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 340/340 transitions.
Graph (trivial) has 176 edges and 401 vertex of which 6 / 401 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 879 edges and 396 vertex of which 395 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 395 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 359 transition count 296
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 74 place count 359 transition count 212
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 254 place count 263 transition count 212
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 473 place count 151 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 475 place count 150 transition count 108
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 477 place count 150 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 148 transition count 106
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 480 place count 148 transition count 106
Applied a total of 480 rules in 38 ms. Remains 148 /401 variables (removed 253) and now considering 106/340 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 148/401 places, 106/340 transitions.
RANDOM walk for 40000 steps (1711 resets) in 241 ms. (165 steps per ms) remains 1/3 properties
BEST_FIRST walk for 572 steps (9 resets) in 6 ms. (81 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X p2)), (X (X p0)), (X (X (AND p1 p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 1047 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25063 reset in 239 ms.
Product exploration explored 100000 steps with 24991 reset in 247 ms.
Applying partial POR strategy [false, false, false, true, true, false, false]
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 340/340 transitions.
Graph (trivial) has 176 edges and 401 vertex of which 6 / 401 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 880 edges and 396 vertex of which 395 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 395 transition count 333
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 38 place count 395 transition count 374
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 98 place count 395 transition count 374
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 110 place count 383 transition count 351
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 122 place count 383 transition count 351
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 252 place count 383 transition count 351
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 281 place count 354 transition count 322
Deduced a syphon composed of 185 places in 1 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 310 place count 354 transition count 322
Deduced a syphon composed of 185 places in 0 ms
Applied a total of 310 rules in 92 ms. Remains 354 /401 variables (removed 47) and now considering 322/340 (removed 18) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:03:51] [INFO ] Redundant transitions in 38 ms returned []
Running 321 sub problems to find dead transitions.
// Phase 1: matrix 322 rows 354 cols
[2025-05-30 02:03:51] [INFO ] Computed 82 invariants in 6 ms
[2025-05-30 02:03:51] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/353 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/354 variables, 47/80 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:07] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:07] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:07] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:07] [INFO ] Deduced a trap composed of 21 places in 311 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:08] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:08] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:08] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:09] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:09] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:09] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:10] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:10] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:10] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:11] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:11] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:11] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:11] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:12] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:12] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:12] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 16 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/102 constraints. Problems are: Problem set: 15 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:13] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:13] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:13] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:13] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:14] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:14] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:14] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:15] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:15] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:15] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:16] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:16] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:16] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:16] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:17] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:17] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:17] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:18] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:18] [INFO ] Deduced a trap composed of 33 places in 271 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:18] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 11 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 20/122 constraints. Problems are: Problem set: 31 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:19] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:19] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:19] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:20] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:20] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:20] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:20] [INFO ] Deduced a trap composed of 33 places in 254 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:21] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:21] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:21] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:22] [INFO ] Deduced a trap composed of 33 places in 278 ms of which 29 ms to minimize.
SMT process timed out in 30451ms, After SMT, problems are : Problem set: 31 solved, 290 unsolved
Search for dead transitions found 31 dead transitions in 30454ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 354/401 places, 291/340 transitions.
Graph (complete) has 1062 edges and 354 vertex of which 325 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.2 ms
Discarding 29 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 325 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 324 transition count 298
Deduced a syphon composed of 156 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 324 transition count 298
Deduced a syphon composed of 156 places in 0 ms
Applied a total of 4 rules in 37 ms. Remains 324 /354 variables (removed 30) and now considering 298/291 (removed -7) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 324/401 places, 298/340 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30630 ms. Remains : 324/401 places, 298/340 transitions.
Built C files in :
/tmp/ltsmin1597218259147579651
[2025-05-30 02:04:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1597218259147579651
Running compilation step : cd /tmp/ltsmin1597218259147579651;'/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 1005 ms.
Running link step : cd /tmp/ltsmin1597218259147579651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1597218259147579651;'/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/stateBased5805114606301210608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 340/340 transitions.
Applied a total of 0 rules in 11 ms. Remains 401 /401 variables (removed 0) and now considering 340/340 (removed 0) transitions.
// Phase 1: matrix 340 rows 401 cols
[2025-05-30 02:04:37] [INFO ] Computed 82 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:37] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-05-30 02:04:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:38] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2025-05-30 02:04:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 45/78 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:56] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:57] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:57] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:57] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:58] [INFO ] Deduced a trap composed of 61 places in 279 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:58] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:58] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:58] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:59] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:59] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:04:59] [INFO ] Deduced a trap composed of 63 places in 263 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:00] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:00] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:00] [INFO ] Deduced a trap composed of 48 places in 258 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:00] [INFO ] Deduced a trap composed of 48 places in 245 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:01] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:01] [INFO ] Deduced a trap composed of 63 places in 270 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:01] [INFO ] Deduced a trap composed of 63 places in 280 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:02] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:02] [INFO ] Deduced a trap composed of 68 places in 254 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:03] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:03] [INFO ] Deduced a trap composed of 67 places in 255 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:03] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:04] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:04] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:04] [INFO ] Deduced a trap composed of 68 places in 272 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:05] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:05] [INFO ] Deduced a trap composed of 68 places in 276 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:05] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:06] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:06] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:07] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:07] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:08] [INFO ] Deduced a trap composed of 34 places in 326 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:05:08] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 25 ms to minimize.
SMT process timed out in 30187ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 30189ms
Finished structural reductions in LTL mode , in 1 iterations and 31636 ms. Remains : 401/401 places, 340/340 transitions.
Built C files in :
/tmp/ltsmin10390937812136464797
[2025-05-30 02:05:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10390937812136464797
Running compilation step : cd /tmp/ltsmin10390937812136464797;'/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 1022 ms.
Running link step : cd /tmp/ltsmin10390937812136464797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10390937812136464797;'/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/stateBased6751719358752803464.hoa' '--buchi-type=spotba'
LTSmin run took 438 ms.
FORMULA BusinessProcesses-PT-10-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLFireability-14 finished in 136026 ms.
All properties solved by simple procedures.
Total runtime 443378 ms.
BK_STOP 1748570710450
--------------------
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="BusinessProcesses-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813300076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;