Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 159K 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-16-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748600933880

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 10:28:56] [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 10:28:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:28:57] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2025-05-30 10:28:57] [INFO ] Transformed 638 places.
[2025-05-30 10:28:57] [INFO ] Transformed 578 transitions.
[2025-05-30 10:28:57] [INFO ] Found NUPN structural information;
[2025-05-30 10:28:57] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 533 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 23 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 97 place count 533 transition count 478
Iterating global reduction 1 with 92 rules applied. Total rules applied 189 place count 533 transition count 478
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 234 place count 488 transition count 433
Iterating global reduction 1 with 45 rules applied. Total rules applied 279 place count 488 transition count 433
Applied a total of 279 rules in 257 ms. Remains 488 /630 variables (removed 142) and now considering 433/570 (removed 137) transitions.
// Phase 1: matrix 433 rows 488 cols
[2025-05-30 10:28:57] [INFO ] Computed 95 invariants in 75 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:28:59] [INFO ] Implicit Places using invariants in 1271 ms returned []
[2025-05-30 10:28:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:29:01] [INFO ] Implicit Places using invariants and state equation in 2868 ms returned []
Implicit Place search using SMT with State Equation took 4204 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2025-05-30 10:29: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/487 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:31] [INFO ] Deduced a trap composed of 85 places in 437 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:31] [INFO ] Deduced a trap composed of 86 places in 378 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:31] [INFO ] Deduced a trap composed of 86 places in 524 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:32] [INFO ] Deduced a trap composed of 86 places in 355 ms of which 120 ms to minimize.
SMT process timed out in 30398ms, After SMT, problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 30427ms
Starting structural reductions in LTL mode, iteration 1 : 488/630 places, 433/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34928 ms. Remains : 488/630 places, 433/570 transitions.
Support contains 37 out of 488 places after structural reductions.
[2025-05-30 10:29:32] [INFO ] Flatten gal took : 176 ms
[2025-05-30 10:29:33] [INFO ] Flatten gal took : 83 ms
[2025-05-30 10:29:33] [INFO ] Input system was already deterministic with 433 transitions.
RANDOM walk for 40000 steps (263 resets) in 4130 ms. (9 steps per ms) remains 21/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
[2025-05-30 10:29:34] [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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 162/189 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 179/368 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 109/477 variables, 36/93 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 2/479 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 427/906 variables, 479/574 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/906 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 11 (OVERLAPS) 13/919 variables, 7/581 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/919 variables, 0/581 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 2/921 variables, 2/583 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/921 variables, 0/583 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 921/921 variables, and 583 constraints, problems are : Problem set: 2 solved, 19 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 159/183 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:40] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:40] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 183/366 variables, 44/59 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:40] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:41] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:41] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:41] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:41] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:41] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:41] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:41] [INFO ] Deduced a trap composed of 64 places in 228 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:42] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:42] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:42] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:42] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:42] [INFO ] Deduced a trap composed of 78 places in 230 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:43] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:43] [INFO ] Deduced a trap composed of 83 places in 312 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:43] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:43] [INFO ] Deduced a trap composed of 64 places in 288 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:44] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:44] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:44] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 26 ms to minimize.
SMT process timed out in 10134ms, After SMT, problems are : Problem set: 2 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 433/433 transitions.
Graph (trivial) has 208 edges and 488 vertex of which 6 / 488 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 1101 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 482 transition count 380
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 437 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 435 transition count 378
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 96 place count 435 transition count 284
Deduced a syphon composed of 94 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 300 place count 325 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 301 place count 324 transition count 283
Iterating global reduction 3 with 1 rules applied. Total rules applied 302 place count 324 transition count 283
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 245 rules applied. Total rules applied 547 place count 201 transition count 161
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 3 with 2 rules applied. Total rules applied 549 place count 200 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 551 place count 200 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 553 place count 198 transition count 163
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 558 place count 198 transition count 163
Applied a total of 558 rules in 242 ms. Remains 198 /488 variables (removed 290) and now considering 163/433 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 198/488 places, 163/433 transitions.
RANDOM walk for 40000 steps (1213 resets) in 1379 ms. (28 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40000 steps (531 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
// Phase 1: matrix 163 rows 198 cols
[2025-05-30 10:29:45] [INFO ] Computed 78 invariants in 7 ms
[2025-05-30 10:29:45] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/151 variables, 56/57 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 10:29:45] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:45] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:45] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:45] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:46] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:46] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/194 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/195 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 163/358 variables, 195/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 13/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/361 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/361 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/361 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 198/198 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/151 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 6/63 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 10:29:46] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:46] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:46] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:29:46] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/194 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/195 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 163/358 variables, 195/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 13/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/358 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/361 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/361 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 198/198 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1663ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2550 steps, including 105 resets, run visited all 1 properties in 27 ms. (steps per millisecond=94 )
Parikh walk visited 1 properties in 37 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 131 stabilizing places and 124 stable transitions
Graph (complete) has 1108 edges and 488 vertex of which 487 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.32 ms
FORMULA BusinessProcesses-PT-16-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Graph (trivial) has 232 edges and 488 vertex of which 6 / 488 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 1102 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 481 transition count 371
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 427 transition count 371
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 110 place count 427 transition count 269
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 331 place count 308 transition count 269
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 344 place count 295 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 358 place count 294 transition count 256
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 606 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 167 transition count 138
Applied a total of 608 rules in 117 ms. Remains 167 /488 variables (removed 321) and now considering 138/433 (removed 295) transitions.
// Phase 1: matrix 138 rows 167 cols
[2025-05-30 10:29:48] [INFO ] Computed 73 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:29:48] [INFO ] Implicit Places using invariants in 367 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 387 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/488 places, 138/433 transitions.
Applied a total of 0 rules in 20 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 524 ms. Remains : 147/488 places, 138/433 transitions.
Stuttering acceptance computed with spot in 464 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-00 finished in 1117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 476 transition count 421
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 476 transition count 421
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 472 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 472 transition count 417
Applied a total of 32 rules in 104 ms. Remains 472 /488 variables (removed 16) and now considering 417/433 (removed 16) transitions.
// Phase 1: matrix 417 rows 472 cols
[2025-05-30 10:29:49] [INFO ] Computed 95 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:29:49] [INFO ] Implicit Places using invariants in 618 ms returned []
[2025-05-30 10:29:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:29:51] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 2882 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-30 10:29:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:18] [INFO ] Deduced a trap composed of 80 places in 353 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:18] [INFO ] Deduced a trap composed of 80 places in 275 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:18] [INFO ] Deduced a trap composed of 80 places in 395 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:19] [INFO ] Deduced a trap composed of 79 places in 389 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:19] [INFO ] Deduced a trap composed of 79 places in 368 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:20] [INFO ] Deduced a trap composed of 79 places in 342 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:20] [INFO ] Deduced a trap composed of 79 places in 398 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:20] [INFO ] Deduced a trap composed of 77 places in 385 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:21] [INFO ] Deduced a trap composed of 77 places in 321 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:21] [INFO ] Deduced a trap composed of 77 places in 275 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:21] [INFO ] Deduced a trap composed of 77 places in 269 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:22] [INFO ] Deduced a trap composed of 77 places in 259 ms of which 52 ms to minimize.
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 30233ms
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 417/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33223 ms. Remains : 472/488 places, 417/433 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 509 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Computed a total of 126 stabilizing places and 119 stable transitions
Graph (complete) has 1082 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 126 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 26 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLFireability-02 finished in 34284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(X(p0)&&(X(X(X(p1))) U ((p1&&X(X(X(p1)))&&G(p0))||X(X(X(G(p1))))))))))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 476 transition count 421
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 476 transition count 421
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 472 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 472 transition count 417
Applied a total of 32 rules in 42 ms. Remains 472 /488 variables (removed 16) and now considering 417/433 (removed 16) transitions.
// Phase 1: matrix 417 rows 472 cols
[2025-05-30 10:30:23] [INFO ] Computed 95 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:30:23] [INFO ] Implicit Places using invariants in 592 ms returned []
[2025-05-30 10:30:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:30:26] [INFO ] Implicit Places using invariants and state equation in 2697 ms returned []
Implicit Place search using SMT with State Equation took 3292 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-30 10:30:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:53] [INFO ] Deduced a trap composed of 80 places in 350 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:53] [INFO ] Deduced a trap composed of 80 places in 410 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:54] [INFO ] Deduced a trap composed of 80 places in 432 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:54] [INFO ] Deduced a trap composed of 80 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 10:30:55] [INFO ] Deduced a trap composed of 80 places in 341 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:55] [INFO ] Deduced a trap composed of 80 places in 327 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:55] [INFO ] Deduced a trap composed of 78 places in 254 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:56] [INFO ] Deduced a trap composed of 78 places in 311 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:56] [INFO ] Deduced a trap composed of 78 places in 365 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:56] [INFO ] Deduced a trap composed of 36 places in 344 ms of which 53 ms to minimize.
SMT process timed out in 30278ms, After SMT, problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 30282ms
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 417/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33622 ms. Remains : 472/488 places, 417/433 transitions.
Stuttering acceptance computed with spot in 535 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-03
Product exploration explored 100000 steps with 668 reset in 526 ms.
Product exploration explored 100000 steps with 669 reset in 474 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1084 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (266 resets) in 406 ms. (98 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (45 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (45 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
[2025-05-30 10:30:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 3 (OVERLAPS) 258/378 variables, 56/60 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 10:30:59] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:30:59] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:00] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:00] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:00] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:00] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:01] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:01] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:01] [INFO ] Deduced a trap composed of 36 places in 307 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:01] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:02] [INFO ] Deduced a trap composed of 58 places in 280 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:02] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:02] [INFO ] Deduced a trap composed of 58 places in 302 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:03] [INFO ] Deduced a trap composed of 58 places in 313 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:03] [INFO ] Deduced a trap composed of 22 places in 318 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:03] [INFO ] Deduced a trap composed of 71 places in 309 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:04] [INFO ] Deduced a trap composed of 35 places in 323 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:04] [INFO ] Deduced a trap composed of 72 places in 308 ms of which 32 ms to minimize.
SMT process timed out in 5253ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 417/417 transitions.
Graph (trivial) has 215 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1077 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 466 transition count 362
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 419 transition count 362
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 96 place count 419 transition count 262
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 313 place count 302 transition count 262
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 575 place count 169 transition count 133
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 577 place count 168 transition count 137
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 579 place count 168 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 581 place count 166 transition count 135
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 582 place count 166 transition count 135
Applied a total of 582 rules in 128 ms. Remains 166 /472 variables (removed 306) and now considering 135/417 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 166/472 places, 135/417 transitions.
RANDOM walk for 1888 steps (79 resets) in 31 ms. (59 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 349 ms. Reduced automaton from 10 states, 23 edges and 2 AP (stutter sensitive) to 10 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 487 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 419 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 417/417 transitions.
Applied a total of 0 rules in 19 ms. Remains 472 /472 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2025-05-30 10:31:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:31:06] [INFO ] Implicit Places using invariants in 651 ms returned []
[2025-05-30 10:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:31:09] [INFO ] Implicit Places using invariants and state equation in 2933 ms returned []
Implicit Place search using SMT with State Equation took 3596 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-30 10:31: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/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:36] [INFO ] Deduced a trap composed of 80 places in 405 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:36] [INFO ] Deduced a trap composed of 80 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 10:31:37] [INFO ] Deduced a trap composed of 80 places in 379 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:37] [INFO ] Deduced a trap composed of 80 places in 346 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:37] [INFO ] Deduced a trap composed of 80 places in 349 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:38] [INFO ] Deduced a trap composed of 80 places in 359 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:38] [INFO ] Deduced a trap composed of 78 places in 356 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:38] [INFO ] Deduced a trap composed of 78 places in 311 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:39] [INFO ] Deduced a trap composed of 78 places in 364 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:31:39] [INFO ] Deduced a trap composed of 36 places in 334 ms of which 52 ms to minimize.
SMT process timed out in 30337ms, After SMT, problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 30342ms
Finished structural reductions in LTL mode , in 1 iterations and 33959 ms. Remains : 472/472 places, 417/417 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1084 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 10 states, 22 edges and 2 AP (stutter sensitive) to 10 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 521 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 33504 steps (220 resets) in 255 ms. (130 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 278 ms. Reduced automaton from 10 states, 22 edges and 2 AP (stutter sensitive) to 10 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 506 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 516 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 512 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 670 reset in 272 ms.
Product exploration explored 100000 steps with 659 reset in 331 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 519 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 417/417 transitions.
Graph (trivial) has 215 edges and 472 vertex of which 6 / 472 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 1078 edges and 467 vertex of which 466 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
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 466 transition count 410
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 48 place count 466 transition count 463
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 120 place count 466 transition count 463
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 134 place count 452 transition count 437
Deduced a syphon composed of 104 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 148 place count 452 transition count 437
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 261 places in 0 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 305 place count 452 transition count 437
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 343 place count 414 transition count 399
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 381 place count 414 transition count 399
Deduced a syphon composed of 223 places in 0 ms
Applied a total of 381 rules in 182 ms. Remains 414 /472 variables (removed 58) and now considering 399/417 (removed 18) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 10:31:44] [INFO ] Redundant transitions in 46 ms returned []
Running 398 sub problems to find dead transitions.
// Phase 1: matrix 399 rows 414 cols
[2025-05-30 10:31:44] [INFO ] Computed 95 invariants in 12 ms
[2025-05-30 10:31:44] [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/413 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/414 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:07] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:08] [INFO ] Deduced a trap composed of 37 places in 387 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:08] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:08] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 40 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:09] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 12 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:09] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 12 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:09] [INFO ] Deduced a trap composed of 14 places in 394 ms of which 31 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:10] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:10] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 29 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:11] [INFO ] Deduced a trap composed of 14 places in 379 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:11] [INFO ] Deduced a trap composed of 14 places in 335 ms of which 18 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:11] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 26 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:12] [INFO ] Deduced a trap composed of 3 places in 347 ms of which 16 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:12] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 15 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:12] [INFO ] Deduced a trap composed of 3 places in 349 ms of which 15 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:13] [INFO ] Deduced a trap composed of 3 places in 364 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 10:32:13] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:13] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 11 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:14] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 19 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:14] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 16 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 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 TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 20/115 constraints. Problems are: Problem set: 53 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/813 variables, and 115 constraints, problems are : Problem set: 53 solved, 345 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/414 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 345 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/373 variables, 11/11 constraints. Problems are: Problem set: 53 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/373 variables, 0/11 constraints. Problems are: Problem set: 53 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 31/404 variables, 57/68 constraints. Problems are: Problem set: 53 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 15/83 constraints. Problems are: Problem set: 53 solved, 345 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 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 TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 20/103 constraints. Problems are: Problem set: 83 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:20] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:20] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:21] [INFO ] Deduced a trap composed of 3 places in 295 ms of which 14 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:21] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 12 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:21] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 12 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:22] [INFO ] Deduced a trap composed of 3 places in 292 ms of which 12 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:22] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 12 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:22] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 12 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:22] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:22] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 43 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 10:32:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [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 10:32:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 20/123 constraints. Problems are: Problem set: 151 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:23] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 50 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 10:32:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 4 ms to minimize.
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:24] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
Problem TDEAD83 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:25] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 6 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:25] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
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 TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 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 TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 20/143 constraints. Problems are: Problem set: 218 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:25] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 6 ms to minimize.
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:25] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:26] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 15 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:26] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Problem TDEAD132 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:27] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:27] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:27] [INFO ] Deduced a trap composed of 36 places in 307 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:28] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:28] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:28] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:29] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:29] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:29] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:29] [INFO ] Deduced a trap composed of 36 places in 286 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:30] [INFO ] Deduced a trap composed of 37 places in 335 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:30] [INFO ] Deduced a trap composed of 37 places in 325 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:30] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:31] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:31] [INFO ] Deduced a trap composed of 37 places in 311 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:31] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 28 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 20/163 constraints. Problems are: Problem set: 222 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:32] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:33] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:33] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 28 ms to minimize.
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:33] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:34] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:34] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:34] [INFO ] Deduced a trap composed of 37 places in 316 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:35] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:35] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 25 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:35] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:36] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:36] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 27 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:36] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:36] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:37] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:37] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:37] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 28 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:38] [INFO ] Deduced a trap composed of 36 places in 301 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:38] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:38] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 29 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 20/183 constraints. Problems are: Problem set: 248 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:39] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:40] [INFO ] Deduced a trap composed of 38 places in 324 ms of which 29 ms to minimize.
Problem TDEAD165 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:40] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:40] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:40] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Problem TDEAD233 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:41] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:41] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:41] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:42] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:42] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:42] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
Problem TDEAD308 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:32:43] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 12/195 constraints. Problems are: Problem set: 253 solved, 145 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s82 1)
(s83 0)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s114 1)
(s118 1)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/813 variables, and 195 constraints, problems are : Problem set: 253 solved, 145 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 26/38 constraints, State Equation: 0/414 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/398 constraints, Known Traps: 112/112 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60430ms problems are : Problem set: 253 solved, 145 unsolved
Search for dead transitions found 253 dead transitions in 60435ms
Found 253 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 253 transitions
Dead transitions reduction (with SMT) removed 253 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 414/472 places, 146/417 transitions.
Graph (complete) has 819 edges and 414 vertex of which 206 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.2 ms
Discarding 208 places :
Also discarding 0 output transitions
Ensure Unique test removed 19 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 187 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 187 transition count 158
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 3 rules in 35 ms. Remains 187 /414 variables (removed 227) and now considering 158/146 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/472 places, 158/417 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60710 ms. Remains : 187/472 places, 158/417 transitions.
Built C files in :
/tmp/ltsmin11927682954001110377
[2025-05-30 10:32:44] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11927682954001110377
Running compilation step : cd /tmp/ltsmin11927682954001110377;'/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 1569 ms.
Running link step : cd /tmp/ltsmin11927682954001110377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin11927682954001110377;'/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/stateBased17853844690048636848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 417/417 transitions.
Applied a total of 0 rules in 11 ms. Remains 472 /472 variables (removed 0) and now considering 417/417 (removed 0) transitions.
// Phase 1: matrix 417 rows 472 cols
[2025-05-30 10:33:00] [INFO ] Computed 95 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:33:00] [INFO ] Implicit Places using invariants in 450 ms returned []
[2025-05-30 10:33:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:33:02] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-30 10:33:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:26] [INFO ] Deduced a trap composed of 80 places in 330 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:26] [INFO ] Deduced a trap composed of 80 places in 242 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:26] [INFO ] Deduced a trap composed of 80 places in 292 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:27] [INFO ] Deduced a trap composed of 80 places in 305 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:27] [INFO ] Deduced a trap composed of 80 places in 333 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:28] [INFO ] Deduced a trap composed of 80 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 10:33:28] [INFO ] Deduced a trap composed of 78 places in 331 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:28] [INFO ] Deduced a trap composed of 78 places in 335 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:29] [INFO ] Deduced a trap composed of 78 places in 263 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:29] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:29] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:29] [INFO ] Deduced a trap composed of 79 places in 254 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:30] [INFO ] Deduced a trap composed of 79 places in 232 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:30] [INFO ] Deduced a trap composed of 74 places in 233 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:30] [INFO ] Deduced a trap composed of 79 places in 380 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:31] [INFO ] Deduced a trap composed of 78 places in 373 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:31] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:32] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:33:32] [INFO ] Deduced a trap composed of 78 places in 352 ms of which 64 ms to minimize.
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Finished structural reductions in LTL mode , in 1 iterations and 32504 ms. Remains : 472/472 places, 417/417 transitions.
Built C files in :
/tmp/ltsmin16344814456029086034
[2025-05-30 10:33:32] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16344814456029086034
Running compilation step : cd /tmp/ltsmin16344814456029086034;'/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 1130 ms.
Running link step : cd /tmp/ltsmin16344814456029086034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16344814456029086034;'/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/stateBased6661481636796832085.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 10:33:47] [INFO ] Flatten gal took : 33 ms
[2025-05-30 10:33:47] [INFO ] Flatten gal took : 31 ms
[2025-05-30 10:33:47] [INFO ] Time to serialize gal into /tmp/LTL9718507752275785161.gal : 7 ms
[2025-05-30 10:33:47] [INFO ] Time to serialize properties into /tmp/LTL5270669657305141863.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/LTL9718507752275785161.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2821341686175662160.hoa' '-atoms' '/tmp/LTL5270669657305141863.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...317
Loading property file /tmp/LTL5270669657305141863.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2821341686175662160.hoa
Detected timeout of ITS tools.
[2025-05-30 10:34:02] [INFO ] Flatten gal took : 28 ms
[2025-05-30 10:34:02] [INFO ] Flatten gal took : 28 ms
[2025-05-30 10:34:02] [INFO ] Time to serialize gal into /tmp/LTL3143918998607684899.gal : 6 ms
[2025-05-30 10:34:02] [INFO ] Time to serialize properties into /tmp/LTL11858181431589190741.ltl : 5 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/LTL3143918998607684899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11858181431589190741.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...276
Read 1 LTL properties
Checking formula 0 : !(((X("(p613!=1)"))U((X(G("(p613!=1)")))||((X("(p613!=1)"))&&((X(X(X("(p32!=1)"))))U((X(X(X(G("(p32!=1)")))))||((("(p32!=1)")&&(G("(p6...195
Formula 0 simplified : X!"(p613!=1)" R (XF!"(p613!=1)" & (X!"(p613!=1)" | (XXX!"(p32!=1)" R (XXXF!"(p32!=1)" & (!"(p32!=1)" | F!"(p613!=1)" | XXX!"(p32!=1)...161
Detected timeout of ITS tools.
[2025-05-30 10:34:18] [INFO ] Flatten gal took : 25 ms
[2025-05-30 10:34:18] [INFO ] Applying decomposition
[2025-05-30 10:34:18] [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/graph16395040700127527314.txt' '-o' '/tmp/graph16395040700127527314.bin' '-w' '/tmp/graph16395040700127527314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16395040700127527314.bin' '-l' '-1' '-v' '-w' '/tmp/graph16395040700127527314.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:34:18] [INFO ] Decomposing Gal with order
[2025-05-30 10:34:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:34:18] [INFO ] Removed a total of 282 redundant transitions.
[2025-05-30 10:34:18] [INFO ] Flatten gal took : 172 ms
[2025-05-30 10:34:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 31 ms.
[2025-05-30 10:34:18] [INFO ] Time to serialize gal into /tmp/LTL12524915800018029254.gal : 23 ms
[2025-05-30 10:34:18] [INFO ] Time to serialize properties into /tmp/LTL11925789023844820581.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/LTL12524915800018029254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11925789023844820581.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X("(i9.i0.u156.p613!=1)"))U((X(G("(i9.i0.u156.p613!=1)")))||((X("(i9.i0.u156.p613!=1)"))&&((X(X(X("(i4.i0.u11.p32!=1)"))))U((X(X(X...279
Formula 0 simplified : X!"(i9.i0.u156.p613!=1)" R (XF!"(i9.i0.u156.p613!=1)" & (X!"(i9.i0.u156.p613!=1)" | (XXX!"(i4.i0.u11.p32!=1)" R (XXXF!"(i4.i0.u11.p3...245
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-16-LTLFireability-03 finished in 250448 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 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Graph (trivial) has 232 edges and 488 vertex of which 6 / 488 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1102 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 481 transition count 372
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 428 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 427 transition count 371
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 110 place count 427 transition count 269
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 331 place count 308 transition count 269
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 344 place count 295 transition count 256
Ensure Unique test removed 1 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 358 place count 294 transition count 256
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 4 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 608 place count 167 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 610 place count 166 transition count 137
Applied a total of 610 rules in 60 ms. Remains 166 /488 variables (removed 322) and now considering 137/433 (removed 296) transitions.
// Phase 1: matrix 137 rows 166 cols
[2025-05-30 10:34:33] [INFO ] Computed 73 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:34:34] [INFO ] Implicit Places using invariants in 486 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 49, 50, 51, 52]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 490 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/488 places, 137/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 558 ms. Remains : 147/488 places, 137/433 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-05 finished in 631 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(F(p0))&&(p1 U p2)&&F(p3)))||X(p2)))'
Support contains 6 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 476 transition count 421
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 476 transition count 421
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 473 transition count 418
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 473 transition count 418
Applied a total of 30 rules in 53 ms. Remains 473 /488 variables (removed 15) and now considering 418/433 (removed 15) transitions.
// Phase 1: matrix 418 rows 473 cols
[2025-05-30 10:34:34] [INFO ] Computed 95 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:34:35] [INFO ] Implicit Places using invariants in 658 ms returned []
[2025-05-30 10:34:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:34:38] [INFO ] Implicit Places using invariants and state equation in 3146 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2025-05-30 10:34:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:00] [INFO ] Deduced a trap composed of 82 places in 256 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:01] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:01] [INFO ] Deduced a trap composed of 82 places in 359 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:01] [INFO ] Deduced a trap composed of 82 places in 355 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:02] [INFO ] Deduced a trap composed of 81 places in 332 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:02] [INFO ] Deduced a trap composed of 81 places in 332 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:02] [INFO ] Deduced a trap composed of 80 places in 319 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:03] [INFO ] Deduced a trap composed of 80 places in 296 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:03] [INFO ] Deduced a trap composed of 80 places in 281 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:03] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:04] [INFO ] Deduced a trap composed of 81 places in 305 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:04] [INFO ] Deduced a trap composed of 82 places in 319 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:04] [INFO ] Deduced a trap composed of 81 places in 340 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:05] [INFO ] Deduced a trap composed of 81 places in 364 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:05] [INFO ] Deduced a trap composed of 80 places in 344 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:06] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:06] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:06] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:07] [INFO ] Deduced a trap composed of 80 places in 224 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:07] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 46 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 21 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:07] [INFO ] Deduced a trap composed of 79 places in 252 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 78 places in 282 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 35 ms to minimize.
SMT process timed out in 30338ms, After SMT, problems are : Problem set: 21 solved, 396 unsolved
Search for dead transitions found 21 dead transitions in 30340ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/488 places, 397/433 transitions.
Applied a total of 0 rules in 19 ms. Remains 473 /473 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34222 ms. Remains : 473/488 places, 397/433 transitions.
Stuttering acceptance computed with spot in 446 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3) (NOT p0)), (NOT p0), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-06
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-06 finished in 34714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Graph (trivial) has 229 edges and 488 vertex of which 6 / 488 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1102 edges and 483 vertex of which 482 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 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 481 transition count 373
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 429 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 428 transition count 372
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 108 place count 428 transition count 271
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 327 place count 310 transition count 271
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 339 place count 298 transition count 259
Ensure Unique test removed 1 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 352 place count 297 transition count 259
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 4 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 600 place count 171 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 602 place count 170 transition count 141
Applied a total of 602 rules in 50 ms. Remains 170 /488 variables (removed 318) and now considering 141/433 (removed 292) transitions.
// Phase 1: matrix 141 rows 170 cols
[2025-05-30 10:35:09] [INFO ] Computed 73 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:35:09] [INFO ] Implicit Places using invariants in 241 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 244 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/488 places, 141/433 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 300 ms. Remains : 151/488 places, 141/433 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-07
Stuttering criterion allowed to conclude after 1044 steps with 161 reset in 8 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-07 finished in 368 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 p1)&&X((G(p2) U (p1||G(!p2))))))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 477 transition count 422
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 477 transition count 422
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 473 transition count 418
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 473 transition count 418
Applied a total of 30 rules in 36 ms. Remains 473 /488 variables (removed 15) and now considering 418/433 (removed 15) transitions.
// Phase 1: matrix 418 rows 473 cols
[2025-05-30 10:35:09] [INFO ] Computed 95 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:35:09] [INFO ] Implicit Places using invariants in 416 ms returned []
[2025-05-30 10:35:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:35:11] [INFO ] Implicit Places using invariants and state equation in 2013 ms returned []
Implicit Place search using SMT with State Equation took 2431 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2025-05-30 10:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 80 places in 275 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 80 places in 253 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 80 places in 252 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 80 places in 284 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap composed of 78 places in 269 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap composed of 78 places in 277 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap composed of 78 places in 268 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:35] [INFO ] Deduced a trap composed of 73 places in 259 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:35] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:35] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:36] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:36] [INFO ] Deduced a trap composed of 80 places in 279 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:36] [INFO ] Deduced a trap composed of 80 places in 372 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:37] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:37] [INFO ] Deduced a trap composed of 80 places in 350 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:38] [INFO ] Deduced a trap composed of 80 places in 370 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:38] [INFO ] Deduced a trap composed of 80 places in 373 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:38] [INFO ] Deduced a trap composed of 80 places in 371 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:39] [INFO ] Deduced a trap composed of 80 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 10:35:39] [INFO ] Deduced a trap composed of 25 places in 294 ms of which 40 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 7 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:40] [INFO ] Deduced a trap composed of 77 places in 388 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:40] [INFO ] Deduced a trap composed of 77 places in 339 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:41] [INFO ] Deduced a trap composed of 72 places in 359 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:41] [INFO ] Deduced a trap composed of 79 places in 348 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:41] [INFO ] Deduced a trap composed of 79 places in 339 ms of which 73 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/891 variables, and 120 constraints, problems are : Problem set: 7 solved, 410 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/473 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 37/37 constraints. Problems are: Problem set: 7 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/37 constraints. Problems are: Problem set: 7 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 56/93 constraints. Problems are: Problem set: 7 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/95 constraints. Problems are: Problem set: 7 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 25/120 constraints. Problems are: Problem set: 7 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:50] [INFO ] Deduced a trap composed of 78 places in 497 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:50] [INFO ] Deduced a trap composed of 79 places in 330 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:51] [INFO ] Deduced a trap composed of 79 places in 331 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:51] [INFO ] Deduced a trap composed of 79 places in 337 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:51] [INFO ] Deduced a trap composed of 79 places in 338 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:51] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:52] [INFO ] Deduced a trap composed of 79 places in 273 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:52] [INFO ] Deduced a trap composed of 78 places in 246 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:53] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:53] [INFO ] Deduced a trap composed of 78 places in 232 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:53] [INFO ] Deduced a trap composed of 78 places in 368 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:54] [INFO ] Deduced a trap composed of 78 places in 287 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:54] [INFO ] Deduced a trap composed of 78 places in 320 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:54] [INFO ] Deduced a trap composed of 78 places in 295 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:55] [INFO ] Deduced a trap composed of 78 places in 298 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:55] [INFO ] Deduced a trap composed of 77 places in 360 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:55] [INFO ] Deduced a trap composed of 79 places in 385 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:56] [INFO ] Deduced a trap composed of 80 places in 374 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:56] [INFO ] Deduced a trap composed of 15 places in 337 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:57] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 40 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/140 constraints. Problems are: Problem set: 15 solved, 402 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:58] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:58] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:59] [INFO ] Deduced a trap composed of 73 places in 358 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:59] [INFO ] Deduced a trap composed of 77 places in 353 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:59] [INFO ] Deduced a trap composed of 77 places in 361 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:00] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:00] [INFO ] Deduced a trap composed of 77 places in 370 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:01] [INFO ] Deduced a trap composed of 56 places in 370 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:01] [INFO ] Deduced a trap composed of 56 places in 371 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:01] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:02] [INFO ] Deduced a trap composed of 56 places in 355 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:02] [INFO ] Deduced a trap composed of 56 places in 360 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:03] [INFO ] Deduced a trap composed of 56 places in 367 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:03] [INFO ] Deduced a trap composed of 70 places in 376 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:03] [INFO ] Deduced a trap composed of 71 places in 337 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:04] [INFO ] Deduced a trap composed of 71 places in 342 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:04] [INFO ] Deduced a trap composed of 71 places in 387 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:04] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:05] [INFO ] Deduced a trap composed of 56 places in 366 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:05] [INFO ] Deduced a trap composed of 20 places in 363 ms of which 50 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/160 constraints. Problems are: Problem set: 15 solved, 402 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:06] [INFO ] Deduced a trap composed of 79 places in 384 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:07] [INFO ] Deduced a trap composed of 79 places in 349 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:07] [INFO ] Deduced a trap composed of 77 places in 390 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:08] [INFO ] Deduced a trap composed of 36 places in 361 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:08] [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 10:36:09] [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 10:36:09] [INFO ] Deduced a trap composed of 79 places in 380 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:09] [INFO ] Deduced a trap composed of 79 places in 371 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:10] [INFO ] Deduced a trap composed of 79 places in 388 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:10] [INFO ] Deduced a trap composed of 78 places in 369 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:11] [INFO ] Deduced a trap composed of 78 places in 379 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:12] [INFO ] Deduced a trap composed of 79 places in 415 ms of which 102 ms to minimize.
SMT process timed out in 60239ms, After SMT, problems are : Problem set: 15 solved, 402 unsolved
Search for dead transitions found 15 dead transitions in 60245ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/488 places, 403/433 transitions.
Applied a total of 0 rules in 19 ms. Remains 473 /473 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62733 ms. Remains : 473/488 places, 403/433 transitions.
Stuttering acceptance computed with spot in 431 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) p2), (NOT p2), p2]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-09 finished in 63192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(X(X(F(p0))))))||((p0||X(X(X(F(p0)))))&&F(G(p1)))))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 477 transition count 422
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 477 transition count 422
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 475 transition count 420
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 475 transition count 420
Applied a total of 26 rules in 59 ms. Remains 475 /488 variables (removed 13) and now considering 420/433 (removed 13) transitions.
// Phase 1: matrix 420 rows 475 cols
[2025-05-30 10:36:12] [INFO ] Computed 95 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:36:13] [INFO ] Implicit Places using invariants in 675 ms returned []
[2025-05-30 10:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:36:15] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-05-30 10:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:41] [INFO ] Deduced a trap composed of 78 places in 477 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:42] [INFO ] Deduced a trap composed of 79 places in 393 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:42] [INFO ] Deduced a trap composed of 79 places in 474 ms of which 162 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:42] [INFO ] Deduced a trap composed of 79 places in 392 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:43] [INFO ] Deduced a trap composed of 79 places in 377 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:43] [INFO ] Deduced a trap composed of 78 places in 367 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:44] [INFO ] Deduced a trap composed of 78 places in 384 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:44] [INFO ] Deduced a trap composed of 78 places in 352 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:44] [INFO ] Deduced a trap composed of 80 places in 341 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:45] [INFO ] Deduced a trap composed of 80 places in 370 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:36:45] [INFO ] Deduced a trap composed of 80 places in 393 ms of which 88 ms to minimize.
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 30111ms
Starting structural reductions in LTL mode, iteration 1 : 475/488 places, 420/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33124 ms. Remains : 475/488 places, 420/433 transitions.
Stuttering acceptance computed with spot in 431 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (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-16-LTLFireability-10
Product exploration explored 100000 steps with 666 reset in 280 ms.
Product exploration explored 100000 steps with 675 reset in 335 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1087 edges and 475 vertex of which 474 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (262 resets) in 273 ms. (145 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (47 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
[2025-05-30 10:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 114/895 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/56 constraints, Generalized P Invariants (flows): 0/39 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 475 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 420/420 transitions.
Graph (trivial) has 216 edges and 475 vertex of which 6 / 475 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 1081 edges and 470 vertex of which 469 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 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 468 transition count 365
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 421 transition count 365
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 96 place count 421 transition count 265
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 313 place count 304 transition count 265
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 575 place count 171 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 577 place count 170 transition count 140
Applied a total of 577 rules in 35 ms. Remains 170 /475 variables (removed 305) and now considering 140/420 (removed 280) transitions.
// Phase 1: matrix 140 rows 170 cols
[2025-05-30 10:36:47] [INFO ] Computed 74 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:36:48] [INFO ] Implicit Places using invariants in 344 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 347 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/475 places, 140/420 transitions.
Applied a total of 0 rules in 8 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 149/475 places, 140/420 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9976 resets) in 2142 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 34309 steps (2624 resets) in 102 ms. (333 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21811 reset in 443 ms.
Product exploration explored 100000 steps with 21785 reset in 480 ms.
Built C files in :
/tmp/ltsmin14402898454523510325
[2025-05-30 10:36:50] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-05-30 10:36:50] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:36:50] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-05-30 10:36:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:36:50] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-05-30 10:36:50] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:36:50] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14402898454523510325
Running compilation step : cd /tmp/ltsmin14402898454523510325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 760 ms.
Running link step : cd /tmp/ltsmin14402898454523510325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14402898454523510325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11458037990829166759.hoa' '--buchi-type=spotba'
LTSmin run took 468 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-16-LTLFireability-10 finished in 38903 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(F((p0||X((p1&&F(p2))))))))'
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 476 transition count 421
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 476 transition count 421
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 472 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 472 transition count 417
Applied a total of 32 rules in 57 ms. Remains 472 /488 variables (removed 16) and now considering 417/433 (removed 16) transitions.
// Phase 1: matrix 417 rows 472 cols
[2025-05-30 10:36:51] [INFO ] Computed 95 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:36:52] [INFO ] Implicit Places using invariants in 471 ms returned []
[2025-05-30 10:36:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:36:54] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3133 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-30 10:36:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:19] [INFO ] Deduced a trap composed of 77 places in 286 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:19] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:20] [INFO ] Deduced a trap composed of 79 places in 247 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:20] [INFO ] Deduced a trap composed of 79 places in 240 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:20] [INFO ] Deduced a trap composed of 79 places in 238 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:21] [INFO ] Deduced a trap composed of 79 places in 355 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:21] [INFO ] Deduced a trap composed of 79 places in 259 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:21] [INFO ] Deduced a trap composed of 77 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 10:37:22] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:22] [INFO ] Deduced a trap composed of 78 places in 364 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:23] [INFO ] Deduced a trap composed of 77 places in 363 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:23] [INFO ] Deduced a trap composed of 77 places in 356 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:24] [INFO ] Deduced a trap composed of 77 places in 365 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:24] [INFO ] Deduced a trap composed of 72 places in 236 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:24] [INFO ] Deduced a trap composed of 72 places in 323 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:24] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 41 ms to minimize.
SMT process timed out in 30236ms, After SMT, problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 30237ms
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 417/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33429 ms. Remains : 472/488 places, 417/433 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 449 ms.
Product exploration explored 100000 steps with 33333 reset in 325 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1082 edges and 472 vertex of which 471 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Detected a total of 125/472 stabilizing places and 118/417 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-16-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-16-LTLFireability-11 finished in 34523 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(G(p0)))&&((p1&&X(F(p2))) U ((X(F(p2))&&p3)||G((p1&&F(p2))))))))'
Support contains 3 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 476 transition count 421
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 476 transition count 421
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 473 transition count 418
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 473 transition count 418
Applied a total of 30 rules in 35 ms. Remains 473 /488 variables (removed 15) and now considering 418/433 (removed 15) transitions.
// Phase 1: matrix 418 rows 473 cols
[2025-05-30 10:37:26] [INFO ] Computed 95 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:37:26] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-05-30 10:37:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:37:28] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2025-05-30 10:37:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:48] [INFO ] Deduced a trap composed of 77 places in 397 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:48] [INFO ] Deduced a trap composed of 79 places in 433 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:49] [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 10:37:49] [INFO ] Deduced a trap composed of 74 places in 354 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:49] [INFO ] Deduced a trap composed of 74 places in 357 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:50] [INFO ] Deduced a trap composed of 74 places in 364 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:50] [INFO ] Deduced a trap composed of 74 places in 347 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:51] [INFO ] Deduced a trap composed of 74 places in 333 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:51] [INFO ] Deduced a trap composed of 79 places in 323 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:51] [INFO ] Deduced a trap composed of 81 places in 279 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:52] [INFO ] Deduced a trap composed of 79 places in 322 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:52] [INFO ] Deduced a trap composed of 81 places in 234 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:52] [INFO ] Deduced a trap composed of 81 places in 279 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:52] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:53] [INFO ] Deduced a trap composed of 79 places in 270 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:53] [INFO ] Deduced a trap composed of 81 places in 250 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:53] [INFO ] Deduced a trap composed of 79 places in 263 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:54] [INFO ] Deduced a trap composed of 79 places in 341 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:54] [INFO ] Deduced a trap composed of 79 places in 285 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:54] [INFO ] Deduced a trap composed of 79 places in 256 ms of which 51 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:55] [INFO ] Deduced a trap composed of 79 places in 270 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:55] [INFO ] Deduced a trap composed of 81 places in 322 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:56] [INFO ] Deduced a trap composed of 81 places in 331 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:56] [INFO ] Deduced a trap composed of 79 places in 485 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:56] [INFO ] Deduced a trap composed of 79 places in 338 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:57] [INFO ] Deduced a trap composed of 79 places in 327 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:57] [INFO ] Deduced a trap composed of 81 places in 264 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:57] [INFO ] Deduced a trap composed of 77 places in 233 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:58] [INFO ] Deduced a trap composed of 77 places in 319 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:37:58] [INFO ] Deduced a trap composed of 72 places in 532 ms of which 231 ms to minimize.
SMT process timed out in 30353ms, After SMT, problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 30354ms
Starting structural reductions in LTL mode, iteration 1 : 473/488 places, 418/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32740 ms. Remains : 473/488 places, 418/433 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-13 finished in 33083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 488/488 places, 433/433 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 476 transition count 421
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 476 transition count 421
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 472 transition count 417
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 472 transition count 417
Applied a total of 32 rules in 40 ms. Remains 472 /488 variables (removed 16) and now considering 417/433 (removed 16) transitions.
// Phase 1: matrix 417 rows 472 cols
[2025-05-30 10:37:59] [INFO ] Computed 95 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:37:59] [INFO ] Implicit Places using invariants in 554 ms returned []
[2025-05-30 10:37:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 10:38:01] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-30 10:38: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/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:23] [INFO ] Deduced a trap composed of 78 places in 434 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:23] [INFO ] Deduced a trap composed of 78 places in 227 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:23] [INFO ] Deduced a trap composed of 78 places in 398 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:24] [INFO ] Deduced a trap composed of 73 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 10:38:24] [INFO ] Deduced a trap composed of 73 places in 389 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:24] [INFO ] Deduced a trap composed of 76 places in 268 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:25] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:25] [INFO ] Deduced a trap composed of 78 places in 257 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:25] [INFO ] Deduced a trap composed of 78 places in 241 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:25] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:26] [INFO ] Deduced a trap composed of 78 places in 237 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:26] [INFO ] Deduced a trap composed of 78 places in 275 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:26] [INFO ] Deduced a trap composed of 78 places in 234 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:26] [INFO ] Deduced a trap composed of 78 places in 237 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:27] [INFO ] Deduced a trap composed of 32 places in 307 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:27] [INFO ] Deduced a trap composed of 73 places in 347 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:28] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:28] [INFO ] Deduced a trap composed of 36 places in 346 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:28] [INFO ] Deduced a trap composed of 78 places in 337 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:29] [INFO ] Deduced a trap composed of 77 places in 368 ms of which 57 ms to minimize.
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 6 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:30] [INFO ] Deduced a trap composed of 80 places in 252 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:30] [INFO ] Deduced a trap composed of 80 places in 339 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:30] [INFO ] Deduced a trap composed of 80 places in 334 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:31] [INFO ] Deduced a trap composed of 80 places in 356 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:31] [INFO ] Deduced a trap composed of 80 places in 329 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:38:31] [INFO ] Deduced a trap composed of 75 places in 375 ms of which 120 ms to minimize.
SMT process timed out in 30252ms, After SMT, problems are : Problem set: 6 solved, 410 unsolved
Search for dead transitions found 6 dead transitions in 30254ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/488 places, 411/433 transitions.
Applied a total of 0 rules in 11 ms. Remains 472 /472 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32822 ms. Remains : 472/488 places, 411/433 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-14 finished in 32946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(X(p0)&&(X(X(X(p1))) U ((p1&&X(X(X(p1)))&&G(p0))||X(X(X(G(p1))))))))))'
[2025-05-30 10:38:32] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8335641550642623972
[2025-05-30 10:38:32] [INFO ] Computing symmetric may disable matrix : 433 transitions.
[2025-05-30 10:38:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:38:32] [INFO ] Applying decomposition
[2025-05-30 10:38:32] [INFO ] Computing symmetric may enable matrix : 433 transitions.
[2025-05-30 10:38:32] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:38:32] [INFO ] Flatten gal took : 23 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/graph2554915691416432269.txt' '-o' '/tmp/graph2554915691416432269.bin' '-w' '/tmp/graph2554915691416432269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2554915691416432269.bin' '-l' '-1' '-v' '-w' '/tmp/graph2554915691416432269.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:38:32] [INFO ] Decomposing Gal with order
[2025-05-30 10:38:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:38:32] [INFO ] Computing Do-Not-Accords matrix : 433 transitions.
[2025-05-30 10:38:32] [INFO ] Removed a total of 278 redundant transitions.
[2025-05-30 10:38:32] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 10:38:32] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8335641550642623972
Running compilation step : cd /tmp/ltsmin8335641550642623972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-05-30 10:38:32] [INFO ] Flatten gal took : 66 ms
[2025-05-30 10:38:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 18 ms.
[2025-05-30 10:38:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6354919608894866794.gal : 8 ms
[2025-05-30 10:38:32] [INFO ] Time to serialize properties into /tmp/LTLFireability16661089380455638618.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6354919608894866794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16661089380455638618.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...277
Read 1 LTL properties
Checking formula 0 : !(((X("(i5.i0.u163.p613!=1)"))U((X(G("(i5.i0.u163.p613!=1)")))||((X("(i5.i0.u163.p613!=1)"))&&((X(X(X("(i11.i0.u12.p32!=1)"))))U(((("(...283
Formula 0 simplified : X!"(i5.i0.u163.p613!=1)" R (XF!"(i5.i0.u163.p613!=1)" & (X!"(i5.i0.u163.p613!=1)" | (XXX!"(i11.i0.u12.p32!=1)" R (XXXF!"(i11.i0.u12....249
Compilation finished in 1634 ms.
Running link step : cd /tmp/ltsmin8335641550642623972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8335641550642623972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U (X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&(X(X(X((LTLAPp1==true)))) U (((LTLAPp1==true)&&X(X(X((LTLAPp1==true))))&&[]((LTLAPp0==true)))||X(X(X([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t184, t256, t278, t283, t293, t400, t410, t411, i0.i0.u75.t187, i0.i0.u79.t1...1484
Computing Next relation with stutter on 1215 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.033: LTL layer: formula: (X((LTLAPp0==true)) U (X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&(X(X(X((LTLAPp1==true)))) U (((LTLAPp1==true)&&X(X(X((LTLAPp1==true))))&&[]((LTLAPp0==true)))||X(X(X([]((LTLAPp1==true))))))))))
pins2lts-mc-linux64( 2/ 8), 0.033: "(X((LTLAPp0==true)) U (X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&(X(X(X((LTLAPp1==true)))) U (((LTLAPp1==true)&&X(X(X((LTLAPp1==true))))&&[]((LTLAPp0==true)))||X(X(X([]((LTLAPp1==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.034: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.046: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.122: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.142: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.160: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.310: DFS-FIFO for weak LTL, using special progress label 436
pins2lts-mc-linux64( 0/ 8), 0.311: There are 437 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.311: State length is 489, there are 457 groups
pins2lts-mc-linux64( 0/ 8), 0.311: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.311: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.311: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.311: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.363: ~1 levels ~960 states ~4496 transitions
pins2lts-mc-linux64( 0/ 8), 0.425: ~1 levels ~1920 states ~10136 transitions
pins2lts-mc-linux64( 0/ 8), 0.554: ~1 levels ~3840 states ~21232 transitions
pins2lts-mc-linux64( 0/ 8), 0.769: ~1 levels ~7680 states ~46408 transitions
pins2lts-mc-linux64( 4/ 8), 1.229: ~1 levels ~15360 states ~112608 transitions
pins2lts-mc-linux64( 4/ 8), 2.090: ~1 levels ~30720 states ~241016 transitions
pins2lts-mc-linux64( 0/ 8), 3.628: ~1 levels ~61440 states ~502832 transitions
pins2lts-mc-linux64( 2/ 8), 6.093: ~1 levels ~122880 states ~967888 transitions
pins2lts-mc-linux64( 2/ 8), 10.462: ~1 levels ~245760 states ~2137240 transitions
pins2lts-mc-linux64( 6/ 8), 17.652: ~1 levels ~491520 states ~4515440 transitions
pins2lts-mc-linux64( 2/ 8), 30.105: ~1 levels ~983040 states ~9539432 transitions
pins2lts-mc-linux64( 2/ 8), 55.325: ~1 levels ~1966080 states ~20250664 transitions
pins2lts-mc-linux64( 2/ 8), 108.611: ~1 levels ~3932160 states ~43746392 transitions
pins2lts-mc-linux64( 2/ 8), 214.620: ~1 levels ~7864320 states ~90658504 transitions
pins2lts-mc-linux64( 2/ 8), 433.194: ~1 levels ~15728640 states ~188406280 transitions
pins2lts-mc-linux64( 3/ 8), 547.935: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 548.106:
pins2lts-mc-linux64( 0/ 8), 548.106: mean standard work distribution: 4.9% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 548.106:
pins2lts-mc-linux64( 0/ 8), 548.106: Explored 17601681 states 238359335 transitions, fanout: 13.542
pins2lts-mc-linux64( 0/ 8), 548.106: Total exploration time 547.790 sec (547.650 sec minimum, 547.708 sec on average)
pins2lts-mc-linux64( 0/ 8), 548.106: States per second: 32132, Transitions per second: 435129
pins2lts-mc-linux64( 0/ 8), 548.106:
pins2lts-mc-linux64( 0/ 8), 548.106: Progress states detected: 36467256
pins2lts-mc-linux64( 0/ 8), 548.106: Redundant explorations: -51.7330
pins2lts-mc-linux64( 0/ 8), 548.106:
pins2lts-mc-linux64( 0/ 8), 548.106: Queue width: 8B, total height: 30866881, memory: 235.50MB
pins2lts-mc-linux64( 0/ 8), 548.106: Tree memory: 534.2MB, 15.4 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 548.106: Tree fill ratio (roots/leafs): 27.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 548.106: Stored 442 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 548.106: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 548.106: Est. total memory use: 769.7MB (~1259.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8335641550642623972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U (X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&(X(X(X((LTLAPp1==true)))) U (((LTLAPp1==true)&&X(X(X((LTLAPp1==true))))&&[]((LTLAPp0==true)))||X(X(X([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8335641550642623972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U (X([]((LTLAPp0==true)))||(X((LTLAPp0==true))&&(X(X(X((LTLAPp1==true)))) U (((LTLAPp1==true)&&X(X(X((LTLAPp1==true))))&&[]((LTLAPp0==true)))||X(X(X([]((LTLAPp1==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 11:01:44] [INFO ] Applying decomposition
[2025-05-30 11:01:44] [INFO ] Flatten gal took : 24 ms
[2025-05-30 11:01:44] [INFO ] Decomposing Gal with order
[2025-05-30 11:01:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:01:44] [INFO ] Removed a total of 146 redundant transitions.
[2025-05-30 11:01:44] [INFO ] Flatten gal took : 64 ms
[2025-05-30 11:01:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 177 ms.
[2025-05-30 11:01:44] [INFO ] Time to serialize gal into /tmp/LTLFireability4423559732046514838.gal : 11 ms
[2025-05-30 11:01:44] [INFO ] Time to serialize properties into /tmp/LTLFireability15568220561737977780.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/LTLFireability4423559732046514838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15568220561737977780.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...277
Read 1 LTL properties
Checking formula 0 : !(((X("(i1.i2.u138.p613!=1)"))U((X(G("(i1.i2.u138.p613!=1)")))||((X("(i1.i2.u138.p613!=1)"))&&((X(X(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....579
Formula 0 simplified : X!"(i1.i2.u138.p613!=1)" R (XF!"(i1.i2.u138.p613!=1)" & (X!"(i1.i2.u138.p613!=1)" | (XXX!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...545
Detected timeout of ITS tools.
[2025-05-30 11:25:00] [INFO ] Flatten gal took : 713 ms
[2025-05-30 11:25:02] [INFO ] Input system was already deterministic with 433 transitions.
[2025-05-30 11:25:02] [INFO ] Transformed 488 places.
[2025-05-30 11:25:02] [INFO ] Transformed 433 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 11:25:32] [INFO ] Time to serialize gal into /tmp/LTLFireability5769290241043558324.gal : 16 ms
[2025-05-30 11:25:32] [INFO ] Time to serialize properties into /tmp/LTLFireability14425951429849330247.ltl : 13 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/LTLFireability5769290241043558324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14425951429849330247.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X("(p613!=1)"))U((X(G("(p613!=1)")))||((X("(p613!=1)"))&&((X(X(X("(p32!=1)"))))U(((("(p32!=1)")&&(X(X(X("(p32!=1)")))))&&(G("(p613...195
Formula 0 simplified : X!"(p613!=1)" R (XF!"(p613!=1)" & (X!"(p613!=1)" | (XXX!"(p32!=1)" R (XXXF!"(p32!=1)" & (!"(p32!=1)" | F!"(p613!=1)" | XXX!"(p32!=1)...161

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
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-16, 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-174853813400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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