About the Execution of ITS-Tools for BusinessProcesses-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 487780.00 | 0.00 | 0.00 | FFFFFFFFFFFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300116.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-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 157K 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-15-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748596810353
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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 09:20:13] [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 09:20:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 09:20:13] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2025-05-30 09:20:13] [INFO ] Transformed 630 places.
[2025-05-30 09:20:13] [INFO ] Transformed 566 transitions.
[2025-05-30 09:20:13] [INFO ] Found NUPN structural information;
[2025-05-30 09:20:13] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 531 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4 places in 24 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 88 place count 538 transition count 477
Iterating global reduction 1 with 85 rules applied. Total rules applied 173 place count 538 transition count 477
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 215 place count 496 transition count 435
Iterating global reduction 1 with 42 rules applied. Total rules applied 257 place count 496 transition count 435
Applied a total of 257 rules in 291 ms. Remains 496 /626 variables (removed 130) and now considering 435/562 (removed 127) transitions.
// Phase 1: matrix 435 rows 496 cols
[2025-05-30 09:20:14] [INFO ] Computed 99 invariants in 62 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:20:16] [INFO ] Implicit Places using invariants in 1614 ms returned []
[2025-05-30 09:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:20:19] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-05-30 09:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/496 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:49] [INFO ] Deduced a trap composed of 64 places in 515 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:49] [INFO ] Deduced a trap composed of 64 places in 388 ms of which 66 ms to minimize.
SMT process timed out in 30442ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30472ms
Starting structural reductions in LTL mode, iteration 1 : 496/626 places, 435/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35365 ms. Remains : 496/626 places, 435/562 transitions.
Support contains 46 out of 496 places after structural reductions.
[2025-05-30 09:20:50] [INFO ] Flatten gal took : 147 ms
[2025-05-30 09:20:50] [INFO ] Flatten gal took : 79 ms
[2025-05-30 09:20:50] [INFO ] Input system was already deterministic with 435 transitions.
RANDOM walk for 40000 steps (266 resets) in 2448 ms. (16 steps per ms) remains 17/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
[2025-05-30 09:20:51] [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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 154/180 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 193/373 variables, 48/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 116/489 variables, 40/98 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:52] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:52] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:52] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:53] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:53] [INFO ] Deduced a trap composed of 22 places in 293 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:53] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:54] [INFO ] Deduced a trap composed of 30 places in 448 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:54] [INFO ] Deduced a trap composed of 47 places in 299 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:55] [INFO ] Deduced a trap composed of 47 places in 385 ms of which 62 ms to minimize.
Problem AtomicPropp5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:55] [INFO ] Deduced a trap composed of 77 places in 452 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:56] [INFO ] Deduced a trap composed of 79 places in 467 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:56] [INFO ] Deduced a trap composed of 79 places in 433 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:56] [INFO ] Deduced a trap composed of 50 places in 309 ms of which 57 ms to minimize.
SMT process timed out in 5285ms, After SMT, problems are : Problem set: 2 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 219 edges and 496 vertex of which 6 / 496 are part of one of the 1 SCC in 7 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 1113 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 490 transition count 373
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 436 transition count 373
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 110 place count 436 transition count 279
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 317 place count 323 transition count 279
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 321 place count 319 transition count 275
Iterating global reduction 2 with 4 rules applied. Total rules applied 325 place count 319 transition count 275
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 583 place count 188 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 585 place count 187 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 587 place count 187 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 589 place count 185 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 590 place count 185 transition count 150
Applied a total of 590 rules in 239 ms. Remains 185 /496 variables (removed 311) and now considering 150/435 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 185/496 places, 150/435 transitions.
RANDOM walk for 40000 steps (953 resets) in 1806 ms. (22 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40003 steps (494 resets) in 1129 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (501 resets) in 308 ms. (129 steps per ms) remains 2/2 properties
// Phase 1: matrix 150 rows 185 cols
[2025-05-30 09:20:58] [INFO ] Computed 76 invariants in 10 ms
[2025-05-30 09:20:58] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 92/141 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:58] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 40/181 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:58] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:20:58] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 18 ms to minimize.
Problem AtomicPropp29 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/183 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 150/333 variables, 183/262 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 12/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/335 variables, 2/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/335 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 276 constraints, problems are : Problem set: 1 solved, 1 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/140 variables, 56/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/181 variables, 17/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/183 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 150/333 variables, 183/262 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 12/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 1/275 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 09:20:59] [INFO ] Deduced a trap along path composed of 4 places in 36 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/335 variables, 2/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/335 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 278 constraints, problems are : Problem set: 1 solved, 1 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 185/185 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1278ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 11 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 211 stabilizing places and 183 stable transitions
Graph (complete) has 1120 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 ms
FORMULA BusinessProcesses-PT-15-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p0)))||X(G(p1))))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 485 transition count 424
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 485 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 484 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 116 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2025-05-30 09:21:00] [INFO ] Computed 99 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:21:00] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-05-30 09:21:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:21:03] [INFO ] Implicit Places using invariants and state equation in 2877 ms returned []
Implicit Place search using SMT with State Equation took 3620 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-05-30 09:21:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:30] [INFO ] Deduced a trap composed of 62 places in 382 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:30] [INFO ] Deduced a trap composed of 83 places in 381 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:31] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:31] [INFO ] Deduced a trap composed of 83 places in 373 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:31] [INFO ] Deduced a trap composed of 83 places in 363 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:32] [INFO ] Deduced a trap composed of 83 places in 394 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:32] [INFO ] Deduced a trap composed of 83 places in 297 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:32] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:33] [INFO ] Deduced a trap composed of 82 places in 352 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:33] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:33] [INFO ] Deduced a trap composed of 61 places in 225 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:21:33] [INFO ] Deduced a trap composed of 82 places in 261 ms of which 53 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 30148ms
Starting structural reductions in LTL mode, iteration 1 : 484/496 places, 423/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33889 ms. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 511 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-00 finished in 34535 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))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 485 transition count 424
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 485 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 484 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 81 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
[2025-05-30 09:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:21:35] [INFO ] Implicit Places using invariants in 527 ms returned []
[2025-05-30 09:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:21:37] [INFO ] Implicit Places using invariants and state equation in 2228 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-05-30 09:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:00] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:00] [INFO ] Deduced a trap composed of 83 places in 231 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:01] [INFO ] Deduced a trap composed of 83 places in 256 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:01] [INFO ] Deduced a trap composed of 83 places in 368 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:01] [INFO ] Deduced a trap composed of 83 places in 357 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:02] [INFO ] Deduced a trap composed of 83 places in 333 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:02] [INFO ] Deduced a trap composed of 83 places in 328 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:02] [INFO ] Deduced a trap composed of 61 places in 312 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:03] [INFO ] Deduced a trap composed of 82 places in 367 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:03] [INFO ] Deduced a trap composed of 61 places in 321 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:03] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:04] [INFO ] Deduced a trap composed of 82 places in 321 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:04] [INFO ] Deduced a trap composed of 82 places in 334 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:05] [INFO ] Deduced a trap composed of 82 places in 328 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:05] [INFO ] Deduced a trap composed of 82 places in 288 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:05] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:06] [INFO ] Deduced a trap composed of 82 places in 330 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:06] [INFO ] Deduced a trap composed of 82 places in 324 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:06] [INFO ] Deduced a trap composed of 61 places in 313 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:07] [INFO ] Deduced a trap composed of 82 places in 318 ms of which 73 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:07] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 4 ms to minimize.
SMT process timed out in 30152ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 30155ms
Starting structural reductions in LTL mode, iteration 1 : 484/496 places, 423/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32998 ms. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-03 finished in 33125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 232 edges and 496 vertex of which 6 / 496 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1114 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 489 transition count 373
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 435 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 434 transition count 372
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 112 place count 434 transition count 270
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 335 place count 313 transition count 270
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 345 place count 303 transition count 260
Iterating global reduction 3 with 10 rules applied. Total rules applied 355 place count 303 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 355 place count 303 transition count 259
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 302 transition count 259
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 607 place count 175 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 609 place count 174 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 610 place count 173 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 172 transition count 139
Applied a total of 611 rules in 154 ms. Remains 172 /496 variables (removed 324) and now considering 139/435 (removed 296) transitions.
// Phase 1: matrix 139 rows 172 cols
[2025-05-30 09:22:07] [INFO ] Computed 75 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:22:08] [INFO ] Implicit Places using invariants in 268 ms returned [35, 36, 41, 42, 43, 49, 50, 51, 52, 53, 54, 55, 141]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 273 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/496 places, 139/435 transitions.
Applied a total of 0 rules in 16 ms. Remains 159 /159 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 445 ms. Remains : 159/496 places, 139/435 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-04 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&F(p2)&&X(p3)))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 485 transition count 424
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 485 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 484 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 56 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2025-05-30 09:22:08] [INFO ] Computed 99 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:22:08] [INFO ] Implicit Places using invariants in 474 ms returned []
[2025-05-30 09:22:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:22:10] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2559 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-05-30 09:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:33] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:33] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:34] [INFO ] Deduced a trap composed of 83 places in 249 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:34] [INFO ] Deduced a trap composed of 83 places in 349 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:34] [INFO ] Deduced a trap composed of 83 places in 330 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:35] [INFO ] Deduced a trap composed of 83 places in 316 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:35] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:35] [INFO ] Deduced a trap composed of 61 places in 325 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:36] [INFO ] Deduced a trap composed of 82 places in 349 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:36] [INFO ] Deduced a trap composed of 61 places in 334 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:36] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:37] [INFO ] Deduced a trap composed of 82 places in 372 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:37] [INFO ] Deduced a trap composed of 82 places in 219 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:37] [INFO ] Deduced a trap composed of 82 places in 284 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:38] [INFO ] Deduced a trap composed of 82 places in 348 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:38] [INFO ] Deduced a trap composed of 61 places in 319 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:38] [INFO ] Deduced a trap composed of 82 places in 329 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:39] [INFO ] Deduced a trap composed of 82 places in 345 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:39] [INFO ] Deduced a trap composed of 61 places in 351 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:39] [INFO ] Deduced a trap composed of 82 places in 352 ms of which 78 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:40] [INFO ] Deduced a trap composed of 20 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 09:22:40] [INFO ] Deduced a trap composed of 82 places in 325 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:22:41] [INFO ] Deduced a trap composed of 82 places in 307 ms of which 71 ms to minimize.
SMT process timed out in 30277ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 30281ms
Starting structural reductions in LTL mode, iteration 1 : 484/496 places, 423/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32899 ms. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p3), true]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-05
Stuttering criterion allowed to conclude after 138 steps with 1 reset in 3 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-05 finished in 33209 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) U X(p1))) U X((p2 U X(G(p3))))))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 487 transition count 426
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 487 transition count 426
Applied a total of 18 rules in 25 ms. Remains 487 /496 variables (removed 9) and now considering 426/435 (removed 9) transitions.
// Phase 1: matrix 426 rows 487 cols
[2025-05-30 09:22:41] [INFO ] Computed 99 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:22:42] [INFO ] Implicit Places using invariants in 570 ms returned []
[2025-05-30 09:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:22:45] [INFO ] Implicit Places using invariants and state equation in 3183 ms returned []
Implicit Place search using SMT with State Equation took 3756 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-05-30 09:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:10] [INFO ] Deduced a trap composed of 63 places in 208 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:10] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:11] [INFO ] Deduced a trap composed of 63 places in 303 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:11] [INFO ] Deduced a trap composed of 63 places in 309 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:11] [INFO ] Deduced a trap composed of 84 places in 351 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:12] [INFO ] Deduced a trap composed of 84 places in 362 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:12] [INFO ] Deduced a trap composed of 84 places in 329 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:12] [INFO ] Deduced a trap composed of 84 places in 347 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:13] [INFO ] Deduced a trap composed of 84 places in 322 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:13] [INFO ] Deduced a trap composed of 79 places in 311 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:13] [INFO ] Deduced a trap composed of 84 places in 304 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:14] [INFO ] Deduced a trap composed of 79 places in 296 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:14] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:14] [INFO ] Deduced a trap composed of 79 places in 312 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:15] [INFO ] Deduced a trap composed of 84 places in 299 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:15] [INFO ] Deduced a trap composed of 84 places in 263 ms of which 59 ms to minimize.
SMT process timed out in 30102ms, After SMT, problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 30104ms
Starting structural reductions in LTL mode, iteration 1 : 487/496 places, 426/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33887 ms. Remains : 487/496 places, 426/435 transitions.
Stuttering acceptance computed with spot in 950 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-06 finished in 34910 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 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 232 edges and 496 vertex of which 6 / 496 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1114 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 489 transition count 372
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 434 transition count 372
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 112 place count 434 transition count 270
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 336 place count 312 transition count 270
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 347 place count 301 transition count 259
Iterating global reduction 2 with 11 rules applied. Total rules applied 358 place count 301 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 358 place count 301 transition count 258
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 360 place count 300 transition count 258
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 611 place count 173 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 613 place count 172 transition count 138
Applied a total of 613 rules in 89 ms. Remains 172 /496 variables (removed 324) and now considering 138/435 (removed 297) transitions.
// Phase 1: matrix 138 rows 172 cols
[2025-05-30 09:23:16] [INFO ] Computed 76 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:23:16] [INFO ] Implicit Places using invariants in 325 ms returned [1, 4, 5, 6, 7, 10, 11, 34, 35, 36, 37, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 333 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/496 places, 138/435 transitions.
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 434 ms. Remains : 150/496 places, 138/435 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-08 finished in 548 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 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (complete) has 1120 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 494 transition count 379
Reduce places removed 54 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 56 rules applied. Total rules applied 111 place count 440 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 438 transition count 377
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 113 place count 438 transition count 271
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 345 place count 312 transition count 271
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 356 place count 301 transition count 260
Iterating global reduction 3 with 11 rules applied. Total rules applied 367 place count 301 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 367 place count 301 transition count 259
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 369 place count 300 transition count 259
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 621 place count 172 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 622 place count 172 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 624 place count 171 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 625 place count 170 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 626 place count 169 transition count 137
Applied a total of 626 rules in 110 ms. Remains 169 /496 variables (removed 327) and now considering 137/435 (removed 298) transitions.
// Phase 1: matrix 137 rows 169 cols
[2025-05-30 09:23:16] [INFO ] Computed 74 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:23:17] [INFO ] Implicit Places using invariants in 294 ms returned [50, 51, 52, 53]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 298 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/496 places, 137/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 165 /165 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 424 ms. Remains : 165/496 places, 137/435 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-09
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-09 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&F((p1||G(p0))))))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 485 transition count 424
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 485 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 484 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 484 transition count 423
Applied a total of 24 rules in 117 ms. Remains 484 /496 variables (removed 12) and now considering 423/435 (removed 12) transitions.
// Phase 1: matrix 423 rows 484 cols
[2025-05-30 09:23:17] [INFO ] Computed 99 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:23:18] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-05-30 09:23:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:23:20] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-05-30 09:23: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/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:45] [INFO ] Deduced a trap composed of 62 places in 340 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:45] [INFO ] Deduced a trap composed of 83 places in 419 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:46] [INFO ] Deduced a trap composed of 83 places in 384 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:46] [INFO ] Deduced a trap composed of 83 places in 400 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:47] [INFO ] Deduced a trap composed of 83 places in 376 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:47] [INFO ] Deduced a trap composed of 83 places in 368 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:47] [INFO ] Deduced a trap composed of 83 places in 242 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:48] [INFO ] Deduced a trap composed of 61 places in 355 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:48] [INFO ] Deduced a trap composed of 82 places in 346 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:48] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:49] [INFO ] Deduced a trap composed of 61 places in 347 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:49] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:49] [INFO ] Deduced a trap composed of 82 places in 363 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:50] [INFO ] Deduced a trap composed of 82 places in 362 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:23:50] [INFO ] Deduced a trap composed of 82 places in 240 ms of which 50 ms to minimize.
SMT process timed out in 30234ms, After SMT, problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 30238ms
Starting structural reductions in LTL mode, iteration 1 : 484/496 places, 423/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33178 ms. Remains : 484/496 places, 423/435 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 937 reset in 550 ms.
Stack based approach found an accepted trace after 1455 steps with 14 reset with depth 19 and stack size 19 in 8 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 33891 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((F(p0)||(p1&&F(G(p2)))))))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 486 transition count 425
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 486 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 485 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 485 transition count 424
Applied a total of 22 rules in 60 ms. Remains 485 /496 variables (removed 11) and now considering 424/435 (removed 11) transitions.
// Phase 1: matrix 424 rows 485 cols
[2025-05-30 09:23:51] [INFO ] Computed 99 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:23:51] [INFO ] Implicit Places using invariants in 666 ms returned []
[2025-05-30 09:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:23:55] [INFO ] Implicit Places using invariants and state equation in 3334 ms returned []
Implicit Place search using SMT with State Equation took 4004 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2025-05-30 09:23: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/484 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/485 variables, 59/98 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:18] [INFO ] Deduced a trap composed of 62 places in 349 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:19] [INFO ] Deduced a trap composed of 62 places in 350 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:19] [INFO ] Deduced a trap composed of 62 places in 335 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:19] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:20] [INFO ] Deduced a trap composed of 61 places in 365 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:20] [INFO ] Deduced a trap composed of 61 places in 337 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:20] [INFO ] Deduced a trap composed of 61 places in 323 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:21] [INFO ] Deduced a trap composed of 61 places in 349 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:21] [INFO ] Deduced a trap composed of 61 places in 309 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:21] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:22] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:22] [INFO ] Deduced a trap composed of 61 places in 367 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:22] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:23] [INFO ] Deduced a trap composed of 61 places in 286 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:23] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:23] [INFO ] Deduced a trap composed of 61 places in 376 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:24] [INFO ] Deduced a trap composed of 61 places in 356 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:24] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:24] [INFO ] Deduced a trap composed of 61 places in 338 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:25] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 68 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/909 variables, and 119 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/485 variables, 59/98 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:33] [INFO ] Deduced a trap composed of 82 places in 408 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:33] [INFO ] Deduced a trap composed of 82 places in 454 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:33] [INFO ] Deduced a trap composed of 82 places in 388 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:34] [INFO ] Deduced a trap composed of 80 places in 350 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:34] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:34] [INFO ] Deduced a trap composed of 80 places in 212 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:35] [INFO ] Deduced a trap composed of 80 places in 288 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:35] [INFO ] Deduced a trap composed of 80 places in 376 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:35] [INFO ] Deduced a trap composed of 80 places in 378 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:36] [INFO ] Deduced a trap composed of 75 places in 351 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:36] [INFO ] Deduced a trap composed of 80 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 09:24:37] [INFO ] Deduced a trap composed of 80 places in 351 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:37] [INFO ] Deduced a trap composed of 75 places in 318 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:37] [INFO ] Deduced a trap composed of 75 places in 320 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:38] [INFO ] Deduced a trap composed of 80 places in 306 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:38] [INFO ] Deduced a trap composed of 80 places in 368 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:38] [INFO ] Deduced a trap composed of 80 places in 309 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:39] [INFO ] Deduced a trap composed of 75 places in 309 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:39] [INFO ] Deduced a trap composed of 80 places in 373 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:39] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 66 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:40] [INFO ] Deduced a trap composed of 83 places in 371 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:41] [INFO ] Deduced a trap composed of 61 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 09:24:41] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:42] [INFO ] Deduced a trap composed of 61 places in 323 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:42] [INFO ] Deduced a trap composed of 61 places in 331 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:42] [INFO ] Deduced a trap composed of 61 places in 335 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:43] [INFO ] Deduced a trap composed of 61 places in 343 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:43] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:43] [INFO ] Deduced a trap composed of 61 places in 335 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:44] [INFO ] Deduced a trap composed of 80 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 09:24:44] [INFO ] Deduced a trap composed of 80 places in 338 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:45] [INFO ] Deduced a trap composed of 80 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 09:24:45] [INFO ] Deduced a trap composed of 80 places in 394 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:45] [INFO ] Deduced a trap composed of 61 places in 379 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:46] [INFO ] Deduced a trap composed of 80 places in 405 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:46] [INFO ] Deduced a trap composed of 80 places in 359 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:47] [INFO ] Deduced a trap composed of 80 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 09:24:47] [INFO ] Deduced a trap composed of 80 places in 362 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:47] [INFO ] Deduced a trap composed of 80 places in 363 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:48] [INFO ] Deduced a trap composed of 80 places in 363 ms of which 78 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:49] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:49] [INFO ] Deduced a trap composed of 82 places in 377 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:50] [INFO ] Deduced a trap composed of 82 places in 379 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:50] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:50] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:50] [INFO ] Deduced a trap composed of 61 places in 327 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:51] [INFO ] Deduced a trap composed of 61 places in 348 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:51] [INFO ] Deduced a trap composed of 62 places in 361 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:51] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:52] [INFO ] Deduced a trap composed of 62 places in 349 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:52] [INFO ] Deduced a trap composed of 62 places in 357 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:52] [INFO ] Deduced a trap composed of 62 places in 354 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:53] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:53] [INFO ] Deduced a trap composed of 62 places in 359 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:54] [INFO ] Deduced a trap composed of 81 places in 394 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:54] [INFO ] Deduced a trap composed of 81 places in 397 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:54] [INFO ] Deduced a trap composed of 81 places in 364 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:55] [INFO ] Deduced a trap composed of 81 places in 362 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:55] [INFO ] Deduced a trap composed of 81 places in 395 ms of which 86 ms to minimize.
SMT process timed out in 60428ms, After SMT, problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60431ms
Starting structural reductions in LTL mode, iteration 1 : 485/496 places, 424/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64496 ms. Remains : 485/496 places, 424/435 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-12
Product exploration explored 100000 steps with 817 reset in 385 ms.
Product exploration explored 100000 steps with 800 reset in 503 ms.
Computed a total of 205 stabilizing places and 177 stable transitions
Graph (complete) has 1103 edges and 485 vertex of which 484 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 205 stabilizing places and 177 stable transitions
Detected a total of 205/485 stabilizing places and 177/424 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 329 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (267 resets) in 576 ms. (69 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
[2025-05-30 09:24:57] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 212/357 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 119/476 variables, 37/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/479 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 420/899 variables, 479/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/899 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/908 variables, 5/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/908 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/909 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/909 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/909 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 584 constraints, problems are : Problem set: 0 solved, 4 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 9/9 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 09:24:59] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 212/357 variables, 50/60 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 09:24:59] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:24:59] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:00] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:00] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:00] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:00] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:01] [INFO ] Deduced a trap composed of 25 places in 316 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:01] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:01] [INFO ] Deduced a trap composed of 79 places in 277 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:01] [INFO ] Deduced a trap composed of 79 places in 259 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:02] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:02] [INFO ] Deduced a trap composed of 79 places in 262 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:02] [INFO ] Deduced a trap composed of 79 places in 269 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:03] [INFO ] Deduced a trap composed of 79 places in 301 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:03] [INFO ] Deduced a trap composed of 79 places in 283 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:03] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:03] [INFO ] Deduced a trap composed of 74 places in 233 ms of which 33 ms to minimize.
SMT process timed out in 6047ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 424/424 transitions.
Graph (trivial) has 221 edges and 485 vertex of which 6 / 485 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 1096 edges and 480 vertex of which 479 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 479 transition count 365
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 428 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 428 transition count 264
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 326 place count 307 transition count 264
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 588 place count 174 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 590 place count 173 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 592 place count 173 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 594 place count 171 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 595 place count 171 transition count 137
Applied a total of 595 rules in 75 ms. Remains 171 /485 variables (removed 314) and now considering 137/424 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 171/485 places, 137/424 transitions.
RANDOM walk for 40000 steps (1094 resets) in 473 ms. (84 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (527 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (491 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
// Phase 1: matrix 137 rows 171 cols
[2025-05-30 09:25:04] [INFO ] Computed 75 invariants in 2 ms
[2025-05-30 09:25:04] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/140 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/169 variables, 17/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 137/306 variables, 169/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 13/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/308 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/308 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 259 constraints, problems are : Problem set: 0 solved, 2 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 171/171 constraints, ReadFeed: 13/13 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 84/140 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:04] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:05] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:05] [INFO ] Deduced a trap composed of 26 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 09:25:05] [INFO ] Deduced a trap composed of 37 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 09:25:05] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/169 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:05] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 137/306 variables, 169/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 13/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:05] [INFO ] Deduced a trap along path composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:05] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Int declared 306/308 variables, and 269 constraints, problems are : Problem set: 2 solved, 0 unsolved in 1196 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 169/171 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1546ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p0 (NOT p1))), (G (OR (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 16 factoid took 556 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 485 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 : 485/485 places, 424/424 transitions.
Graph (trivial) has 221 edges and 485 vertex of which 6 / 485 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 1097 edges and 480 vertex of which 479 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 478 transition count 365
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 427 transition count 365
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 427 transition count 264
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 326 place count 306 transition count 264
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 586 place count 174 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 588 place count 173 transition count 140
Applied a total of 588 rules in 52 ms. Remains 173 /485 variables (removed 312) and now considering 140/424 (removed 284) transitions.
// Phase 1: matrix 140 rows 173 cols
[2025-05-30 09:25:06] [INFO ] Computed 75 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:25:07] [INFO ] Implicit Places using invariants in 409 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 410 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/485 places, 140/424 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 471 ms. Remains : 151/485 places, 140/424 transitions.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/151 stabilizing places and 25/140 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 187 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 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 8 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 219 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 35 steps with 6 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-12 finished in 76764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G((p1||X(X((p2 U p3))))))))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 488 transition count 427
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 488 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 487 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 487 transition count 426
Applied a total of 18 rules in 49 ms. Remains 487 /496 variables (removed 9) and now considering 426/435 (removed 9) transitions.
// Phase 1: matrix 426 rows 487 cols
[2025-05-30 09:25:08] [INFO ] Computed 99 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:25:08] [INFO ] Implicit Places using invariants in 702 ms returned []
[2025-05-30 09:25:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:25:10] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 2768 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-05-30 09:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:36] [INFO ] Deduced a trap composed of 62 places in 238 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:36] [INFO ] Deduced a trap composed of 62 places in 279 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:37] [INFO ] Deduced a trap composed of 62 places in 350 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:37] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:37] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:38] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:38] [INFO ] Deduced a trap composed of 62 places in 365 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:38] [INFO ] Deduced a trap composed of 62 places in 377 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:39] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:39] [INFO ] Deduced a trap composed of 83 places in 414 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:40] [INFO ] Deduced a trap composed of 83 places in 239 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:40] [INFO ] Deduced a trap composed of 83 places in 268 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:40] [INFO ] Deduced a trap composed of 83 places in 365 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:25:41] [INFO ] Deduced a trap composed of 83 places in 357 ms of which 73 ms to minimize.
SMT process timed out in 30276ms, After SMT, problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 30278ms
Starting structural reductions in LTL mode, iteration 1 : 487/496 places, 426/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33096 ms. Remains : 487/496 places, 426/435 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-13
Stuttering criterion allowed to conclude after 184 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-13 finished in 33403 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 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Graph (trivial) has 234 edges and 496 vertex of which 6 / 496 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 1114 edges and 491 vertex of which 490 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 489 transition count 371
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 433 transition count 371
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 114 place count 433 transition count 268
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 340 place count 310 transition count 268
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 350 place count 300 transition count 258
Iterating global reduction 2 with 10 rules applied. Total rules applied 360 place count 300 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 360 place count 300 transition count 257
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 362 place count 299 transition count 257
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 616 place count 170 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 618 place count 169 transition count 136
Applied a total of 618 rules in 64 ms. Remains 169 /496 variables (removed 327) and now considering 136/435 (removed 299) transitions.
// Phase 1: matrix 136 rows 169 cols
[2025-05-30 09:25:41] [INFO ] Computed 75 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:25:41] [INFO ] Implicit Places using invariants in 400 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 402 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/496 places, 136/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 473 ms. Remains : 147/496 places, 136/435 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-14 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(X((!p0 U (p1||G(!p0)))))))))'
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 435/435 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 487 transition count 426
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 487 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 486 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 486 transition count 425
Applied a total of 20 rules in 48 ms. Remains 486 /496 variables (removed 10) and now considering 425/435 (removed 10) transitions.
// Phase 1: matrix 425 rows 486 cols
[2025-05-30 09:25:42] [INFO ] Computed 99 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:25:42] [INFO ] Implicit Places using invariants in 570 ms returned []
[2025-05-30 09:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:25:45] [INFO ] Implicit Places using invariants and state equation in 2781 ms returned []
Implicit Place search using SMT with State Equation took 3356 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-05-30 09:25:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:10] [INFO ] Deduced a trap composed of 64 places in 403 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:11] [INFO ] Deduced a trap composed of 64 places in 340 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:11] [INFO ] Deduced a trap composed of 64 places in 395 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:12] [INFO ] Deduced a trap composed of 64 places in 388 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:12] [INFO ] Deduced a trap composed of 64 places in 387 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:12] [INFO ] Deduced a trap composed of 64 places in 381 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:13] [INFO ] Deduced a trap composed of 63 places in 381 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:13] [INFO ] Deduced a trap composed of 64 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 09:26:13] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:14] [INFO ] Deduced a trap composed of 64 places in 345 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:14] [INFO ] Deduced a trap composed of 84 places in 394 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:15] [INFO ] Deduced a trap composed of 84 places in 386 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:15] [INFO ] Deduced a trap composed of 84 places in 379 ms of which 85 ms to minimize.
SMT process timed out in 30149ms, After SMT, problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 30151ms
Starting structural reductions in LTL mode, iteration 1 : 486/496 places, 425/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33557 ms. Remains : 486/496 places, 425/435 transitions.
Stuttering acceptance computed with spot in 595 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-15
Product exploration explored 100000 steps with 20000 reset in 276 ms.
Product exploration explored 100000 steps with 20000 reset in 306 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1106 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (268 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (49 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (48 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 462689 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 3
Probabilistic random walk after 462689 steps, saw 77771 distinct states, run finished after 3012 ms. (steps per millisecond=153 ) properties seen :0
[2025-05-30 09:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/354 variables, 56/58 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 09:26:20] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:20] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:20] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:21] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:21] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:21] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:21] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 124/478 variables, 39/104 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 09:26:21] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:21] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/480 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 421/901 variables, 480/588 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 09:26:22] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:22] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:22] [INFO ] Deduced a trap composed of 36 places in 210 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:23] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:23] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:23] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:23] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:24] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 8/596 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 09:26:24] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 9/910 variables, 5/602 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 09:26:24] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:24] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:25] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 10 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/910 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/910 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 1/911 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/911 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/911 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 911/911 variables, and 606 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4978 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/354 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 124/478 variables, 39/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/480 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 421/901 variables, 480/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 3/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 1/600 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 09:26:25] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:26] [INFO ] Deduced a trap along path composed of 4 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:26] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:26] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 4/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/901 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 9/910 variables, 5/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/910 variables, 3/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/910 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 1/911 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/911 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/911 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 911/911 variables, and 613 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1810 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 6795ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1174 ms.
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 425/425 transitions.
Graph (trivial) has 223 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1099 edges and 481 vertex of which 480 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 480 transition count 367
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 430 transition count 367
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 430 transition count 263
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 306 transition count 263
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 596 place count 171 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 598 place count 170 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 170 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 602 place count 168 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 168 transition count 134
Applied a total of 603 rules in 39 ms. Remains 168 /486 variables (removed 318) and now considering 134/425 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 168/486 places, 134/425 transitions.
RANDOM walk for 40000 steps (1142 resets) in 223 ms. (178 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (770 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
// Phase 1: matrix 134 rows 168 cols
[2025-05-30 09:26:28] [INFO ] Computed 75 invariants in 1 ms
[2025-05-30 09:26:28] [INFO ] State equation strengthened by 12 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) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/145 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/166 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:28] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:28] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:28] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 134/300 variables, 166/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 12/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/302 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/302 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 168/168 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/145 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/166 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 134/300 variables, 166/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 12/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:29] [INFO ] Deduced a trap along path composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/302 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/302 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 168/168 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 786ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 204 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 425/425 transitions.
Applied a total of 0 rules in 9 ms. Remains 486 /486 variables (removed 0) and now considering 425/425 (removed 0) transitions.
// Phase 1: matrix 425 rows 486 cols
[2025-05-30 09:26:29] [INFO ] Computed 99 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:26:30] [INFO ] Implicit Places using invariants in 649 ms returned []
[2025-05-30 09:26:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 09:26:32] [INFO ] Implicit Places using invariants and state equation in 2312 ms returned []
Implicit Place search using SMT with State Equation took 2962 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-05-30 09:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:52] [INFO ] Deduced a trap composed of 64 places in 359 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:52] [INFO ] Deduced a trap composed of 64 places in 221 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:53] [INFO ] Deduced a trap composed of 64 places in 344 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:53] [INFO ] Deduced a trap composed of 64 places in 348 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:54] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:54] [INFO ] Deduced a trap composed of 64 places in 331 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:54] [INFO ] Deduced a trap composed of 63 places in 340 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:55] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:55] [INFO ] Deduced a trap composed of 64 places in 374 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:55] [INFO ] Deduced a trap composed of 64 places in 366 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:56] [INFO ] Deduced a trap composed of 84 places in 377 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:56] [INFO ] Deduced a trap composed of 84 places in 373 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:57] [INFO ] Deduced a trap composed of 84 places in 361 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:57] [INFO ] Deduced a trap composed of 84 places in 365 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:57] [INFO ] Deduced a trap composed of 84 places in 381 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:58] [INFO ] Deduced a trap composed of 84 places in 327 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:58] [INFO ] Deduced a trap composed of 84 places in 274 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:58] [INFO ] Deduced a trap composed of 84 places in 243 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:59] [INFO ] Deduced a trap composed of 84 places in 288 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:26:59] [INFO ] Deduced a trap composed of 84 places in 350 ms of which 83 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:00] [INFO ] Deduced a trap composed of 84 places in 269 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:00] [INFO ] Deduced a trap composed of 63 places in 359 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:01] [INFO ] Deduced a trap composed of 63 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 09:27:01] [INFO ] Deduced a trap composed of 64 places in 372 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:01] [INFO ] Deduced a trap composed of 63 places in 382 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:02] [INFO ] Deduced a trap composed of 63 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 09:27:02] [INFO ] Deduced a trap composed of 63 places in 371 ms of which 77 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/911 variables, and 126 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 27/126 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:11] [INFO ] Deduced a trap composed of 85 places in 368 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:11] [INFO ] Deduced a trap composed of 85 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 09:27:12] [INFO ] Deduced a trap composed of 84 places in 401 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:12] [INFO ] Deduced a trap composed of 84 places in 368 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:13] [INFO ] Deduced a trap composed of 84 places in 378 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:13] [INFO ] Deduced a trap composed of 85 places in 360 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:13] [INFO ] Deduced a trap composed of 85 places in 336 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:14] [INFO ] Deduced a trap composed of 85 places in 403 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:14] [INFO ] Deduced a trap composed of 85 places in 387 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:14] [INFO ] Deduced a trap composed of 85 places in 374 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:15] [INFO ] Deduced a trap composed of 85 places in 357 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:15] [INFO ] Deduced a trap composed of 85 places in 377 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:16] [INFO ] Deduced a trap composed of 85 places in 366 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:16] [INFO ] Deduced a trap composed of 85 places in 376 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:16] [INFO ] Deduced a trap composed of 85 places in 405 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:17] [INFO ] Deduced a trap composed of 85 places in 409 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:17] [INFO ] Deduced a trap composed of 85 places in 398 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:18] [INFO ] Deduced a trap composed of 85 places in 380 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:18] [INFO ] Deduced a trap composed of 85 places in 374 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:19] [INFO ] Deduced a trap composed of 80 places in 354 ms of which 78 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/146 constraints. Problems are: Problem set: 9 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:20] [INFO ] Deduced a trap composed of 84 places in 338 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:20] [INFO ] Deduced a trap composed of 84 places in 368 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:20] [INFO ] Deduced a trap composed of 84 places in 365 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:21] [INFO ] Deduced a trap composed of 84 places in 373 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:21] [INFO ] Deduced a trap composed of 84 places in 373 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:22] [INFO ] Deduced a trap composed of 20 places in 325 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:22] [INFO ] Deduced a trap composed of 82 places in 375 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:22] [INFO ] Deduced a trap composed of 77 places in 356 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:23] [INFO ] Deduced a trap composed of 77 places in 331 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:23] [INFO ] Deduced a trap composed of 82 places in 367 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:23] [INFO ] Deduced a trap composed of 82 places in 371 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:24] [INFO ] Deduced a trap composed of 82 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 09:27:24] [INFO ] Deduced a trap composed of 77 places in 346 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:25] [INFO ] Deduced a trap composed of 77 places in 388 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:25] [INFO ] Deduced a trap composed of 82 places in 380 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:25] [INFO ] Deduced a trap composed of 82 places in 383 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:26] [INFO ] Deduced a trap composed of 82 places in 420 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:26] [INFO ] Deduced a trap composed of 82 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 09:27:27] [INFO ] Deduced a trap composed of 82 places in 342 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:27] [INFO ] Deduced a trap composed of 82 places in 334 ms of which 60 ms to minimize.
Problem TDEAD365 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/166 constraints. Problems are: Problem set: 10 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:28] [INFO ] Deduced a trap composed of 84 places in 401 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:28] [INFO ] Deduced a trap composed of 84 places in 375 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:29] [INFO ] Deduced a trap composed of 84 places in 361 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:29] [INFO ] Deduced a trap composed of 84 places in 353 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:30] [INFO ] Deduced a trap composed of 84 places in 377 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:30] [INFO ] Deduced a trap composed of 84 places in 400 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:30] [INFO ] Deduced a trap composed of 84 places in 383 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:31] [INFO ] Deduced a trap composed of 84 places in 382 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:31] [INFO ] Deduced a trap composed of 84 places in 344 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:32] [INFO ] Deduced a trap composed of 84 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 09:27:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:32] [INFO ] Deduced a trap composed of 82 places in 397 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:33] [INFO ] Deduced a trap composed of 77 places in 424 ms of which 117 ms to minimize.
SMT process timed out in 60387ms, After SMT, problems are : Problem set: 10 solved, 414 unsolved
Search for dead transitions found 10 dead transitions in 60390ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 486/486 places, 415/425 transitions.
Applied a total of 0 rules in 16 ms. Remains 486 /486 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63380 ms. Remains : 486/486 places, 415/425 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1086 edges and 486 vertex of which 485 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (267 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (49 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 406931 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 3
Probabilistic random walk after 406931 steps, saw 70117 distinct states, run finished after 3003 ms. (steps per millisecond=135 ) properties seen :0
// Phase 1: matrix 415 rows 486 cols
[2025-05-30 09:27:36] [INFO ] Computed 99 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 248/379 variables, 56/60 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 09:27:37] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:37] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:37] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:37] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:38] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:38] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:38] [INFO ] Deduced a trap composed of 81 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:38] [INFO ] Deduced a trap composed of 81 places in 210 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:39] [INFO ] Deduced a trap composed of 81 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 09:27:39] [INFO ] Deduced a trap composed of 81 places in 289 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:39] [INFO ] Deduced a trap composed of 81 places in 270 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:40] [INFO ] Deduced a trap composed of 81 places in 270 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:40] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:40] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:40] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:41] [INFO ] Deduced a trap composed of 81 places in 242 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:41] [INFO ] Deduced a trap composed of 81 places in 244 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:41] [INFO ] Deduced a trap composed of 81 places in 258 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:42] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 50 ms to minimize.
SMT process timed out in 5086ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 415/415 transitions.
Graph (trivial) has 223 edges and 486 vertex of which 6 / 486 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 1079 edges and 481 vertex of which 480 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 480 transition count 357
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 430 transition count 357
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 430 transition count 253
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 306 transition count 253
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 596 place count 171 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 598 place count 170 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 170 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 602 place count 168 transition count 124
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 603 place count 168 transition count 124
Applied a total of 603 rules in 56 ms. Remains 168 /486 variables (removed 318) and now considering 124/415 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 168/486 places, 124/415 transitions.
RANDOM walk for 40000 steps (1199 resets) in 341 ms. (116 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (763 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
// Phase 1: matrix 124 rows 168 cols
[2025-05-30 09:27:42] [INFO ] Computed 75 invariants in 4 ms
[2025-05-30 09:27:42] [INFO ] State equation strengthened by 12 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, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/144 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/166 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:42] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:42] [INFO ] Deduced a trap composed of 38 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 09:27:42] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 124/290 variables, 166/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 12/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/292 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/292 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 168/168 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 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, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/144 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/166 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 124/290 variables, 166/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 12/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:27:43] [INFO ] Deduced a trap along path composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/292 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/292 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/292 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 168/168 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1032ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 213 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 244 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 269 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 197 ms.
Product exploration explored 100000 steps with 20000 reset in 214 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 266 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 415/415 transitions.
Graph (trivial) has 223 edges and 486 vertex of which 6 / 486 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 1080 edges and 481 vertex of which 480 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 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 480 transition count 408
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 52 place count 480 transition count 463
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 126 place count 480 transition count 463
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 143 place count 463 transition count 430
Deduced a syphon composed of 107 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 160 place count 463 transition count 430
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 267 places in 1 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 320 place count 463 transition count 430
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 358 place count 425 transition count 392
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 396 place count 425 transition count 392
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 396 rules in 132 ms. Remains 425 /486 variables (removed 61) and now considering 392/415 (removed 23) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 09:27:45] [INFO ] Redundant transitions in 46 ms returned []
Running 391 sub problems to find dead transitions.
// Phase 1: matrix 392 rows 425 cols
[2025-05-30 09:27:45] [INFO ] Computed 99 invariants in 11 ms
[2025-05-30 09:27:45] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/425 variables, 57/96 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:07] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:07] [INFO ] Deduced a trap composed of 38 places in 390 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:08] [INFO ] Deduced a trap composed of 38 places in 350 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:08] [INFO ] Deduced a trap composed of 38 places in 337 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:08] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:09] [INFO ] Deduced a trap composed of 30 places in 359 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:09] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:09] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:10] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:10] [INFO ] Deduced a trap composed of 41 places in 314 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:10] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:11] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:11] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:11] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:12] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:12] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:12] [INFO ] Deduced a trap composed of 41 places in 333 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:13] [INFO ] Deduced a trap composed of 42 places in 340 ms of which 35 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:13] [INFO ] Deduced a trap composed of 3 places in 292 ms of which 10 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:13] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 11 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 TDEAD9 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 20/119 constraints. Problems are: Problem set: 82 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:14] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 19 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:15] [INFO ] Deduced a trap composed of 3 places in 332 ms of which 18 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:15] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 17 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 09:28:15] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 15 ms to minimize.
SMT process timed out in 30334ms, After SMT, problems are : Problem set: 85 solved, 306 unsolved
Search for dead transitions found 85 dead transitions in 30337ms
Found 85 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 85 transitions
Dead transitions reduction (with SMT) removed 85 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 425/486 places, 307/415 transitions.
Graph (complete) has 1790 edges and 425 vertex of which 376 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 0 output transitions
Ensure Unique test removed 5 places
Deduced a syphon composed of 180 places in 1 ms
Applied a total of 1 rules in 14 ms. Remains 371 /425 variables (removed 54) and now considering 307/307 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 371/486 places, 307/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30542 ms. Remains : 371/486 places, 307/415 transitions.
Built C files in :
/tmp/ltsmin7462971620195606216
[2025-05-30 09:28:15] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7462971620195606216
Running compilation step : cd /tmp/ltsmin7462971620195606216;'/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 1472 ms.
Running link step : cd /tmp/ltsmin7462971620195606216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin7462971620195606216;'/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/stateBased9173134927880937467.hoa' '--buchi-type=spotba'
LTSmin run took 531 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-15-LTLFireability-15 finished in 156077 ms.
All properties solved by simple procedures.
Total runtime 484710 ms.
BK_STOP 1748597298133
--------------------
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-15"
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-15, 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-174853813300116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 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 ;