About the Execution of ITS-Tools for BusinessProcesses-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 493954.00 | 0.00 | 0.00 | FFFFFTFFFTFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400140.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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.8K 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 177K 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-18-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748612337898
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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 13:39:00] [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 13:39:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:39:00] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-05-30 13:39:00] [INFO ] Transformed 717 places.
[2025-05-30 13:39:00] [INFO ] Transformed 642 transitions.
[2025-05-30 13:39:00] [INFO ] Found NUPN structural information;
[2025-05-30 13:39:00] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 15 places in 21 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 105 place count 597 transition count 530
Iterating global reduction 1 with 97 rules applied. Total rules applied 202 place count 597 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 203 place count 597 transition count 529
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 253 place count 547 transition count 479
Iterating global reduction 2 with 50 rules applied. Total rules applied 303 place count 547 transition count 479
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 304 place count 546 transition count 478
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 546 transition count 478
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 306 place count 545 transition count 477
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 545 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 308 place count 544 transition count 476
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 544 transition count 476
Applied a total of 309 rules in 401 ms. Remains 544 /702 variables (removed 158) and now considering 476/627 (removed 151) transitions.
// Phase 1: matrix 476 rows 544 cols
[2025-05-30 13:39:01] [INFO ] Computed 106 invariants in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:39:02] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2025-05-30 13:39:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:39:06] [INFO ] Implicit Places using invariants and state equation in 3526 ms returned []
Implicit Place search using SMT with State Equation took 4644 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2025-05-30 13:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/543 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 1/544 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:31] [INFO ] Deduced a trap composed of 74 places in 450 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:32] [INFO ] Deduced a trap composed of 74 places in 450 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:32] [INFO ] Deduced a trap composed of 74 places in 400 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:32] [INFO ] Deduced a trap composed of 74 places in 454 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:33] [INFO ] Deduced a trap composed of 74 places in 364 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:33] [INFO ] Deduced a trap composed of 74 places in 384 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:34] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:34] [INFO ] Deduced a trap composed of 74 places in 242 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:34] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:34] [INFO ] Deduced a trap composed of 74 places in 235 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:35] [INFO ] Deduced a trap composed of 93 places in 252 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:35] [INFO ] Deduced a trap composed of 94 places in 257 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:35] [INFO ] Deduced a trap composed of 93 places in 402 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:36] [INFO ] Deduced a trap composed of 94 places in 261 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:36] [INFO ] Deduced a trap composed of 94 places in 250 ms of which 56 ms to minimize.
SMT process timed out in 30336ms, After SMT, problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 30362ms
Starting structural reductions in LTL mode, iteration 1 : 544/702 places, 476/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35443 ms. Remains : 544/702 places, 476/627 transitions.
Support contains 43 out of 544 places after structural reductions.
[2025-05-30 13:39:36] [INFO ] Flatten gal took : 138 ms
[2025-05-30 13:39:36] [INFO ] Flatten gal took : 68 ms
[2025-05-30 13:39:37] [INFO ] Input system was already deterministic with 476 transitions.
RANDOM walk for 40000 steps (205 resets) in 3089 ms. (12 steps per ms) remains 12/33 properties
BEST_FIRST walk for 40003 steps (37 resets) in 303 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (38 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (38 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (37 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (37 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (36 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (37 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (39 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (30 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
[2025-05-30 13:39:38] [INFO ] Invariant cache hit.
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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 150/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:38] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:39] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 237/406 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:39] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:39] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:39] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:40] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:40] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:40] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:40] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:40] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:40] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:40] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:41] [INFO ] Deduced a trap composed of 36 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 13:39:41] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:42] [INFO ] Deduced a trap composed of 48 places in 464 ms of which 83 ms to minimize.
Problem AtomicPropp4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:43] [INFO ] Deduced a trap composed of 88 places in 1218 ms of which 893 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:44] [INFO ] Deduced a trap composed of 88 places in 653 ms of which 404 ms to minimize.
SMT process timed out in 5348ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 476/476 transitions.
Graph (complete) has 1217 edges and 544 vertex of which 543 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 543 transition count 414
Reduce places removed 61 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 482 transition count 410
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 478 transition count 410
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 131 place count 478 transition count 302
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 237 rules applied. Total rules applied 368 place count 349 transition count 302
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 374 place count 343 transition count 296
Iterating global reduction 3 with 6 rules applied. Total rules applied 380 place count 343 transition count 296
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 665 place count 199 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 666 place count 199 transition count 154
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 4 with 2 rules applied. Total rules applied 668 place count 198 transition count 157
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 676 place count 198 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 677 place count 197 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 678 place count 196 transition count 156
Applied a total of 678 rules in 137 ms. Remains 196 /544 variables (removed 348) and now considering 156/476 (removed 320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 196/544 places, 156/476 transitions.
RANDOM walk for 40000 steps (3073 resets) in 521 ms. (76 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40002 steps (1062 resets) in 243 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1068 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1065 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1054 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1085 resets) in 212 ms. (187 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40003 steps (1073 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
// Phase 1: matrix 156 rows 196 cols
[2025-05-30 13:39:44] [INFO ] Computed 81 invariants in 13 ms
[2025-05-30 13:39:44] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/88 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:45] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 35/123 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:45] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:45] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/125 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 155/280 variables, 125/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 72/352 variables, 71/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 33/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:39:45] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/352 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 285 constraints, problems are : Problem set: 0 solved, 4 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 196/196 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 53/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 29/88 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 35/123 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/125 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 155/280 variables, 125/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 72/352 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 33/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/352 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/352 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 289 constraints, problems are : Problem set: 0 solved, 4 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 196/196 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1825ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 190 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 487 stabilizing places and 429 stable transitions
Graph (complete) has 1217 edges and 544 vertex of which 543 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 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((X(X(X(((p0 U p1)&&X(p2))))) U G(p0))))))'
Support contains 4 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 534 transition count 466
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 532 transition count 464
Applied a total of 24 rules in 55 ms. Remains 532 /544 variables (removed 12) and now considering 464/476 (removed 12) transitions.
// Phase 1: matrix 464 rows 532 cols
[2025-05-30 13:39:47] [INFO ] Computed 106 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:39:48] [INFO ] Implicit Places using invariants in 515 ms returned []
[2025-05-30 13:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:39:50] [INFO ] Implicit Places using invariants and state equation in 2411 ms returned []
Implicit Place search using SMT with State Equation took 2928 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-05-30 13:39: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/531 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:14] [INFO ] Deduced a trap composed of 68 places in 361 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:14] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:14] [INFO ] Deduced a trap composed of 68 places in 387 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:15] [INFO ] Deduced a trap composed of 68 places in 356 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:15] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:16] [INFO ] Deduced a trap composed of 89 places in 324 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:16] [INFO ] Deduced a trap composed of 89 places in 245 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:16] [INFO ] Deduced a trap composed of 69 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 13:40:17] [INFO ] Deduced a trap composed of 68 places in 276 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:17] [INFO ] Deduced a trap composed of 68 places in 261 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:17] [INFO ] Deduced a trap composed of 68 places in 310 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:17] [INFO ] Deduced a trap composed of 68 places in 318 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:18] [INFO ] Deduced a trap composed of 68 places in 388 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:18] [INFO ] Deduced a trap composed of 68 places in 390 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:19] [INFO ] Deduced a trap composed of 69 places in 382 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:19] [INFO ] Deduced a trap composed of 69 places in 405 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:20] [INFO ] Deduced a trap composed of 68 places in 375 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:20] [INFO ] Deduced a trap composed of 68 places in 376 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:20] [INFO ] Deduced a trap composed of 68 places in 348 ms of which 66 ms to minimize.
SMT process timed out in 30378ms, After SMT, problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 30382ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 464/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33367 ms. Remains : 532/544 places, 464/476 transitions.
Stuttering acceptance computed with spot in 1116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 p2)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-00 finished in 34583 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 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Graph (trivial) has 262 edges and 544 vertex of which 7 / 544 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1210 edges and 538 vertex of which 537 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 536 transition count 402
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 471 transition count 402
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 132 place count 471 transition count 288
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 385 place count 332 transition count 288
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 393 place count 324 transition count 280
Iterating global reduction 2 with 8 rules applied. Total rules applied 401 place count 324 transition count 280
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 688 place count 179 transition count 138
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 690 place count 178 transition count 141
Applied a total of 690 rules in 118 ms. Remains 178 /544 variables (removed 366) and now considering 141/476 (removed 335) transitions.
// Phase 1: matrix 141 rows 178 cols
[2025-05-30 13:40:22] [INFO ] Computed 78 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:22] [INFO ] Implicit Places using invariants in 405 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 418 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/544 places, 141/476 transitions.
Applied a total of 0 rules in 19 ms. Remains 151 /151 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 555 ms. Remains : 151/544 places, 141/476 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-01 finished in 671 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((G((p0||X(F((p0&&X(X(F(p1)))))))) U X(p2))))'
Support contains 5 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 534 transition count 466
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 532 transition count 464
Applied a total of 24 rules in 79 ms. Remains 532 /544 variables (removed 12) and now considering 464/476 (removed 12) transitions.
// Phase 1: matrix 464 rows 532 cols
[2025-05-30 13:40:22] [INFO ] Computed 106 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:23] [INFO ] Implicit Places using invariants in 736 ms returned []
[2025-05-30 13:40:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:25] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-05-30 13:40:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:49] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:50] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:50] [INFO ] Deduced a trap composed of 68 places in 375 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:51] [INFO ] Deduced a trap composed of 68 places in 328 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:51] [INFO ] Deduced a trap composed of 68 places in 316 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:51] [INFO ] Deduced a trap composed of 68 places in 370 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:52] [INFO ] Deduced a trap composed of 68 places in 388 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:52] [INFO ] Deduced a trap composed of 68 places in 379 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:53] [INFO ] Deduced a trap composed of 68 places in 374 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:53] [INFO ] Deduced a trap composed of 68 places in 344 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:53] [INFO ] Deduced a trap composed of 68 places in 346 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:54] [INFO ] Deduced a trap composed of 68 places in 357 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:54] [INFO ] Deduced a trap composed of 68 places in 371 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:54] [INFO ] Deduced a trap composed of 68 places in 385 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:55] [INFO ] Deduced a trap composed of 68 places in 388 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:55] [INFO ] Deduced a trap composed of 68 places in 347 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:56] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 81 ms to minimize.
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 464/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33280 ms. Remains : 532/544 places, 464/476 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (AND p0 (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-03
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-03 finished in 33725 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||G(p1)))))'
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Graph (complete) has 1217 edges and 544 vertex of which 543 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 542 transition count 408
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 476 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 474 transition count 406
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 137 place count 474 transition count 292
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 390 place count 335 transition count 292
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 400 place count 325 transition count 282
Iterating global reduction 3 with 10 rules applied. Total rules applied 410 place count 325 transition count 282
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 289 rules applied. Total rules applied 699 place count 179 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 700 place count 179 transition count 138
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 4 with 2 rules applied. Total rules applied 702 place count 178 transition count 141
Applied a total of 702 rules in 109 ms. Remains 178 /544 variables (removed 366) and now considering 141/476 (removed 335) transitions.
// Phase 1: matrix 141 rows 178 cols
[2025-05-30 13:40:56] [INFO ] Computed 78 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:40:56] [INFO ] Implicit Places using invariants in 317 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 320 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/544 places, 141/476 transitions.
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 441 ms. Remains : 150/544 places, 141/476 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-05
Product exploration explored 100000 steps with 19162 reset in 775 ms.
Product exploration explored 100000 steps with 19241 reset in 515 ms.
Computed a total of 127 stabilizing places and 123 stable transitions
Computed a total of 127 stabilizing places and 123 stable transitions
Detected a total of 127/150 stabilizing places and 123/141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 461 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3461 resets) in 370 ms. (107 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1160 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1285 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
// Phase 1: matrix 141 rows 150 cols
[2025-05-30 13:40:59] [INFO ] Computed 50 invariants in 2 ms
[2025-05-30 13:40:59] [INFO ] State equation strengthened by 4 read => feed constraints.
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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/52 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:59] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 77/129 variables, 36/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:59] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:59] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:59] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:40:59] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:00] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 20/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:01] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/146 variables, 12/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 141/287 variables, 146/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 4/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/291 variables, 4/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/291 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 226 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 150/150 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/52 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 77/129 variables, 36/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 21/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:02] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:02] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:02] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:02] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:02] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 5/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/146 variables, 12/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 141/287 variables, 146/223 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 4/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/287 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/291 variables, 4/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/291 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/291 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 232 constraints, problems are : Problem set: 1 solved, 1 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 150/150 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3837ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 703 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 150 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 141/141 transitions.
Applied a total of 0 rules in 11 ms. Remains 150 /150 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2025-05-30 13:41:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:41:04] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-05-30 13:41:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:41:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 13:41:05] [INFO ] Implicit Places using invariants and state equation in 950 ms returned [3, 26, 27, 29, 31, 33, 34, 49, 51, 55, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 1246 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/150 places, 141/141 transitions.
Graph (complete) has 400 edges and 122 vertex of which 113 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
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 113 transition count 124
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 100 transition count 124
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 40 place count 87 transition count 83
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 87 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 87 transition count 80
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 84 transition count 80
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 62 place count 81 transition count 77
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 81 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 81 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 80 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 79 place count 75 transition count 69
Applied a total of 79 rules in 26 ms. Remains 75 /122 variables (removed 47) and now considering 69/141 (removed 72) transitions.
// Phase 1: matrix 69 rows 75 cols
[2025-05-30 13:41:05] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:41:05] [INFO ] Implicit Places using invariants in 102 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 105 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/150 places, 69/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1394 ms. Remains : 72/150 places, 69/141 transitions.
Computed a total of 49 stabilizing places and 51 stable transitions
Computed a total of 49 stabilizing places and 51 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19330 reset in 544 ms.
Product exploration explored 100000 steps with 19154 reset in 396 ms.
Built C files in :
/tmp/ltsmin6489502885666990765
[2025-05-30 13:41:07] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2025-05-30 13:41:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:41:07] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2025-05-30 13:41:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:41:07] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2025-05-30 13:41:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:41:07] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6489502885666990765
Running compilation step : cd /tmp/ltsmin6489502885666990765;'/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 414 ms.
Running link step : cd /tmp/ltsmin6489502885666990765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin6489502885666990765;'/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/stateBased5584086923381260207.hoa' '--buchi-type=spotba'
LTSmin run took 2743 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLFireability-05 finished in 13852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)||X((X(X(p2)) U (p0&&X(X(p2)))))))))'
Support contains 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 533 transition count 465
Applied a total of 22 rules in 78 ms. Remains 533 /544 variables (removed 11) and now considering 465/476 (removed 11) transitions.
// Phase 1: matrix 465 rows 533 cols
[2025-05-30 13:41:10] [INFO ] Computed 106 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:41:11] [INFO ] Implicit Places using invariants in 632 ms returned []
[2025-05-30 13:41:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:41:14] [INFO ] Implicit Places using invariants and state equation in 3360 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-05-30 13:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:37] [INFO ] Deduced a trap composed of 70 places in 393 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:37] [INFO ] Deduced a trap composed of 70 places in 356 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:38] [INFO ] Deduced a trap composed of 70 places in 364 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:38] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:39] [INFO ] Deduced a trap composed of 70 places in 340 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:39] [INFO ] Deduced a trap composed of 91 places in 417 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:39] [INFO ] Deduced a trap composed of 91 places in 372 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:40] [INFO ] Deduced a trap composed of 91 places in 398 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:40] [INFO ] Deduced a trap composed of 91 places in 386 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:41] [INFO ] Deduced a trap composed of 91 places in 390 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:41] [INFO ] Deduced a trap composed of 91 places in 399 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:41] [INFO ] Deduced a trap composed of 91 places in 407 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:42] [INFO ] Deduced a trap composed of 91 places in 409 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:42] [INFO ] Deduced a trap composed of 91 places in 397 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:43] [INFO ] Deduced a trap composed of 91 places in 359 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:43] [INFO ] Deduced a trap composed of 91 places in 407 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:44] [INFO ] Deduced a trap composed of 91 places in 410 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:44] [INFO ] Deduced a trap composed of 91 places in 412 ms of which 98 ms to minimize.
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 30101ms
Starting structural reductions in LTL mode, iteration 1 : 533/544 places, 465/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34176 ms. Remains : 533/544 places, 465/476 transitions.
Stuttering acceptance computed with spot in 559 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 14273 reset in 232 ms.
Product exploration explored 100000 steps with 14284 reset in 251 ms.
Computed a total of 478 stabilizing places and 420 stable transitions
Graph (complete) has 1204 edges and 533 vertex of which 532 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 478 stabilizing places and 420 stable transitions
Detected a total of 478/533 stabilizing places and 420/465 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 11 states, 19 edges and 3 AP (stutter sensitive) to 11 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 40001 steps (208 resets) in 411 ms. (97 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (34 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (35 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (37 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (34 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
[2025-05-30 13:41:46] [INFO ] Invariant cache hit.
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, 5 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 89/92 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 300/392 variables, 63/65 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:47] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:47] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:47] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:47] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:48] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:48] [INFO ] Deduced a trap composed of 21 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 13:41:48] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:48] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:49] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:49] [INFO ] Deduced a trap composed of 84 places in 276 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:49] [INFO ] Deduced a trap composed of 84 places in 230 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:49] [INFO ] Deduced a trap composed of 84 places in 234 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:50] [INFO ] Deduced a trap composed of 84 places in 256 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:50] [INFO ] Deduced a trap composed of 84 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 13:41:50] [INFO ] Deduced a trap composed of 84 places in 286 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:51] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:51] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:51] [INFO ] Deduced a trap composed of 84 places in 256 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:41:51] [INFO ] Deduced a trap composed of 84 places in 243 ms of which 30 ms to minimize.
SMT process timed out in 5132ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 465/465 transitions.
Graph (trivial) has 250 edges and 533 vertex of which 6 / 533 are part of one of the 1 SCC in 9 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 1190 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 527 transition count 398
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 468 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 467 transition count 397
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 122 place count 467 transition count 284
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 372 place count 330 transition count 284
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 667 place count 181 transition count 138
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 669 place count 180 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 670 place count 180 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 671 place count 179 transition count 140
Applied a total of 671 rules in 60 ms. Remains 179 /533 variables (removed 354) and now considering 140/465 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 179/533 places, 140/465 transitions.
RANDOM walk for 40000 steps (2179 resets) in 536 ms. (74 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1180 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1172 resets) in 378 ms. (105 steps per ms) remains 2/2 properties
// Phase 1: matrix 140 rows 179 cols
[2025-05-30 13:41:52] [INFO ] Computed 79 invariants in 3 ms
[2025-05-30 13:41:52] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/149 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/175 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 140/315 variables, 175/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/319 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/319 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 265 constraints, problems are : Problem set: 0 solved, 2 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 179/179 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 106/149 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/175 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 140/315 variables, 175/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/319 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/319 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 179/179 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 866 ms. Reduced automaton from 11 states, 18 edges and 3 AP (stutter sensitive) to 11 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 540 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 497 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 465/465 transitions.
Applied a total of 0 rules in 24 ms. Remains 533 /533 variables (removed 0) and now considering 465/465 (removed 0) transitions.
// Phase 1: matrix 465 rows 533 cols
[2025-05-30 13:41:55] [INFO ] Computed 106 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:41:55] [INFO ] Implicit Places using invariants in 745 ms returned []
[2025-05-30 13:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:41:58] [INFO ] Implicit Places using invariants and state equation in 2599 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-05-30 13:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:18] [INFO ] Deduced a trap composed of 70 places in 389 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:19] [INFO ] Deduced a trap composed of 70 places in 367 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:19] [INFO ] Deduced a trap composed of 70 places in 403 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:20] [INFO ] Deduced a trap composed of 70 places in 380 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:20] [INFO ] Deduced a trap composed of 70 places in 395 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:20] [INFO ] Deduced a trap composed of 91 places in 422 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:21] [INFO ] Deduced a trap composed of 91 places in 418 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:21] [INFO ] Deduced a trap composed of 91 places in 355 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:22] [INFO ] Deduced a trap composed of 91 places in 336 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:22] [INFO ] Deduced a trap composed of 91 places in 328 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:22] [INFO ] Deduced a trap composed of 91 places in 316 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:23] [INFO ] Deduced a trap composed of 91 places in 354 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:23] [INFO ] Deduced a trap composed of 91 places in 413 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:24] [INFO ] Deduced a trap composed of 91 places in 397 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:24] [INFO ] Deduced a trap composed of 91 places in 358 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:24] [INFO ] Deduced a trap composed of 91 places in 336 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:25] [INFO ] Deduced a trap composed of 91 places in 351 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:25] [INFO ] Deduced a trap composed of 91 places in 385 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:26] [INFO ] Deduced a trap composed of 91 places in 424 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:26] [INFO ] Deduced a trap composed of 91 places in 387 ms of which 106 ms to minimize.
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/126 constraints. Problems are: Problem set: 17 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 533/998 variables, and 126 constraints, problems are : Problem set: 17 solved, 447 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/533 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 447 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 41/41 constraints. Problems are: Problem set: 17 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/41 constraints. Problems are: Problem set: 17 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 65/106 constraints. Problems are: Problem set: 17 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 20/126 constraints. Problems are: Problem set: 17 solved, 447 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:38] [INFO ] Deduced a trap composed of 70 places in 377 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:38] [INFO ] Deduced a trap composed of 70 places in 364 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:38] [INFO ] Deduced a trap composed of 70 places in 284 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:39] [INFO ] Deduced a trap composed of 70 places in 421 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:39] [INFO ] Deduced a trap composed of 70 places in 370 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:40] [INFO ] Deduced a trap composed of 70 places in 393 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:40] [INFO ] Deduced a trap composed of 70 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 13:42:41] [INFO ] Deduced a trap composed of 91 places in 423 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:41] [INFO ] Deduced a trap composed of 91 places in 379 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:41] [INFO ] Deduced a trap composed of 91 places in 428 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:42] [INFO ] Deduced a trap composed of 91 places in 387 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:42] [INFO ] Deduced a trap composed of 91 places in 363 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:43] [INFO ] Deduced a trap composed of 91 places in 356 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:43] [INFO ] Deduced a trap composed of 90 places in 435 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:44] [INFO ] Deduced a trap composed of 89 places in 403 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:44] [INFO ] Deduced a trap composed of 89 places in 410 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:44] [INFO ] Deduced a trap composed of 89 places in 398 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:45] [INFO ] Deduced a trap composed of 89 places in 433 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:45] [INFO ] Deduced a trap composed of 89 places in 393 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:46] [INFO ] Deduced a trap composed of 84 places in 385 ms of which 105 ms to minimize.
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/146 constraints. Problems are: Problem set: 24 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:46] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:47] [INFO ] Deduced a trap composed of 71 places in 318 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:47] [INFO ] Deduced a trap composed of 70 places in 354 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:48] [INFO ] Deduced a trap composed of 70 places in 381 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:48] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:48] [INFO ] Deduced a trap composed of 70 places in 274 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:48] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:49] [INFO ] Deduced a trap composed of 70 places in 372 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:49] [INFO ] Deduced a trap composed of 84 places in 393 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:50] [INFO ] Deduced a trap composed of 89 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 13:42:50] [INFO ] Deduced a trap composed of 89 places in 358 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:50] [INFO ] Deduced a trap composed of 70 places in 366 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:51] [INFO ] Deduced a trap composed of 70 places in 399 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:51] [INFO ] Deduced a trap composed of 89 places in 366 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:52] [INFO ] Deduced a trap composed of 71 places in 366 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:52] [INFO ] Deduced a trap composed of 71 places in 369 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:52] [INFO ] Deduced a trap composed of 70 places in 320 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:53] [INFO ] Deduced a trap composed of 70 places in 397 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:53] [INFO ] Deduced a trap composed of 70 places in 359 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:54] [INFO ] Deduced a trap composed of 70 places in 406 ms of which 77 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/166 constraints. Problems are: Problem set: 24 solved, 440 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:55] [INFO ] Deduced a trap composed of 84 places in 281 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:55] [INFO ] Deduced a trap composed of 89 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 13:42:55] [INFO ] Deduced a trap composed of 89 places in 271 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:56] [INFO ] Deduced a trap composed of 89 places in 276 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:56] [INFO ] Deduced a trap composed of 89 places in 420 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:57] [INFO ] Deduced a trap composed of 89 places in 404 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:57] [INFO ] Deduced a trap composed of 89 places in 392 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:57] [INFO ] Deduced a trap composed of 84 places in 358 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:58] [INFO ] Deduced a trap composed of 89 places in 358 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:58] [INFO ] Deduced a trap composed of 89 places in 367 ms of which 88 ms to minimize.
SMT process timed out in 60188ms, After SMT, problems are : Problem set: 24 solved, 440 unsolved
Search for dead transitions found 24 dead transitions in 60189ms
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 : 533/533 places, 441/465 transitions.
Applied a total of 0 rules in 13 ms. Remains 533 /533 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63576 ms. Remains : 533/533 places, 441/465 transitions.
Computed a total of 478 stabilizing places and 396 stable transitions
Graph (complete) has 1156 edges and 533 vertex of which 532 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 478 stabilizing places and 396 stable transitions
Detected a total of 478/533 stabilizing places and 396/441 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 11 states, 17 edges and 3 AP (stutter sensitive) to 11 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 565 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (205 resets) in 192 ms. (207 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (38 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (36 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
// Phase 1: matrix 441 rows 533 cols
[2025-05-30 13:42:59] [INFO ] Computed 106 invariants in 4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 300/392 variables, 63/65 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 13:42:59] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:59] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:59] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:42:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:00] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 127/519 variables, 40/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/521 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 433/954 variables, 521/632 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 13:43:00] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:00] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:00] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:01] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:01] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:01] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 6/638 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 13:43:01] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:01] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:01] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/954 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 17/971 variables, 9/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/971 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/974 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/974 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/974 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 974/974 variables, and 653 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2728 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 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) 89/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 300/392 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 127/519 variables, 40/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 3/116 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 13:43:03] [INFO ] Deduced a trap composed of 15 places in 365 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:03] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:03] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:04] [INFO ] Deduced a trap composed of 26 places in 415 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:04] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:05] [INFO ] Deduced a trap composed of 30 places in 377 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:05] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:05] [INFO ] Deduced a trap composed of 41 places in 376 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:06] [INFO ] Deduced a trap composed of 44 places in 394 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:06] [INFO ] Deduced a trap composed of 84 places in 428 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:07] [INFO ] Deduced a trap composed of 84 places in 448 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:07] [INFO ] Deduced a trap composed of 85 places in 398 ms of which 89 ms to minimize.
SMT process timed out in 7963ms, 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 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 441/441 transitions.
Graph (trivial) has 250 edges and 533 vertex of which 6 / 533 are part of one of the 1 SCC in 2 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 1142 edges and 528 vertex of which 527 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 527 transition count 374
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 468 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 467 transition count 373
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 122 place count 467 transition count 260
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 372 place count 330 transition count 260
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 667 place count 181 transition count 114
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 669 place count 180 transition count 117
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 670 place count 180 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 671 place count 179 transition count 116
Applied a total of 671 rules in 75 ms. Remains 179 /533 variables (removed 354) and now considering 116/441 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 179/533 places, 116/441 transitions.
RANDOM walk for 40000 steps (2187 resets) in 379 ms. (105 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (1217 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
// Phase 1: matrix 116 rows 179 cols
[2025-05-30 13:43:07] [INFO ] Computed 79 invariants in 2 ms
[2025-05-30 13:43:07] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 98/143 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/172 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/175 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 116/291 variables, 175/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 4/295 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/295 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 179/179 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 98/143 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/172 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/175 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 116/291 variables, 175/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/295 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/295 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 179/179 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 3 factoid took 449 ms. Reduced automaton from 11 states, 17 edges and 3 AP (stutter sensitive) to 11 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 532 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 515 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 557 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 14286 reset in 218 ms.
Product exploration explored 100000 steps with 14267 reset in 252 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, false, false, true]
Stuttering acceptance computed with spot in 554 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Support contains 3 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 441/441 transitions.
Graph (trivial) has 250 edges and 533 vertex of which 6 / 533 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 1149 edges and 528 vertex of which 527 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 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 527 transition count 434
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 79 Pre rules applied. Total rules applied 61 place count 527 transition count 497
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 140 place count 527 transition count 497
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 161 place count 506 transition count 458
Deduced a syphon composed of 117 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 182 place count 506 transition count 458
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 297 places in 0 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 362 place count 506 transition count 458
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 404 place count 464 transition count 416
Deduced a syphon composed of 255 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 446 place count 464 transition count 416
Deduced a syphon composed of 255 places in 0 ms
Applied a total of 446 rules in 175 ms. Remains 464 /533 variables (removed 69) and now considering 416/441 (removed 25) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:43:12] [INFO ] Redundant transitions in 42 ms returned []
Running 415 sub problems to find dead transitions.
// Phase 1: matrix 416 rows 464 cols
[2025-05-30 13:43:12] [INFO ] Computed 106 invariants in 10 ms
[2025-05-30 13:43:12] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/464 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:30] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:30] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:31] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:31] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:31] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:32] [INFO ] Deduced a trap composed of 3 places in 379 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:32] [INFO ] Deduced a trap composed of 14 places in 387 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:33] [INFO ] Deduced a trap composed of 33 places in 379 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:33] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:33] [INFO ] Deduced a trap composed of 42 places in 401 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:34] [INFO ] Deduced a trap composed of 44 places in 415 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:34] [INFO ] Deduced a trap composed of 42 places in 399 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:35] [INFO ] Deduced a trap composed of 44 places in 386 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:35] [INFO ] Deduced a trap composed of 34 places in 402 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:35] [INFO ] Deduced a trap composed of 43 places in 379 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:36] [INFO ] Deduced a trap composed of 45 places in 397 ms of which 46 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:36] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 14 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:37] [INFO ] Deduced a trap composed of 3 places in 377 ms of which 14 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:37] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 14 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:37] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 15 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 20/126 constraints. Problems are: Problem set: 166 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:42] [INFO ] Deduced a trap composed of 3 places in 362 ms of which 17 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:43:42] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
SMT process timed out in 30384ms, After SMT, problems are : Problem set: 167 solved, 248 unsolved
Search for dead transitions found 167 dead transitions in 30387ms
Found 167 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 167 transitions
Dead transitions reduction (with SMT) removed 167 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 464/533 places, 249/441 transitions.
Graph (complete) has 1048 edges and 464 vertex of which 340 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.2 ms
Discarding 124 places :
Also discarding 0 output transitions
Ensure Unique test removed 8 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 132 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 332 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 331 transition count 253
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 331 transition count 253
Deduced a syphon composed of 131 places in 0 ms
Applied a total of 4 rules in 46 ms. Remains 331 /464 variables (removed 133) and now considering 253/249 (removed -4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 331/533 places, 253/441 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30662 ms. Remains : 331/533 places, 253/441 transitions.
Built C files in :
/tmp/ltsmin17062410464997314934
[2025-05-30 13:43:42] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17062410464997314934
Running compilation step : cd /tmp/ltsmin17062410464997314934;'/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 1371 ms.
Running link step : cd /tmp/ltsmin17062410464997314934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17062410464997314934;'/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/stateBased5857450969063435566.hoa' '--buchi-type=spotba'
LTSmin run took 558 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 154280 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&&G(p1)) U X(X(!p0)))))'
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 534 transition count 466
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 532 transition count 464
Applied a total of 24 rules in 42 ms. Remains 532 /544 variables (removed 12) and now considering 464/476 (removed 12) transitions.
// Phase 1: matrix 464 rows 532 cols
[2025-05-30 13:43:44] [INFO ] Computed 106 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:43:45] [INFO ] Implicit Places using invariants in 671 ms returned []
[2025-05-30 13:43:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:43:47] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-05-30 13:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:10] [INFO ] Deduced a trap composed of 68 places in 253 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:11] [INFO ] Deduced a trap composed of 68 places in 404 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:11] [INFO ] Deduced a trap composed of 68 places in 378 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:12] [INFO ] Deduced a trap composed of 68 places in 389 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:12] [INFO ] Deduced a trap composed of 68 places in 381 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:12] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:13] [INFO ] Deduced a trap composed of 68 places in 392 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:13] [INFO ] Deduced a trap composed of 68 places in 387 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:14] [INFO ] Deduced a trap composed of 68 places in 372 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:14] [INFO ] Deduced a trap composed of 68 places in 370 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:14] [INFO ] Deduced a trap composed of 68 places in 379 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:15] [INFO ] Deduced a trap composed of 68 places in 369 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:15] [INFO ] Deduced a trap composed of 68 places in 345 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:16] [INFO ] Deduced a trap composed of 68 places in 360 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:16] [INFO ] Deduced a trap composed of 68 places in 344 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:16] [INFO ] Deduced a trap composed of 68 places in 326 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:17] [INFO ] Deduced a trap composed of 68 places in 354 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:17] [INFO ] Deduced a trap composed of 68 places in 337 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:17] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 68 ms to minimize.
SMT process timed out in 30254ms, After SMT, problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 30255ms
Starting structural reductions in LTL mode, iteration 1 : 532/544 places, 464/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33235 ms. Remains : 532/544 places, 464/476 transitions.
Stuttering acceptance computed with spot in 423 ms :[p0, p0, p0, p0, p0, true, p0, p0, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-08 finished in 33698 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)||G((p1&&X(p2)))))'
Support contains 5 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 533 transition count 465
Applied a total of 22 rules in 51 ms. Remains 533 /544 variables (removed 11) and now considering 465/476 (removed 11) transitions.
// Phase 1: matrix 465 rows 533 cols
[2025-05-30 13:44:18] [INFO ] Computed 106 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:44:19] [INFO ] Implicit Places using invariants in 662 ms returned []
[2025-05-30 13:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:44:20] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-05-30 13:44:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:45] [INFO ] Deduced a trap composed of 69 places in 381 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:45] [INFO ] Deduced a trap composed of 69 places in 366 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:45] [INFO ] Deduced a trap composed of 69 places in 355 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:46] [INFO ] Deduced a trap composed of 69 places in 366 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:46] [INFO ] Deduced a trap composed of 69 places in 362 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:46] [INFO ] Deduced a trap composed of 69 places in 346 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:47] [INFO ] Deduced a trap composed of 69 places in 389 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:47] [INFO ] Deduced a trap composed of 69 places in 395 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:48] [INFO ] Deduced a trap composed of 69 places in 382 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:48] [INFO ] Deduced a trap composed of 69 places in 381 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:49] [INFO ] Deduced a trap composed of 69 places in 370 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:49] [INFO ] Deduced a trap composed of 69 places in 376 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:49] [INFO ] Deduced a trap composed of 69 places in 392 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:50] [INFO ] Deduced a trap composed of 69 places in 341 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:50] [INFO ] Deduced a trap composed of 69 places in 357 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:50] [INFO ] Deduced a trap composed of 69 places in 387 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:44:51] [INFO ] Deduced a trap composed of 69 places in 388 ms of which 81 ms to minimize.
SMT process timed out in 30452ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 30454ms
Starting structural reductions in LTL mode, iteration 1 : 533/544 places, 465/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33036 ms. Remains : 533/544 places, 465/476 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Computed a total of 477 stabilizing places and 419 stable transitions
Graph (complete) has 1202 edges and 533 vertex of which 532 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 477 stabilizing places and 419 stable transitions
Detected a total of 477/533 stabilizing places and 419/465 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X p0), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 23 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-09 finished in 33886 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(p1))) U (p2 U X(p0))))'
Support contains 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 535 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 533 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 533 transition count 465
Applied a total of 22 rules in 76 ms. Remains 533 /544 variables (removed 11) and now considering 465/476 (removed 11) transitions.
// Phase 1: matrix 465 rows 533 cols
[2025-05-30 13:44:52] [INFO ] Computed 106 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:44:53] [INFO ] Implicit Places using invariants in 775 ms returned []
[2025-05-30 13:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:44:55] [INFO ] Implicit Places using invariants and state equation in 2562 ms returned []
Implicit Place search using SMT with State Equation took 3339 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-05-30 13:44:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:19] [INFO ] Deduced a trap composed of 68 places in 439 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:20] [INFO ] Deduced a trap composed of 68 places in 408 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:20] [INFO ] Deduced a trap composed of 68 places in 374 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:20] [INFO ] Deduced a trap composed of 68 places in 355 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:21] [INFO ] Deduced a trap composed of 68 places in 327 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:21] [INFO ] Deduced a trap composed of 68 places in 388 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:22] [INFO ] Deduced a trap composed of 68 places in 389 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:22] [INFO ] Deduced a trap composed of 68 places in 368 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:22] [INFO ] Deduced a trap composed of 68 places in 347 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:23] [INFO ] Deduced a trap composed of 68 places in 344 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:23] [INFO ] Deduced a trap composed of 68 places in 376 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:24] [INFO ] Deduced a trap composed of 68 places in 376 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:24] [INFO ] Deduced a trap composed of 68 places in 348 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:24] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:25] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:25] [INFO ] Deduced a trap composed of 89 places in 368 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:25] [INFO ] Deduced a trap composed of 89 places in 402 ms of which 92 ms to minimize.
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 30269ms
Starting structural reductions in LTL mode, iteration 1 : 533/544 places, 465/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33687 ms. Remains : 533/544 places, 465/476 transitions.
Stuttering acceptance computed with spot in 512 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-10
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-10 finished in 34238 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 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Graph (trivial) has 263 edges and 544 vertex of which 7 / 544 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1210 edges and 538 vertex of which 537 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 536 transition count 401
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 470 transition count 401
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 470 transition count 287
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 331 transition count 287
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 396 place count 322 transition count 278
Iterating global reduction 2 with 9 rules applied. Total rules applied 405 place count 322 transition count 278
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 688 place count 179 transition count 138
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 690 place count 178 transition count 141
Applied a total of 690 rules in 68 ms. Remains 178 /544 variables (removed 366) and now considering 141/476 (removed 335) transitions.
// Phase 1: matrix 141 rows 178 cols
[2025-05-30 13:45:26] [INFO ] Computed 78 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:45:26] [INFO ] Implicit Places using invariants in 417 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 433 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/544 places, 141/476 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 511 ms. Remains : 150/544 places, 141/476 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-11 finished in 578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U (p1 U p2))))'
Support contains 5 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 534 transition count 466
Applied a total of 20 rules in 80 ms. Remains 534 /544 variables (removed 10) and now considering 466/476 (removed 10) transitions.
// Phase 1: matrix 466 rows 534 cols
[2025-05-30 13:45:27] [INFO ] Computed 106 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:45:27] [INFO ] Implicit Places using invariants in 559 ms returned []
[2025-05-30 13:45:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:45:29] [INFO ] Implicit Places using invariants and state equation in 1739 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2025-05-30 13:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:53] [INFO ] Deduced a trap composed of 71 places in 379 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:53] [INFO ] Deduced a trap composed of 71 places in 371 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:54] [INFO ] Deduced a trap composed of 71 places in 401 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:54] [INFO ] Deduced a trap composed of 71 places in 392 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:55] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:55] [INFO ] Deduced a trap composed of 71 places in 396 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:55] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:56] [INFO ] Deduced a trap composed of 71 places in 375 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:56] [INFO ] Deduced a trap composed of 71 places in 369 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:57] [INFO ] Deduced a trap composed of 90 places in 383 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:57] [INFO ] Deduced a trap composed of 90 places in 367 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:57] [INFO ] Deduced a trap composed of 90 places in 342 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:58] [INFO ] Deduced a trap composed of 91 places in 410 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:58] [INFO ] Deduced a trap composed of 91 places in 406 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:59] [INFO ] Deduced a trap composed of 91 places in 410 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:45:59] [INFO ] Deduced a trap composed of 91 places in 386 ms of which 83 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 30183ms
Starting structural reductions in LTL mode, iteration 1 : 534/544 places, 466/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32564 ms. Remains : 534/544 places, 466/476 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), p0]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 532 reset in 582 ms.
Product exploration explored 100000 steps with 540 reset in 360 ms.
Computed a total of 478 stabilizing places and 420 stable transitions
Graph (complete) has 1203 edges and 534 vertex of which 533 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 478 stabilizing places and 420 stable transitions
Detected a total of 478/534 stabilizing places and 420/466 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
RANDOM walk for 40000 steps (211 resets) in 136 ms. (291 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (34 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (37 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (35 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (34 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (37 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
[2025-05-30 13:46:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 141/146 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/393 variables, 61/65 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:02] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:02] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:02] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:02] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:03] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:03] [INFO ] Deduced a trap composed of 77 places in 254 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:03] [INFO ] Deduced a trap composed of 77 places in 276 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:04] [INFO ] Deduced a trap composed of 77 places in 260 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:04] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:04] [INFO ] Deduced a trap composed of 77 places in 257 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:04] [INFO ] Deduced a trap composed of 77 places in 254 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:05] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:05] [INFO ] Deduced a trap composed of 77 places in 274 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:05] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:05] [INFO ] Deduced a trap composed of 77 places in 258 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:06] [INFO ] Deduced a trap composed of 88 places in 282 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:46:06] [INFO ] Deduced a trap composed of 89 places in 302 ms of which 66 ms to minimize.
SMT process timed out in 5029ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 466/466 transitions.
Graph (trivial) has 249 edges and 534 vertex of which 6 / 534 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 1196 edges and 529 vertex of which 528 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 528 transition count 399
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 469 transition count 399
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 120 place count 469 transition count 287
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 368 place count 333 transition count 287
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 665 place count 183 transition count 140
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 667 place count 182 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 668 place count 182 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 669 place count 181 transition count 142
Applied a total of 669 rules in 60 ms. Remains 181 /534 variables (removed 353) and now considering 142/466 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 181/534 places, 142/466 transitions.
RANDOM walk for 709 steps (34 resets) in 10 ms. (64 steps per ms) remains 0/2 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) p0))), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 13 factoid took 1772 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
[2025-05-30 13:46:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:46:09] [INFO ] [Real]Absence check using 65 positive place invariants in 219 ms returned sat
[2025-05-30 13:46:10] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 179 ms returned sat
[2025-05-30 13:46:15] [INFO ] [Real]Absence check using state equation in 5555 ms returned sat
[2025-05-30 13:46:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:46:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 70 ms returned sat
[2025-05-30 13:46:16] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 56 ms returned sat
[2025-05-30 13:46:17] [INFO ] [Nat]Absence check using state equation in 1625 ms returned sat
[2025-05-30 13:46:17] [INFO ] Computed and/alt/rep : 460/882/460 causal constraints (skipped 5 transitions) in 35 ms.
[2025-05-30 13:46:29] [INFO ] Added : 321 causal constraints over 65 iterations in 11786 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 534 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 534/534 places, 466/466 transitions.
Graph (trivial) has 247 edges and 534 vertex of which 4 / 534 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1200 edges and 531 vertex of which 530 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 529 transition count 402
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 470 transition count 402
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 120 place count 470 transition count 290
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 368 place count 334 transition count 290
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 663 place count 185 transition count 144
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 665 place count 184 transition count 147
Applied a total of 665 rules in 38 ms. Remains 184 /534 variables (removed 350) and now considering 147/466 (removed 319) transitions.
// Phase 1: matrix 147 rows 184 cols
[2025-05-30 13:46:29] [INFO ] Computed 79 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:46:30] [INFO ] Implicit Places using invariants in 376 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 378 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/534 places, 147/466 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 421 ms. Remains : 156/534 places, 147/466 transitions.
Computed a total of 132 stabilizing places and 127 stable transitions
Computed a total of 132 stabilizing places and 127 stable transitions
Detected a total of 132/156 stabilizing places and 127/147 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
Knowledge based reduction with 16 factoid took 842 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
RANDOM walk for 40000 steps (3662 resets) in 877 ms. (45 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (1243 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1194 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1183 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
// Phase 1: matrix 147 rows 156 cols
[2025-05-30 13:46:31] [INFO ] Computed 51 invariants in 1 ms
[2025-05-30 13:46:31] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/51 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/119 variables, 34/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/149 variables, 12/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/152 variables, 3/51 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 146/298 variables, 152/203 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 4/207 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 4/302 variables, 4/211 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/302 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/303 variables, and 211 constraints, problems are : Problem set: 3 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 156/156 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 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: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/51 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/119 variables, 34/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/36 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/149 variables, 12/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/152 variables, 3/51 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/51 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 146/298 variables, 152/203 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 4/207 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 1/208 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/302 variables, 4/212 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/302 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/303 variables, and 212 constraints, problems are : Problem set: 3 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 156/156 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (F (NOT (OR p1 (NOT p2) p0))), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 19 factoid took 1805 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
[2025-05-30 13:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:46:35] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2025-05-30 13:46:35] [INFO ] [Real]Absence check using 36 positive and 15 generalized place invariants in 19 ms returned sat
[2025-05-30 13:46:35] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2025-05-30 13:46:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 13:46:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2025-05-30 13:46:35] [INFO ] [Nat]Absence check using 36 positive and 15 generalized place invariants in 11 ms returned sat
[2025-05-30 13:46:36] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-05-30 13:46:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 13:46:36] [INFO ] [Nat]Added 4 Read/Feed constraints in 13 ms returned sat
[2025-05-30 13:46:36] [INFO ] Computed and/alt/rep : 129/492/129 causal constraints (skipped 13 transitions) in 15 ms.
[2025-05-30 13:46:36] [INFO ] Added : 16 causal constraints over 4 iterations in 115 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p2) p0), (NOT p2), p0, false, false, false, false]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-12 finished in 69627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 2 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Graph (trivial) has 263 edges and 544 vertex of which 7 / 544 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1210 edges and 538 vertex of which 537 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 536 transition count 402
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 471 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 470 transition count 401
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 134 place count 470 transition count 287
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 387 place count 331 transition count 287
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 396 place count 322 transition count 278
Iterating global reduction 3 with 9 rules applied. Total rules applied 405 place count 322 transition count 278
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 686 place count 180 transition count 139
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 688 place count 179 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 689 place count 178 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 177 transition count 141
Applied a total of 690 rules in 66 ms. Remains 177 /544 variables (removed 367) and now considering 141/476 (removed 335) transitions.
// Phase 1: matrix 141 rows 177 cols
[2025-05-30 13:46:36] [INFO ] Computed 77 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:46:37] [INFO ] Implicit Places using invariants in 347 ms returned [43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 348 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/544 places, 141/476 transitions.
Applied a total of 0 rules in 8 ms. Remains 166 /166 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 423 ms. Remains : 166/544 places, 141/476 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-13 finished in 543 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((G(p0)||F((X(p2)||p1)))))'
Support contains 5 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 533 transition count 465
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 533 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 531 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 531 transition count 463
Applied a total of 26 rules in 74 ms. Remains 531 /544 variables (removed 13) and now considering 463/476 (removed 13) transitions.
// Phase 1: matrix 463 rows 531 cols
[2025-05-30 13:46:37] [INFO ] Computed 106 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:46:37] [INFO ] Implicit Places using invariants in 654 ms returned []
[2025-05-30 13:46:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:46:40] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2025-05-30 13:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:02] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:03] [INFO ] Deduced a trap composed of 89 places in 264 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:03] [INFO ] Deduced a trap composed of 89 places in 261 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:03] [INFO ] Deduced a trap composed of 89 places in 366 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:04] [INFO ] Deduced a trap composed of 89 places in 405 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:04] [INFO ] Deduced a trap composed of 89 places in 369 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:05] [INFO ] Deduced a trap composed of 89 places in 357 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:05] [INFO ] Deduced a trap composed of 89 places in 365 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:05] [INFO ] Deduced a trap composed of 89 places in 391 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:06] [INFO ] Deduced a trap composed of 89 places in 365 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:06] [INFO ] Deduced a trap composed of 89 places in 341 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:07] [INFO ] Deduced a trap composed of 89 places in 344 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:07] [INFO ] Deduced a trap composed of 89 places in 387 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:07] [INFO ] Deduced a trap composed of 89 places in 395 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:08] [INFO ] Deduced a trap composed of 89 places in 389 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:08] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:08] [INFO ] Deduced a trap composed of 89 places in 386 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:09] [INFO ] Deduced a trap composed of 89 places in 399 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:09] [INFO ] Deduced a trap composed of 88 places in 476 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:47:10] [INFO ] Deduced a trap composed of 87 places in 409 ms of which 68 ms to minimize.
SMT process timed out in 30443ms, After SMT, problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 30446ms
Starting structural reductions in LTL mode, iteration 1 : 531/544 places, 463/476 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33250 ms. Remains : 531/544 places, 463/476 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Computed a total of 476 stabilizing places and 418 stable transitions
Graph (complete) has 1200 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 476 stabilizing places and 418 stable transitions
Detected a total of 476/531 stabilizing places and 418/463 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 24 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-14 finished in 34064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 4 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 476/476 transitions.
Graph (complete) has 1217 edges and 544 vertex of which 543 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 542 transition count 410
Reduce places removed 64 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 478 transition count 407
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 475 transition count 407
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 135 place count 475 transition count 291
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 392 place count 334 transition count 291
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 402 place count 324 transition count 281
Iterating global reduction 3 with 10 rules applied. Total rules applied 412 place count 324 transition count 281
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 283 rules applied. Total rules applied 695 place count 181 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 696 place count 181 transition count 140
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 4 with 2 rules applied. Total rules applied 698 place count 180 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 699 place count 179 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 700 place count 178 transition count 142
Applied a total of 700 rules in 64 ms. Remains 178 /544 variables (removed 366) and now considering 142/476 (removed 334) transitions.
// Phase 1: matrix 142 rows 178 cols
[2025-05-30 13:47:11] [INFO ] Computed 77 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:47:11] [INFO ] Implicit Places using invariants in 299 ms returned [38, 39, 40, 41, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 300 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/544 places, 142/476 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 164/544 places, 142/476 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-15 finished in 475 ms.
All properties solved by simple procedures.
Total runtime 491570 ms.
BK_STOP 1748612831852
--------------------
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-18"
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-18, 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-174853813400140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 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 ;