Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 156K 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-14-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748591135330

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 07:45:38] [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 07:45:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 07:45:38] [INFO ] Load time of PNML (sax parser for PT used): 426 ms
[2025-05-30 07:45:38] [INFO ] Transformed 624 places.
[2025-05-30 07:45:38] [INFO ] Transformed 564 transitions.
[2025-05-30 07:45:38] [INFO ] Found NUPN structural information;
[2025-05-30 07:45:38] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 687 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 2 formulas.
Deduced a syphon composed of 8 places in 23 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 93 place count 523 transition count 468
Iterating global reduction 1 with 88 rules applied. Total rules applied 181 place count 523 transition count 468
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 225 place count 479 transition count 424
Iterating global reduction 1 with 44 rules applied. Total rules applied 269 place count 479 transition count 424
Applied a total of 269 rules in 291 ms. Remains 479 /616 variables (removed 137) and now considering 424/556 (removed 132) transitions.
// Phase 1: matrix 424 rows 479 cols
[2025-05-30 07:45:39] [INFO ] Computed 94 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:45:40] [INFO ] Implicit Places using invariants in 1322 ms returned []
[2025-05-30 07:45:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:45:43] [INFO ] Implicit Places using invariants and state equation in 2671 ms returned []
Implicit Place search using SMT with State Equation took 4069 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2025-05-30 07:45:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/479 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 2/94 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 07:46:08] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:09] [INFO ] Deduced a trap composed of 78 places in 385 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:09] [INFO ] Deduced a trap composed of 74 places in 395 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:09] [INFO ] Deduced a trap composed of 74 places in 408 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:10] [INFO ] Deduced a trap composed of 72 places in 427 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:10] [INFO ] Deduced a trap composed of 72 places in 398 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:11] [INFO ] Deduced a trap composed of 72 places in 366 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:11] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:11] [INFO ] Deduced a trap composed of 33 places in 277 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:12] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:12] [INFO ] Deduced a trap composed of 36 places in 329 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:13] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:13] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:13] [INFO ] Deduced a trap composed of 36 places in 341 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:14] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 74 ms to minimize.
SMT process timed out in 30607ms, After SMT, problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 30637ms
Starting structural reductions in LTL mode, iteration 1 : 479/616 places, 424/556 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35043 ms. Remains : 479/616 places, 424/556 transitions.
Support contains 43 out of 479 places after structural reductions.
[2025-05-30 07:46:14] [INFO ] Flatten gal took : 140 ms
[2025-05-30 07:46:14] [INFO ] Flatten gal took : 69 ms
[2025-05-30 07:46:15] [INFO ] Input system was already deterministic with 424 transitions.
Support contains 41 out of 479 places (down from 43) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (270 resets) in 3224 ms. (12 steps per ms) remains 23/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
[2025-05-30 07:46:16] [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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 154/185 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 176/361 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 107/468 variables, 37/92 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:17] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:17] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:17] [INFO ] Deduced a trap composed of 13 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 07:46:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:17] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:17] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 58 ms to minimize.
Problem AtomicPropp4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:18] [INFO ] Deduced a trap composed of 38 places in 389 ms of which 63 ms to minimize.
Problem AtomicPropp7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:18] [INFO ] Deduced a trap composed of 37 places in 398 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:18] [INFO ] Deduced a trap composed of 71 places in 399 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:19] [INFO ] Deduced a trap composed of 71 places in 406 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:19] [INFO ] Deduced a trap composed of 72 places in 405 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:20] [INFO ] Deduced a trap composed of 72 places in 388 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:20] [INFO ] Deduced a trap composed of 73 places in 410 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:21] [INFO ] Deduced a trap composed of 73 places in 422 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:21] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 66 ms to minimize.
SMT process timed out in 5265ms, After SMT, problems are : Problem set: 2 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 199 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1083 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 473 transition count 373
Reduce places removed 43 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 430 transition count 369
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 426 transition count 369
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 96 place count 426 transition count 282
Deduced a syphon composed of 87 places in 10 ms
Ensure Unique test removed 11 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 281 place count 328 transition count 282
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 284 place count 325 transition count 279
Iterating global reduction 3 with 3 rules applied. Total rules applied 287 place count 325 transition count 279
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 531 place count 201 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 533 place count 200 transition count 163
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 535 place count 200 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 537 place count 198 transition count 161
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 542 place count 198 transition count 161
Applied a total of 542 rules in 282 ms. Remains 198 /479 variables (removed 281) and now considering 161/424 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 283 ms. Remains : 198/479 places, 161/424 transitions.
RANDOM walk for 40000 steps (1184 resets) in 1599 ms. (25 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40002 steps (532 resets) in 404 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (519 resets) in 302 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (513 resets) in 243 ms. (163 steps per ms) remains 3/3 properties
// Phase 1: matrix 161 rows 198 cols
[2025-05-30 07:46:22] [INFO ] Computed 79 invariants in 9 ms
[2025-05-30 07:46:22] [INFO ] State equation strengthened by 12 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 135/150 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 43/193 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/195 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 161/356 variables, 195/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 12/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/356 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/359 variables, 3/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/359 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/359 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 289 constraints, problems are : Problem set: 0 solved, 3 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 135/150 variables, 52/55 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 07:46:23] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:23] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:23] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:23] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:23] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:23] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 43/193 variables, 22/83 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 07:46:24] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 19 ms to minimize.
Problem AtomicPropp30 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 1/84 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/195 variables, 2/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 161/356 variables, 195/281 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/356 variables, 12/293 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/356 variables, 1/294 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:24] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 5 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 1/295 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:24] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/356 variables, 1/296 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/296 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/359 variables, 3/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/359 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/359 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 299 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/198 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2228ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 38 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-14-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 130 stabilizing places and 123 stable transitions
Graph (complete) has 1090 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 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)&&(X((p1||X(X(F(!p1))))) U ((p2&&X((p1||X(X(F(!p1))))))||X(G((p1||X(X(F(!p1)))))))))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 471 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 471 transition count 416
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 468 transition count 413
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 468 transition count 413
Applied a total of 22 rules in 61 ms. Remains 468 /479 variables (removed 11) and now considering 413/424 (removed 11) transitions.
// Phase 1: matrix 413 rows 468 cols
[2025-05-30 07:46:25] [INFO ] Computed 94 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:46:26] [INFO ] Implicit Places using invariants in 651 ms returned []
[2025-05-30 07:46:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:46:28] [INFO ] Implicit Places using invariants and state equation in 2721 ms returned []
Implicit Place search using SMT with State Equation took 3380 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2025-05-30 07:46:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:52] [INFO ] Deduced a trap composed of 81 places in 399 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:52] [INFO ] Deduced a trap composed of 81 places in 378 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:53] [INFO ] Deduced a trap composed of 81 places in 362 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:53] [INFO ] Deduced a trap composed of 81 places in 337 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:54] [INFO ] Deduced a trap composed of 81 places in 345 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:54] [INFO ] Deduced a trap composed of 80 places in 364 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:54] [INFO ] Deduced a trap composed of 80 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 07:46:55] [INFO ] Deduced a trap composed of 80 places in 406 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:55] [INFO ] Deduced a trap composed of 80 places in 362 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:56] [INFO ] Deduced a trap composed of 80 places in 372 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:56] [INFO ] Deduced a trap composed of 80 places in 374 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:56] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:57] [INFO ] Deduced a trap composed of 78 places in 507 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:57] [INFO ] Deduced a trap composed of 74 places in 397 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:58] [INFO ] Deduced a trap composed of 78 places in 426 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:58] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:58] [INFO ] Deduced a trap composed of 75 places in 372 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:46:59] [INFO ] Deduced a trap composed of 79 places in 479 ms of which 199 ms to minimize.
SMT process timed out in 30308ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30312ms
Starting structural reductions in LTL mode, iteration 1 : 468/479 places, 413/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33756 ms. Remains : 468/479 places, 413/424 transitions.
Stuttering acceptance computed with spot in 639 ms :[(NOT p0), (NOT p0), false, false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Computed a total of 124 stabilizing places and 117 stable transitions
Graph (complete) has 1069 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 124 stabilizing places and 117 stable transitions
Detected a total of 124/468 stabilizing places and 117/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X p0)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-00 finished in 35501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 222 edges and 479 vertex of which 4 / 479 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1087 edges and 476 vertex of which 475 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 474 transition count 367
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 422 transition count 367
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 106 place count 422 transition count 268
Deduced a syphon composed of 99 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 321 place count 306 transition count 268
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 330 place count 297 transition count 259
Iterating global reduction 2 with 9 rules applied. Total rules applied 339 place count 297 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 339 place count 297 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 341 place count 296 transition count 258
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 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 592 place count 168 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 594 place count 167 transition count 139
Applied a total of 594 rules in 81 ms. Remains 167 /479 variables (removed 312) and now considering 139/424 (removed 285) transitions.
// Phase 1: matrix 139 rows 167 cols
[2025-05-30 07:47:01] [INFO ] Computed 72 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:01] [INFO ] Implicit Places using invariants in 309 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 311 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/479 places, 139/424 transitions.
Applied a total of 0 rules in 15 ms. Remains 147 /147 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 408 ms. Remains : 147/479 places, 139/424 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-01 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||(p1&&X(F(p2))))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 469 transition count 414
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 469 transition count 414
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 466 transition count 411
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 466 transition count 411
Applied a total of 26 rules in 67 ms. Remains 466 /479 variables (removed 13) and now considering 411/424 (removed 13) transitions.
// Phase 1: matrix 411 rows 466 cols
[2025-05-30 07:47:01] [INFO ] Computed 94 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:02] [INFO ] Implicit Places using invariants in 608 ms returned []
[2025-05-30 07:47:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:03] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2455 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2025-05-30 07:47: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/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:25] [INFO ] Deduced a trap composed of 77 places in 377 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:25] [INFO ] Deduced a trap composed of 77 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 07:47:25] [INFO ] Deduced a trap composed of 77 places in 223 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:26] [INFO ] Deduced a trap composed of 72 places in 238 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:26] [INFO ] Deduced a trap composed of 77 places in 245 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:26] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:26] [INFO ] Deduced a trap composed of 79 places in 227 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:27] [INFO ] Deduced a trap composed of 79 places in 230 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:27] [INFO ] Deduced a trap composed of 79 places in 228 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:27] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:27] [INFO ] Deduced a trap composed of 79 places in 214 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:27] [INFO ] Deduced a trap composed of 79 places in 229 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:28] [INFO ] Deduced a trap composed of 79 places in 217 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:28] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:28] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:28] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:29] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:29] [INFO ] Deduced a trap composed of 79 places in 236 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:29] [INFO ] Deduced a trap composed of 79 places in 250 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:29] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 50 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:30] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:30] [INFO ] Deduced a trap composed of 79 places in 243 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:31] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:31] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:31] [INFO ] Deduced a trap composed of 79 places in 217 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:31] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:32] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:32] [INFO ] Deduced a trap composed of 79 places in 248 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:32] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:32] [INFO ] Deduced a trap composed of 79 places in 230 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:33] [INFO ] Deduced a trap composed of 76 places in 308 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:33] [INFO ] Deduced a trap composed of 76 places in 343 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:47:34] [INFO ] Deduced a trap composed of 73 places in 371 ms of which 78 ms to minimize.
SMT process timed out in 30345ms, After SMT, problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 30348ms
Starting structural reductions in LTL mode, iteration 1 : 466/479 places, 411/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32874 ms. Remains : 466/479 places, 411/424 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 20000 reset in 188 ms.
Product exploration explored 100000 steps with 20000 reset in 177 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 40000 steps (269 resets) in 644 ms. (62 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (48 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (47 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (44 resets) in 265 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (48 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (48 resets) in 214 ms. (186 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 2154 steps, run visited all 5 properties in 109 ms. (steps per millisecond=19 )
Probabilistic random walk after 2154 steps, saw 1939 distinct states, run finished after 116 ms. (steps per millisecond=18 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 270 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 411/411 transitions.
Applied a total of 0 rules in 18 ms. Remains 466 /466 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2025-05-30 07:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:37] [INFO ] Implicit Places using invariants in 689 ms returned []
[2025-05-30 07:47:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:39] [INFO ] Implicit Places using invariants and state equation in 2228 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2025-05-30 07:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:05] [INFO ] Deduced a trap composed of 77 places in 597 ms of which 297 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:06] [INFO ] Deduced a trap composed of 77 places in 366 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:06] [INFO ] Deduced a trap composed of 77 places in 394 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:06] [INFO ] Deduced a trap composed of 72 places in 387 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:07] [INFO ] Deduced a trap composed of 77 places in 383 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:07] [INFO ] Deduced a trap composed of 79 places in 329 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:08] [INFO ] Deduced a trap composed of 79 places in 330 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:08] [INFO ] Deduced a trap composed of 79 places in 236 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:08] [INFO ] Deduced a trap composed of 79 places in 241 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:08] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:09] [INFO ] Deduced a trap composed of 79 places in 213 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:09] [INFO ] Deduced a trap composed of 79 places in 228 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:09] [INFO ] Deduced a trap composed of 79 places in 209 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:09] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:09] [INFO ] Deduced a trap composed of 79 places in 208 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:10] [INFO ] Deduced a trap composed of 79 places in 215 ms of which 52 ms to minimize.
SMT process timed out in 30290ms, After SMT, problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 30293ms
Finished structural reductions in LTL mode , in 1 iterations and 33234 ms. Remains : 466/466 places, 411/411 transitions.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 40000 steps (272 resets) in 372 ms. (107 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (47 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2025-05-30 07:48:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 264/366 variables, 56/59 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 07:48:10] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:11] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:11] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:11] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:11] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:11] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:12] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:12] [INFO ] Deduced a trap composed of 69 places in 170 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:12] [INFO ] Deduced a trap composed of 69 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:12] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:12] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:12] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:13] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:13] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:13] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:13] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:13] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:13] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:14] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:14] [INFO ] Deduced a trap composed of 72 places in 163 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 20/79 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 07:48:14] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:14] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:14] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:14] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:15] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:15] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:15] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:15] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:15] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 28 ms to minimize.
SMT process timed out in 5166ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 411/411 transitions.
Graph (trivial) has 213 edges and 466 vertex of which 6 / 466 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 1060 edges and 461 vertex of which 460 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 460 transition count 356
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 413 transition count 356
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 96 place count 413 transition count 257
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 311 place count 297 transition count 257
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 259 rules applied. Total rules applied 570 place count 165 transition count 130
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 572 place count 164 transition count 134
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 164 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 576 place count 162 transition count 132
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 577 place count 162 transition count 132
Applied a total of 577 rules in 54 ms. Remains 162 /466 variables (removed 304) and now considering 132/411 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 162/466 places, 132/411 transitions.
RANDOM walk for 1541 steps (68 resets) in 13 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2)]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 196 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 20000 reset in 126 ms.
Product exploration explored 100000 steps with 20000 reset in 136 ms.
Applying partial POR strategy [false, true, false, false, true, false]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 466 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 466/466 places, 411/411 transitions.
Graph (trivial) has 209 edges and 466 vertex of which 6 / 466 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 1061 edges and 461 vertex of which 460 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 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 460 transition count 404
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 69 Pre rules applied. Total rules applied 47 place count 460 transition count 454
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 116 place count 460 transition count 454
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 130 place count 446 transition count 428
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 144 place count 446 transition count 428
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 254 places in 1 ms
Iterating global reduction 1 with 154 rules applied. Total rules applied 298 place count 446 transition count 428
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 335 place count 409 transition count 391
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 372 place count 409 transition count 391
Deduced a syphon composed of 217 places in 1 ms
Applied a total of 372 rules in 90 ms. Remains 409 /466 variables (removed 57) and now considering 391/411 (removed 20) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:48:17] [INFO ] Redundant transitions in 32 ms returned []
Running 390 sub problems to find dead transitions.
// Phase 1: matrix 391 rows 409 cols
[2025-05-30 07:48:17] [INFO ] Computed 94 invariants in 8 ms
[2025-05-30 07:48:17] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/409 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:34] [INFO ] Deduced a trap composed of 26 places in 364 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:34] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:35] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:35] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:35] [INFO ] Deduced a trap composed of 27 places in 317 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:36] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:36] [INFO ] Deduced a trap composed of 27 places in 314 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:36] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:37] [INFO ] Deduced a trap composed of 27 places in 318 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:37] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:37] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:38] [INFO ] Deduced a trap composed of 27 places in 310 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:38] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:38] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:38] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:39] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:39] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 10 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:39] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:39] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 16 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:40] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 15 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 20/114 constraints. Problems are: Problem set: 29 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:40] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:41] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:41] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:41] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:42] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:42] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:42] [INFO ] Deduced a trap composed of 3 places in 256 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:42] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 9 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:43] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 12 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:43] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 17 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:44] [INFO ] Deduced a trap composed of 3 places in 347 ms of which 17 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:44] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:44] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 17 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:44] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 11 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:45] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 14 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:45] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:45] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 5 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 20/134 constraints. Problems are: Problem set: 89 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:46] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:46] [INFO ] Deduced a trap composed of 3 places in 353 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:46] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 17 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:48:47] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
SMT process timed out in 30229ms, After SMT, problems are : Problem set: 106 solved, 284 unsolved
Search for dead transitions found 106 dead transitions in 30230ms
Found 106 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 106 transitions
Dead transitions reduction (with SMT) removed 106 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 409/466 places, 285/411 transitions.
Graph (complete) has 1211 edges and 409 vertex of which 313 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.2 ms
Discarding 96 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 311 transition count 291
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 311 transition count 291
Deduced a syphon composed of 121 places in 0 ms
Applied a total of 4 rules in 44 ms. Remains 311 /409 variables (removed 98) and now considering 291/285 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 311/466 places, 291/411 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30408 ms. Remains : 311/466 places, 291/411 transitions.
Built C files in :
/tmp/ltsmin7571863562854631654
[2025-05-30 07:48:47] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7571863562854631654
Running compilation step : cd /tmp/ltsmin7571863562854631654;'/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 1479 ms.
Running link step : cd /tmp/ltsmin7571863562854631654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin7571863562854631654;'/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/stateBased10421871339157843389.hoa' '--buchi-type=spotba'
LTSmin run took 182 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLFireability-03 finished in 108222 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(p1)&&F(p2))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 223 edges and 479 vertex of which 6 / 479 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 1084 edges and 474 vertex of which 473 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 472 transition count 364
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 420 transition count 364
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 106 place count 420 transition count 266
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 318 place count 306 transition count 266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 326 place count 298 transition count 258
Iterating global reduction 2 with 8 rules applied. Total rules applied 334 place count 298 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 334 place count 298 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 336 place count 297 transition count 257
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 587 place count 169 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 589 place count 168 transition count 138
Applied a total of 589 rules in 83 ms. Remains 168 /479 variables (removed 311) and now considering 138/424 (removed 286) transitions.
// Phase 1: matrix 138 rows 168 cols
[2025-05-30 07:48:49] [INFO ] Computed 73 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:50] [INFO ] Implicit Places using invariants in 290 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 292 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/479 places, 138/424 transitions.
Applied a total of 0 rules in 14 ms. Remains 147 /147 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 395 ms. Remains : 147/479 places, 138/424 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-04
Stuttering criterion allowed to conclude after 18 steps with 3 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-04 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G((F(p0) U p1))) U !p1)&&(X(p2) U ((p2&&X(p2))||X(G(p2))))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 470 transition count 415
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 468 transition count 413
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 468 transition count 413
Applied a total of 22 rules in 69 ms. Remains 468 /479 variables (removed 11) and now considering 413/424 (removed 11) transitions.
// Phase 1: matrix 413 rows 468 cols
[2025-05-30 07:48:50] [INFO ] Computed 94 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:50] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-05-30 07:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:52] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2025-05-30 07:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:16] [INFO ] Deduced a trap composed of 77 places in 378 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:17] [INFO ] Deduced a trap composed of 77 places in 354 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:17] [INFO ] Deduced a trap composed of 79 places in 336 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:17] [INFO ] Deduced a trap composed of 79 places in 346 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:18] [INFO ] Deduced a trap composed of 79 places in 337 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:18] [INFO ] Deduced a trap composed of 79 places in 360 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:19] [INFO ] Deduced a trap composed of 79 places in 472 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:19] [INFO ] Deduced a trap composed of 79 places in 375 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:19] [INFO ] Deduced a trap composed of 79 places in 325 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:20] [INFO ] Deduced a trap composed of 79 places in 384 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:20] [INFO ] Deduced a trap composed of 79 places in 372 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:21] [INFO ] Deduced a trap composed of 79 places in 369 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:21] [INFO ] Deduced a trap composed of 79 places in 352 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:21] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:22] [INFO ] Deduced a trap composed of 79 places in 371 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:22] [INFO ] Deduced a trap composed of 79 places in 369 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:23] [INFO ] Deduced a trap composed of 79 places in 337 ms of which 67 ms to minimize.
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 30187ms
Starting structural reductions in LTL mode, iteration 1 : 468/479 places, 413/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32896 ms. Remains : 468/479 places, 413/424 transitions.
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p2) p1), (NOT p1), p1, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1071 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Detected a total of 123/468 stabilizing places and 116/413 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 23 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-06 finished in 33880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 223 edges and 479 vertex of which 6 / 479 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 1084 edges and 474 vertex of which 473 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 472 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 421 transition count 365
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 104 place count 421 transition count 266
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 318 place count 306 transition count 266
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 328 place count 296 transition count 256
Iterating global reduction 2 with 10 rules applied. Total rules applied 338 place count 296 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 296 transition count 255
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 340 place count 295 transition count 255
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 585 place count 170 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 587 place count 169 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 588 place count 168 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 589 place count 167 transition count 138
Applied a total of 589 rules in 85 ms. Remains 167 /479 variables (removed 312) and now considering 138/424 (removed 286) transitions.
// Phase 1: matrix 138 rows 167 cols
[2025-05-30 07:49:24] [INFO ] Computed 72 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:49:24] [INFO ] Implicit Places using invariants in 311 ms returned [16, 22, 23, 24, 25, 26, 27, 50, 51, 52, 53]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 313 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/479 places, 138/424 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 409 ms. Remains : 156/479 places, 138/424 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-07 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 470 transition count 415
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 467 transition count 412
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 467 transition count 412
Applied a total of 24 rules in 60 ms. Remains 467 /479 variables (removed 12) and now considering 412/424 (removed 12) transitions.
// Phase 1: matrix 412 rows 467 cols
[2025-05-30 07:49:24] [INFO ] Computed 94 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:49:25] [INFO ] Implicit Places using invariants in 670 ms returned []
[2025-05-30 07:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:49:27] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2025-05-30 07:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:50] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:51] [INFO ] Deduced a trap composed of 77 places in 452 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:51] [INFO ] Deduced a trap composed of 77 places in 399 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:52] [INFO ] Deduced a trap composed of 77 places in 381 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:52] [INFO ] Deduced a trap composed of 77 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 07:49:53] [INFO ] Deduced a trap composed of 77 places in 394 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:53] [INFO ] Deduced a trap composed of 77 places in 411 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:53] [INFO ] Deduced a trap composed of 79 places in 370 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:54] [INFO ] Deduced a trap composed of 79 places in 334 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:54] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:55] [INFO ] Deduced a trap composed of 79 places in 376 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:55] [INFO ] Deduced a trap composed of 79 places in 494 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:56] [INFO ] Deduced a trap composed of 79 places in 369 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:56] [INFO ] Deduced a trap composed of 80 places in 379 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:56] [INFO ] Deduced a trap composed of 80 places in 379 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:57] [INFO ] Deduced a trap composed of 80 places in 317 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:49:57] [INFO ] Deduced a trap composed of 80 places in 349 ms of which 78 ms to minimize.
SMT process timed out in 30136ms, After SMT, problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 30137ms
Starting structural reductions in LTL mode, iteration 1 : 467/479 places, 412/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33056 ms. Remains : 467/479 places, 412/424 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-09
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-09 finished in 33241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U X(X(X(G(!p0)))))&&X(F(p1))))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 470 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 470 transition count 415
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 467 transition count 412
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 467 transition count 412
Applied a total of 24 rules in 60 ms. Remains 467 /479 variables (removed 12) and now considering 412/424 (removed 12) transitions.
// Phase 1: matrix 412 rows 467 cols
[2025-05-30 07:49:57] [INFO ] Computed 94 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:49:58] [INFO ] Implicit Places using invariants in 664 ms returned []
[2025-05-30 07:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:50:01] [INFO ] Implicit Places using invariants and state equation in 2616 ms returned []
Implicit Place search using SMT with State Equation took 3283 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2025-05-30 07:50:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:27] [INFO ] Deduced a trap composed of 77 places in 431 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:27] [INFO ] Deduced a trap composed of 77 places in 391 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:27] [INFO ] Deduced a trap composed of 77 places in 386 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:28] [INFO ] Deduced a trap composed of 77 places in 485 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:28] [INFO ] Deduced a trap composed of 77 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 07:50:29] [INFO ] Deduced a trap composed of 77 places in 390 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:29] [INFO ] Deduced a trap composed of 79 places in 363 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:29] [INFO ] Deduced a trap composed of 79 places in 323 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:30] [INFO ] Deduced a trap composed of 79 places in 372 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:30] [INFO ] Deduced a trap composed of 79 places in 394 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:31] [INFO ] Deduced a trap composed of 79 places in 293 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:50:31] [INFO ] Deduced a trap composed of 79 places in 402 ms of which 120 ms to minimize.
SMT process timed out in 30188ms, After SMT, problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 30190ms
Starting structural reductions in LTL mode, iteration 1 : 467/479 places, 412/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33536 ms. Remains : 467/479 places, 412/424 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), p0, p0, true, p0]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-10
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-10 finished in 33997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 469 transition count 414
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 469 transition count 414
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 466 transition count 411
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 466 transition count 411
Applied a total of 26 rules in 58 ms. Remains 466 /479 variables (removed 13) and now considering 411/424 (removed 13) transitions.
// Phase 1: matrix 411 rows 466 cols
[2025-05-30 07:50:31] [INFO ] Computed 94 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:50:32] [INFO ] Implicit Places using invariants in 640 ms returned []
[2025-05-30 07:50:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:50:34] [INFO ] Implicit Places using invariants and state equation in 2154 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2025-05-30 07:50:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:00] [INFO ] Deduced a trap composed of 77 places in 612 ms of which 305 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:00] [INFO ] Deduced a trap composed of 77 places in 341 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:00] [INFO ] Deduced a trap composed of 77 places in 384 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:01] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:01] [INFO ] Deduced a trap composed of 77 places in 384 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:02] [INFO ] Deduced a trap composed of 79 places in 336 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:02] [INFO ] Deduced a trap composed of 79 places in 366 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:02] [INFO ] Deduced a trap composed of 79 places in 320 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:03] [INFO ] Deduced a trap composed of 79 places in 348 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:03] [INFO ] Deduced a trap composed of 79 places in 313 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:03] [INFO ] Deduced a trap composed of 79 places in 320 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:04] [INFO ] Deduced a trap composed of 79 places in 343 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:04] [INFO ] Deduced a trap composed of 79 places in 336 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:04] [INFO ] Deduced a trap composed of 79 places in 325 ms of which 71 ms to minimize.
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 30188ms
Starting structural reductions in LTL mode, iteration 1 : 466/479 places, 411/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33046 ms. Remains : 466/479 places, 411/424 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-11
Product exploration explored 100000 steps with 1661 reset in 416 ms.
Product exploration explored 100000 steps with 1713 reset in 492 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 131 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (270 resets) in 182 ms. (218 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (45 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
[2025-05-30 07:51:06] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/341 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/457 variables, 38/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 405/862 variables, 457/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/862 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/875 variables, 7/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/875 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/877 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/877 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/877 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 560 constraints, problems are : Problem set: 0 solved, 2 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/341 variables, 53/56 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 07:51:07] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 116/457 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 405/862 variables, 457/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/862 variables, 2/554 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 07:51:08] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/862 variables, 1/555 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 07:51:08] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:08] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:08] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:08] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:08] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/862 variables, 5/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/862 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 13/875 variables, 7/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/877 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/877 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/877 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 569 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2109 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 2816ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 235 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 411/411 transitions.
Applied a total of 0 rules in 19 ms. Remains 466 /466 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2025-05-30 07:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:51:10] [INFO ] Implicit Places using invariants in 607 ms returned []
[2025-05-30 07:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:51:12] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2025-05-30 07:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:38] [INFO ] Deduced a trap composed of 77 places in 597 ms of which 305 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:38] [INFO ] Deduced a trap composed of 77 places in 357 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:38] [INFO ] Deduced a trap composed of 77 places in 462 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:39] [INFO ] Deduced a trap composed of 72 places in 430 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:39] [INFO ] Deduced a trap composed of 77 places in 390 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:40] [INFO ] Deduced a trap composed of 79 places in 353 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:40] [INFO ] Deduced a trap composed of 79 places in 364 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:40] [INFO ] Deduced a trap composed of 79 places in 372 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:41] [INFO ] Deduced a trap composed of 79 places in 343 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:41] [INFO ] Deduced a trap composed of 79 places in 314 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:41] [INFO ] Deduced a trap composed of 79 places in 280 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:42] [INFO ] Deduced a trap composed of 79 places in 336 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:42] [INFO ] Deduced a trap composed of 79 places in 352 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:43] [INFO ] Deduced a trap composed of 79 places in 336 ms of which 70 ms to minimize.
SMT process timed out in 30177ms, After SMT, problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 30179ms
Finished structural reductions in LTL mode , in 1 iterations and 32915 ms. Remains : 466/466 places, 411/411 transitions.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (270 resets) in 227 ms. (175 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
[2025-05-30 07:51:43] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/341 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/457 variables, 38/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 405/862 variables, 457/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/862 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/875 variables, 7/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/875 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/877 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/877 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/877 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 560 constraints, problems are : Problem set: 0 solved, 2 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/341 variables, 53/56 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 07:51:44] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:44] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 116/457 variables, 38/96 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 07:51:45] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:51:45] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 405/862 variables, 457/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/862 variables, 2/557 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 07:51:45] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/862 variables, 1/558 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 07:51:45] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/862 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/862 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 13/875 variables, 7/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/875 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/877 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/877 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/877 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2241 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 466/466 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3006ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 232 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1578 reset in 314 ms.
Product exploration explored 100000 steps with 1727 reset in 566 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 466/466 places, 411/411 transitions.
Graph (trivial) has 210 edges and 466 vertex of which 4 / 466 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1064 edges and 463 vertex of which 462 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 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 462 transition count 407
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 71 Pre rules applied. Total rules applied 48 place count 462 transition count 458
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 119 place count 462 transition count 458
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 133 place count 448 transition count 432
Deduced a syphon composed of 103 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 147 place count 448 transition count 432
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 258 places in 0 ms
Iterating global reduction 1 with 155 rules applied. Total rules applied 302 place count 448 transition count 432
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 340 place count 410 transition count 394
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 378 place count 410 transition count 394
Deduced a syphon composed of 220 places in 0 ms
Applied a total of 378 rules in 113 ms. Remains 410 /466 variables (removed 56) and now considering 394/411 (removed 17) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:51:48] [INFO ] Redundant transitions in 13 ms returned []
Running 393 sub problems to find dead transitions.
// Phase 1: matrix 394 rows 410 cols
[2025-05-30 07:51:48] [INFO ] Computed 94 invariants in 9 ms
[2025-05-30 07:51:48] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:10] [INFO ] Deduced a trap composed of 3 places in 371 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:10] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:11] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:11] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:11] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:12] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:12] [INFO ] Deduced a trap composed of 39 places in 354 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:13] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:13] [INFO ] Deduced a trap composed of 29 places in 393 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:13] [INFO ] Deduced a trap composed of 29 places in 390 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:14] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:14] [INFO ] Deduced a trap composed of 40 places in 382 ms of which 44 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:15] [INFO ] Deduced a trap composed of 40 places in 371 ms of which 40 ms to minimize.
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:15] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 13 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:15] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 16 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:16] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 8 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:16] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 17 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:16] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 17 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:17] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 10 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:17] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 9 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 20/114 constraints. Problems are: Problem set: 143 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:17] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:17] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 9 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 20/134 constraints. Problems are: Problem set: 200 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
SMT process timed out in 30260ms, After SMT, problems are : Problem set: 200 solved, 193 unsolved
Search for dead transitions found 200 dead transitions in 30263ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) removed 200 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 410/466 places, 194/411 transitions.
Graph (complete) has 918 edges and 410 vertex of which 251 are kept as prefixes of interest. Removing 159 places using SCC suffix rule.1 ms
Discarding 159 places :
Also discarding 0 output transitions
Ensure Unique test removed 20 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 231 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 230 transition count 205
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 230 transition count 205
Deduced a syphon composed of 62 places in 1 ms
Applied a total of 5 rules in 15 ms. Remains 230 /410 variables (removed 180) and now considering 205/194 (removed -11) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/466 places, 205/411 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30418 ms. Remains : 230/466 places, 205/411 transitions.
Built C files in :
/tmp/ltsmin11952304137154613117
[2025-05-30 07:52:19] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11952304137154613117
Running compilation step : cd /tmp/ltsmin11952304137154613117;'/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 1073 ms.
Running link step : cd /tmp/ltsmin11952304137154613117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11952304137154613117;'/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/stateBased4396725427550833769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 411/411 transitions.
Applied a total of 0 rules in 10 ms. Remains 466 /466 variables (removed 0) and now considering 411/411 (removed 0) transitions.
// Phase 1: matrix 411 rows 466 cols
[2025-05-30 07:52:34] [INFO ] Computed 94 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:34] [INFO ] Implicit Places using invariants in 434 ms returned []
[2025-05-30 07:52:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:36] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2025-05-30 07:52:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:01] [INFO ] Deduced a trap composed of 77 places in 638 ms of which 311 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:01] [INFO ] Deduced a trap composed of 77 places in 377 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:02] [INFO ] Deduced a trap composed of 77 places in 382 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:02] [INFO ] Deduced a trap composed of 72 places in 417 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:03] [INFO ] Deduced a trap composed of 77 places in 361 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:03] [INFO ] Deduced a trap composed of 79 places in 357 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:03] [INFO ] Deduced a trap composed of 79 places in 344 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:04] [INFO ] Deduced a trap composed of 79 places in 386 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:04] [INFO ] Deduced a trap composed of 79 places in 348 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:05] [INFO ] Deduced a trap composed of 79 places in 315 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:05] [INFO ] Deduced a trap composed of 79 places in 338 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:05] [INFO ] Deduced a trap composed of 79 places in 345 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:06] [INFO ] Deduced a trap composed of 79 places in 317 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:06] [INFO ] Deduced a trap composed of 79 places in 346 ms of which 73 ms to minimize.
SMT process timed out in 30053ms, After SMT, problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 30055ms
Finished structural reductions in LTL mode , in 1 iterations and 32212 ms. Remains : 466/466 places, 411/411 transitions.
Built C files in :
/tmp/ltsmin4501659281848841578
[2025-05-30 07:53:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4501659281848841578
Running compilation step : cd /tmp/ltsmin4501659281848841578;'/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 1285 ms.
Running link step : cd /tmp/ltsmin4501659281848841578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin4501659281848841578;'/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/stateBased7807211368020811612.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 07:53:21] [INFO ] Flatten gal took : 36 ms
[2025-05-30 07:53:21] [INFO ] Flatten gal took : 35 ms
[2025-05-30 07:53:21] [INFO ] Time to serialize gal into /tmp/LTL17953576671268741507.gal : 8 ms
[2025-05-30 07:53:21] [INFO ] Time to serialize properties into /tmp/LTL2192947226315098537.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17953576671268741507.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17608028367085393631.hoa' '-atoms' '/tmp/LTL2192947226315098537.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2192947226315098537.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17608028367085393631.hoa
Detected timeout of ITS tools.
[2025-05-30 07:53:36] [INFO ] Flatten gal took : 31 ms
[2025-05-30 07:53:36] [INFO ] Flatten gal took : 29 ms
[2025-05-30 07:53:36] [INFO ] Time to serialize gal into /tmp/LTL2420007506629656592.gal : 6 ms
[2025-05-30 07:53:36] [INFO ] Time to serialize properties into /tmp/LTL1040626365990643271.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2420007506629656592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1040626365990643271.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(p449==1)"))||(X(X(G("(p524==0)"))))))
Formula 0 simplified : G!"(p449==1)" & XXF!"(p524==0)"
Detected timeout of ITS tools.
[2025-05-30 07:53:52] [INFO ] Flatten gal took : 25 ms
[2025-05-30 07:53:52] [INFO ] Applying decomposition
[2025-05-30 07:53:52] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14146239112299598700.txt' '-o' '/tmp/graph14146239112299598700.bin' '-w' '/tmp/graph14146239112299598700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14146239112299598700.bin' '-l' '-1' '-v' '-w' '/tmp/graph14146239112299598700.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:53:52] [INFO ] Decomposing Gal with order
[2025-05-30 07:53:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:53:52] [INFO ] Removed a total of 272 redundant transitions.
[2025-05-30 07:53:52] [INFO ] Flatten gal took : 108 ms
[2025-05-30 07:53:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 17 ms.
[2025-05-30 07:53:52] [INFO ] Time to serialize gal into /tmp/LTL4751492199988599848.gal : 16 ms
[2025-05-30 07:53:52] [INFO ] Time to serialize properties into /tmp/LTL1759954095516874443.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4751492199988599848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1759954095516874443.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(i19.i1.u126.p449==1)"))||(X(X(G("(i10.i1.u136.p524==0)"))))))
Formula 0 simplified : G!"(i19.i1.u126.p449==1)" & XXF!"(i10.i1.u136.p524==0)"
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-14-LTLFireability-11 finished in 215684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p1) U X(p2)))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 471 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 471 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 470 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 470 transition count 415
Applied a total of 18 rules in 42 ms. Remains 470 /479 variables (removed 9) and now considering 415/424 (removed 9) transitions.
// Phase 1: matrix 415 rows 470 cols
[2025-05-30 07:54:07] [INFO ] Computed 94 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:08] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-05-30 07:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:09] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2025-05-30 07:54:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:26] [INFO ] Deduced a trap composed of 77 places in 607 ms of which 319 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:26] [INFO ] Deduced a trap composed of 77 places in 327 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:26] [INFO ] Deduced a trap composed of 77 places in 351 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:27] [INFO ] Deduced a trap composed of 72 places in 254 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:27] [INFO ] Deduced a trap composed of 77 places in 259 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:27] [INFO ] Deduced a trap composed of 79 places in 237 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:27] [INFO ] Deduced a trap composed of 79 places in 255 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:28] [INFO ] Deduced a trap composed of 79 places in 281 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:28] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:28] [INFO ] Deduced a trap composed of 79 places in 349 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:28] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:29] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:29] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:29] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:29] [INFO ] Deduced a trap composed of 79 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 07:54:30] [INFO ] Deduced a trap composed of 79 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 07:54:30] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:30] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:31] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:31] [INFO ] Deduced a trap composed of 73 places in 274 ms of which 48 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:32] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:32] [INFO ] Deduced a trap composed of 79 places in 245 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:33] [INFO ] Deduced a trap composed of 79 places in 236 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:33] [INFO ] Deduced a trap composed of 79 places in 348 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:33] [INFO ] Deduced a trap composed of 79 places in 346 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:34] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:34] [INFO ] Deduced a trap composed of 79 places in 351 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:35] [INFO ] Deduced a trap composed of 78 places in 401 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:35] [INFO ] Deduced a trap composed of 76 places in 373 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:36] [INFO ] Deduced a trap composed of 73 places in 426 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:36] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:37] [INFO ] Deduced a trap composed of 15 places in 358 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:37] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:37] [INFO ] Deduced a trap composed of 71 places in 311 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:38] [INFO ] Deduced a trap composed of 72 places in 357 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:38] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:39] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:39] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:39] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:39] [INFO ] Deduced a trap composed of 56 places in 389 ms of which 53 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/885 variables, and 134 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 55/92 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 40/134 constraints. Problems are: Problem set: 4 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:47] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:48] [INFO ] Deduced a trap composed of 79 places in 322 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:48] [INFO ] Deduced a trap composed of 79 places in 372 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:49] [INFO ] Deduced a trap composed of 79 places in 354 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:49] [INFO ] Deduced a trap composed of 79 places in 333 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:50] [INFO ] Deduced a trap composed of 77 places in 399 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:50] [INFO ] Deduced a trap composed of 73 places in 400 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:51] [INFO ] Deduced a trap composed of 77 places in 392 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:51] [INFO ] Deduced a trap composed of 73 places in 407 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:52] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:52] [INFO ] Deduced a trap composed of 77 places in 368 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:52] [INFO ] Deduced a trap composed of 72 places in 365 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:53] [INFO ] Deduced a trap composed of 77 places in 421 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:53] [INFO ] Deduced a trap composed of 77 places in 356 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:54] [INFO ] Deduced a trap composed of 74 places in 380 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:54] [INFO ] Deduced a trap composed of 74 places in 389 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:54] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:55] [INFO ] Deduced a trap composed of 83 places in 529 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:55] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:56] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/154 constraints. Problems are: Problem set: 4 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:57] [INFO ] Deduced a trap composed of 71 places in 332 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:57] [INFO ] Deduced a trap composed of 71 places in 414 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:58] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:58] [INFO ] Deduced a trap composed of 71 places in 370 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:59] [INFO ] Deduced a trap composed of 71 places in 406 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:54:59] [INFO ] Deduced a trap composed of 71 places in 400 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:00] [INFO ] Deduced a trap composed of 71 places in 394 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:00] [INFO ] Deduced a trap composed of 71 places in 408 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:00] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:01] [INFO ] Deduced a trap composed of 71 places in 413 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:01] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:02] [INFO ] Deduced a trap composed of 59 places in 384 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:02] [INFO ] Deduced a trap composed of 74 places in 410 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:02] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:03] [INFO ] Deduced a trap composed of 74 places in 429 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:03] [INFO ] Deduced a trap composed of 71 places in 396 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:04] [INFO ] Deduced a trap composed of 71 places in 369 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:04] [INFO ] Deduced a trap composed of 74 places in 409 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:05] [INFO ] Deduced a trap composed of 74 places in 370 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:05] [INFO ] Deduced a trap composed of 36 places in 366 ms of which 52 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/174 constraints. Problems are: Problem set: 7 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:06] [INFO ] Deduced a trap composed of 78 places in 348 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:07] [INFO ] Deduced a trap composed of 78 places in 362 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:07] [INFO ] Deduced a trap composed of 78 places in 349 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:08] [INFO ] Deduced a trap composed of 78 places in 308 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:08] [INFO ] Deduced a trap composed of 74 places in 345 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:09] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:09] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:10] [INFO ] Deduced a trap composed of 78 places in 363 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:10] [INFO ] Deduced a trap composed of 78 places in 321 ms of which 69 ms to minimize.
SMT process timed out in 60419ms, After SMT, problems are : Problem set: 7 solved, 407 unsolved
Search for dead transitions found 7 dead transitions in 60420ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 408/424 transitions.
Applied a total of 0 rules in 19 ms. Remains 470 /470 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62809 ms. Remains : 470/479 places, 408/424 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-12
Entered a terminal (fully accepting) state of product in 5059 steps with 32 reset in 19 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLFireability-12 finished in 63204 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((X(p1)&&p0))||G(p2)))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 469 transition count 414
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 469 transition count 414
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 466 transition count 411
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 466 transition count 411
Applied a total of 26 rules in 58 ms. Remains 466 /479 variables (removed 13) and now considering 411/424 (removed 13) transitions.
// Phase 1: matrix 411 rows 466 cols
[2025-05-30 07:55:10] [INFO ] Computed 94 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:11] [INFO ] Implicit Places using invariants in 625 ms returned []
[2025-05-30 07:55:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:13] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 2950 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2025-05-30 07:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:39] [INFO ] Deduced a trap composed of 77 places in 612 ms of which 320 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:39] [INFO ] Deduced a trap composed of 77 places in 266 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:40] [INFO ] Deduced a trap composed of 77 places in 288 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:40] [INFO ] Deduced a trap composed of 72 places in 417 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:41] [INFO ] Deduced a trap composed of 77 places in 369 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:41] [INFO ] Deduced a trap composed of 79 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 07:55:41] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:41] [INFO ] Deduced a trap composed of 79 places in 243 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:42] [INFO ] Deduced a trap composed of 79 places in 214 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:42] [INFO ] Deduced a trap composed of 79 places in 333 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:42] [INFO ] Deduced a trap composed of 79 places in 319 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:43] [INFO ] Deduced a trap composed of 79 places in 363 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:43] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:43] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:43] [INFO ] Deduced a trap composed of 79 places in 218 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:44] [INFO ] Deduced a trap composed of 79 places in 240 ms of which 50 ms to minimize.
SMT process timed out in 30265ms, After SMT, problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 30268ms
Starting structural reductions in LTL mode, iteration 1 : 466/479 places, 411/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33278 ms. Remains : 466/479 places, 411/424 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-13
Product exploration explored 100000 steps with 686 reset in 192 ms.
Product exploration explored 100000 steps with 681 reset in 244 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1067 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 132 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (271 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35912 steps (40 resets) in 58 ms. (608 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 19 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-14-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-14-LTLFireability-13 finished in 34370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-14-LTLFireability-11
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 479/479 places, 424/424 transitions.
Graph (trivial) has 223 edges and 479 vertex of which 4 / 479 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1087 edges and 476 vertex of which 475 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 474 transition count 366
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 421 transition count 366
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 108 place count 421 transition count 267
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 322 place count 306 transition count 267
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 332 place count 296 transition count 257
Iterating global reduction 2 with 10 rules applied. Total rules applied 342 place count 296 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 342 place count 296 transition count 256
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 344 place count 295 transition count 256
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 593 place count 168 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 595 place count 167 transition count 138
Applied a total of 595 rules in 38 ms. Remains 167 /479 variables (removed 312) and now considering 138/424 (removed 286) transitions.
// Phase 1: matrix 138 rows 167 cols
[2025-05-30 07:55:45] [INFO ] Computed 73 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:46] [INFO ] Implicit Places using invariants in 438 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 449 ms to find 21 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 146/479 places, 138/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 494 ms. Remains : 146/479 places, 138/424 transitions.
Running random walk in product with property : BusinessProcesses-PT-14-LTLFireability-11
Product exploration explored 100000 steps with 19715 reset in 296 ms.
Product exploration explored 100000 steps with 19781 reset in 284 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (6071 resets) in 415 ms. (96 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1989 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1977 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
// Phase 1: matrix 138 rows 146 cols
[2025-05-30 07:55:47] [INFO ] Computed 52 invariants in 2 ms
[2025-05-30 07:55:47] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 64/106 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/140 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/143 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 137/280 variables, 143/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/283 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/283 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/284 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 146/146 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 64/106 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/140 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/143 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 137/280 variables, 143/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/283 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/283 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/283 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/284 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 146/146 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 722ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 386 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2025-05-30 07:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:49] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-05-30 07:55:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-05-30 07:55:50] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned [1, 3, 7, 10, 33, 35, 37, 38, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 63, 65, 67, 69, 71, 73, 75, 77, 85, 87, 89, 91, 93]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 1318 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/146 places, 138/138 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 109 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 109 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 108 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 108 transition count 130
Applied a total of 12 rules in 6 ms. Remains 108 /114 variables (removed 6) and now considering 130/138 (removed 8) transitions.
// Phase 1: matrix 130 rows 108 cols
[2025-05-30 07:55:50] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:50] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 07:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 07:55:50] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/146 places, 130/138 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2070 ms. Remains : 108/146 places, 130/138 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 360 edges and 108 vertex of which 97 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 250 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (6083 resets) in 145 ms. (273 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (2026 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1994 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2025-05-30 07:55:51] [INFO ] Invariant cache hit.
[2025-05-30 07:55:51] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/76 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/79 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 123/202 variables, 79/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/235 variables, 27/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/236 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/237 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/237 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/237 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/238 variables, and 133 constraints, problems are : Problem set: 0 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/76 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/79 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 123/202 variables, 79/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 33/235 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/236 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/237 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/237 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/237 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/238 variables, and 135 constraints, problems are : Problem set: 0 solved, 2 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 108/108 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 381 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19582 reset in 222 ms.
Product exploration explored 100000 steps with 19654 reset in 245 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 130/130 transitions.
Graph (complete) has 360 edges and 108 vertex of which 97 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 97 transition count 125
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 88 transition count 89
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 88 transition count 89
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 88 transition count 94
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 39 rules in 8 ms. Remains 88 /108 variables (removed 20) and now considering 94/130 (removed 36) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:55:54] [INFO ] Redundant transitions in 23 ms returned []
Running 89 sub problems to find dead transitions.
// Phase 1: matrix 94 rows 88 cols
[2025-05-30 07:55:54] [INFO ] Computed 16 invariants in 1 ms
[2025-05-30 07:55:54] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:55] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:55] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:55] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:55] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 5/21 constraints. Problems are: Problem set: 24 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:56] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:56] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:56] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/24 constraints. Problems are: Problem set: 24 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/24 constraints. Problems are: Problem set: 24 solved, 65 unsolved
Problem TDEAD8 is UNSAT
At refinement iteration 7 (OVERLAPS) 93/181 variables, 88/112 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 3/115 constraints. Problems are: Problem set: 25 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:55:57] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/116 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/116 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/116 constraints. Problems are: Problem set: 25 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 116 constraints, problems are : Problem set: 25 solved, 64 unsolved in 6868 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 88/88 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 25 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 7/7 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 2/9 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 20/87 variables, 7/16 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 7/23 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/23 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 2/25 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/25 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 93/181 variables, 88/113 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 3/116 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 64/180 constraints. Problems are: Problem set: 25 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:56:03] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:56:03] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 2/182 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/182 constraints. Problems are: Problem set: 25 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/181 variables, 0/182 constraints. Problems are: Problem set: 25 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 182 constraints, problems are : Problem set: 25 solved, 64 unsolved in 10167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 88/88 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 64/89 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17079ms problems are : Problem set: 25 solved, 64 unsolved
Search for dead transitions found 25 dead transitions in 17079ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 88/108 places, 69/130 transitions.
Graph (complete) has 224 edges and 88 vertex of which 68 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 4 ms. Remains 67 /88 variables (removed 21) and now considering 69/69 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/108 places, 69/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17124 ms. Remains : 67/108 places, 69/130 transitions.
Built C files in :
/tmp/ltsmin1037937311839431094
[2025-05-30 07:56:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1037937311839431094
Running compilation step : cd /tmp/ltsmin1037937311839431094;'/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 596 ms.
Running link step : cd /tmp/ltsmin1037937311839431094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1037937311839431094;'/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/stateBased12238207234527673666.hoa' '--buchi-type=spotba'
LTSmin run took 315 ms.
Treatment of property BusinessProcesses-PT-14-LTLFireability-11 finished in 26997 ms.
FORMULA BusinessProcesses-PT-14-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-05-30 07:56:12] [INFO ] Flatten gal took : 34 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 634140 ms.

BK_STOP 1748591772249

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;