Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399600484.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 11 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225128532

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:58:49] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-01 06:58:49] [INFO ] Transformed 368 places.
[2024-06-01 06:58:49] [INFO ] Transformed 319 transitions.
[2024-06-01 06:58:49] [INFO ] Found NUPN structural information;
[2024-06-01 06:58:50] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 53 place count 314 transition count 267
Iterating global reduction 1 with 51 rules applied. Total rules applied 104 place count 314 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 314 transition count 266
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 135 place count 284 transition count 236
Iterating global reduction 2 with 30 rules applied. Total rules applied 165 place count 284 transition count 236
Applied a total of 165 rules in 87 ms. Remains 284 /367 variables (removed 83) and now considering 236/318 (removed 82) transitions.
// Phase 1: matrix 236 rows 284 cols
[2024-06-01 06:58:50] [INFO ] Computed 55 invariants in 21 ms
[2024-06-01 06:58:50] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-06-01 06:58:50] [INFO ] Invariant cache hit.
[2024-06-01 06:58:50] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-06-01 06:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 24 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 3 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:53] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 3 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:54] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 2 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 6 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 3 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 16 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:58:58] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 17/112 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 236/520 variables, 284/399 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 16/415 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 0/520 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 415 constraints, problems are : Problem set: 0 solved, 235 unsolved in 22949 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 76/131 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:59:15] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:59:16] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 10/141 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:17] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 236/520 variables, 284/429 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 235/664 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-01 06:59:20] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:59:21] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 4 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:22] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:23] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 20/684 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 3 ms to minimize.
[2024-06-01 06:59:26] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:59:27] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:59:28] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:59:29] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:59:30] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-06-01 06:59:34] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:59:35] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:59:35] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:35] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:35] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:59:36] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:59:36] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:59:37] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:59:39] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 3 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:40] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:59:41] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:43] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 723 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 149/149 constraints]
After SMT, in 53059ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 53075ms
Starting structural reductions in LTL mode, iteration 1 : 284/367 places, 236/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53732 ms. Remains : 284/367 places, 236/318 transitions.
Support contains 33 out of 284 places after structural reductions.
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 72 ms
[2024-06-01 06:59:44] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:59:44] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 30 out of 284 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (372 resets) in 1458 ms. (27 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40004 steps (70 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (70 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
[2024-06-01 06:59:45] [INFO ] Invariant cache hit.
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/35 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 237/272 variables, 52/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:59:45] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 12/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 223/495 variables, 272/339 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 1/340 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 18/513 variables, 8/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:59:46] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 3/351 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/351 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/520 variables, 4/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/520 variables, 0/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 355 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2088 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/42 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/72 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 235/307 variables, 52/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 1/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 13/81 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 208/515 variables, 269/352 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:47] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 9/361 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/361 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/520 variables, 4/365 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 3/368 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:59:48] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 3/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/520 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 371 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 30/30 constraints]
After SMT, in 3339ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 399 ms.
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 148 edges and 284 vertex of which 6 / 284 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 589 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 278 transition count 187
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 238 transition count 187
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 82 place count 238 transition count 133
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 203 place count 171 transition count 133
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 216 place count 158 transition count 120
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 230 place count 157 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 230 place count 157 transition count 119
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 232 place count 156 transition count 119
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 378 place count 82 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 81 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 380 place count 80 transition count 46
Applied a total of 380 rules in 76 ms. Remains 80 /284 variables (removed 204) and now considering 46/236 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 80/284 places, 46/236 transitions.
RANDOM walk for 1099 steps (41 resets) in 42 ms. (25 steps per ms) remains 0/2 properties
FORMULA BusinessProcesses-PT-05-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 278 stabilizing places and 228 stable transitions
Graph (complete) has 596 edges and 284 vertex of which 283 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 271 transition count 223
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 271 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 269 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 34 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-06-01 06:59:49] [INFO ] Computed 55 invariants in 6 ms
[2024-06-01 06:59:49] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 06:59:49] [INFO ] Invariant cache hit.
[2024-06-01 06:59:49] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 06:59:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:59:52] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:59:53] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:54] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:59:55] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/351 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:59:57] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 68 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:59:58] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:01] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:00:02] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:00:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/490 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 362 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18153 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:09] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 3 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:00:10] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/374 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/594 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:00:13] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:14] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:00:15] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:16] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 10/604 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:20] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:00:22] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:22] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:27] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:34] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:00:34] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:00:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:00:36] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 613 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 69/69 constraints]
After SMT, in 48224ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 48230ms
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48715 ms. Remains : 269/284 places, 221/236 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 1050 reset in 263 ms.
Stack based approach found an accepted trace after 2190 steps with 23 reset with depth 7 and stack size 7 in 6 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-00 finished in 49423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 271 transition count 223
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 271 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 269 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 13 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-06-01 07:00:38] [INFO ] Computed 55 invariants in 2 ms
[2024-06-01 07:00:39] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 07:00:39] [INFO ] Invariant cache hit.
[2024-06-01 07:00:39] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 07:00:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 3 ms to minimize.
[2024-06-01 07:00:41] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 4 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:00:42] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:43] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:44] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:00:45] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:00:45] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:00:45] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:00:45] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 16/91 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:00:46] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:00:47] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:48] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 221/490 variables, 269/364 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:00:50] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:00:51] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 6/370 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/490 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 370 constraints, problems are : Problem set: 0 solved, 220 unsolved in 17690 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/490 variables, 269/370 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 220/590 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:01] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:02] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:03] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:01:04] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:01:05] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/610 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:01:07] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:01:08] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:01:09] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:10] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:11] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 10/620 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:17] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:01:19] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:01:26] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 627 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 83/83 constraints]
After SMT, in 47762ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 47768ms
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48337 ms. Remains : 269/284 places, 221/236 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-01 finished in 48555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 147 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 277 transition count 189
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 238 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 237 transition count 188
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 82 place count 237 transition count 134
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 203 place count 170 transition count 134
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 216 place count 157 transition count 121
Ensure Unique test removed 1 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 230 place count 156 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 230 place count 156 transition count 120
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 232 place count 155 transition count 120
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 374 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 375 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 376 place count 81 transition count 49
Applied a total of 376 rules in 53 ms. Remains 81 /284 variables (removed 203) and now considering 49/236 (removed 187) transitions.
// Phase 1: matrix 49 rows 81 cols
[2024-06-01 07:01:27] [INFO ] Computed 38 invariants in 1 ms
[2024-06-01 07:01:27] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 07:01:27] [INFO ] Invariant cache hit.
[2024-06-01 07:01:27] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 200 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/284 places, 49/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 43 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 36 transition count 42
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 31 transition count 37
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 31 transition count 37
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 31 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 28 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 40 place count 23 transition count 29
Applied a total of 40 rules in 8 ms. Remains 23 /43 variables (removed 20) and now considering 29/49 (removed 20) transitions.
// Phase 1: matrix 29 rows 23 cols
[2024-06-01 07:01:27] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 07:01:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 07:01:27] [INFO ] Invariant cache hit.
[2024-06-01 07:01:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/284 places, 29/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 335 ms. Remains : 23/284 places, 29/236 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-02
Stuttering criterion allowed to conclude after 371 steps with 82 reset in 2 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-02 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 269 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 269 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 267 transition count 219
Applied a total of 34 rules in 14 ms. Remains 267 /284 variables (removed 17) and now considering 219/236 (removed 17) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-06-01 07:01:27] [INFO ] Computed 55 invariants in 3 ms
[2024-06-01 07:01:27] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 07:01:27] [INFO ] Invariant cache hit.
[2024-06-01 07:01:28] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-01 07:01:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 5 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 356 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13603 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:01:43] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:01:46] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 3 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:01:47] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:01:48] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:01:49] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 13/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:02:00] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/486 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:02:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 601 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 61/61 constraints]
After SMT, in 43670ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 43673ms
Starting structural reductions in LTL mode, iteration 1 : 267/284 places, 219/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44057 ms. Remains : 267/284 places, 219/236 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Computed a total of 261 stabilizing places and 211 stable transitions
Graph (complete) has 574 edges and 267 vertex of which 266 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 261 stabilizing places and 211 stable transitions
Detected a total of 261/267 stabilizing places and 211/219 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 41 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-03 finished in 44509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 147 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 277 transition count 187
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 236 transition count 187
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 84 place count 236 transition count 134
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 203 place count 170 transition count 134
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 215 place count 158 transition count 122
Ensure Unique test removed 1 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 228 place count 157 transition count 122
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 372 place count 84 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 373 place count 83 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 374 place count 82 transition count 50
Applied a total of 374 rules in 30 ms. Remains 82 /284 variables (removed 202) and now considering 50/236 (removed 186) transitions.
// Phase 1: matrix 50 rows 82 cols
[2024-06-01 07:02:12] [INFO ] Computed 38 invariants in 1 ms
[2024-06-01 07:02:12] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-06-01 07:02:12] [INFO ] Invariant cache hit.
[2024-06-01 07:02:12] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 59, 61, 63]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 543 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/284 places, 50/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 61 transition count 48
Applied a total of 4 rules in 4 ms. Remains 61 /63 variables (removed 2) and now considering 48/50 (removed 2) transitions.
// Phase 1: matrix 48 rows 61 cols
[2024-06-01 07:02:12] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 07:02:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 07:02:12] [INFO ] Invariant cache hit.
[2024-06-01 07:02:12] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/284 places, 48/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 687 ms. Remains : 61/284 places, 48/236 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-04 finished in 801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||G(p2)))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 272 transition count 224
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 272 transition count 224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 270 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 270 transition count 222
Applied a total of 28 rules in 12 ms. Remains 270 /284 variables (removed 14) and now considering 222/236 (removed 14) transitions.
// Phase 1: matrix 222 rows 270 cols
[2024-06-01 07:02:13] [INFO ] Computed 55 invariants in 2 ms
[2024-06-01 07:02:13] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 07:02:13] [INFO ] Invariant cache hit.
[2024-06-01 07:02:13] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-01 07:02:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:15] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:16] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:02:17] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:02:18] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:20] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/492 variables, 270/356 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:02:23] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:02:24] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/492 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 366 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16852 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 41/96 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:31] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:02:32] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:33] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:34] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:35] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:02:36] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 222/492 variables, 270/386 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 221/607 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:02:39] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:02:40] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:02:41] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:02:43] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:02:45] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:02:48] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:02:50] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 6/633 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-01 07:02:55] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 634 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 88/88 constraints]
After SMT, in 46914ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 46918ms
Starting structural reductions in LTL mode, iteration 1 : 270/284 places, 222/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47284 ms. Remains : 270/284 places, 222/236 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 264 stabilizing places and 214 stable transitions
Graph (complete) has 579 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 264 stabilizing places and 214 stable transitions
Detected a total of 264/270 stabilizing places and 214/222 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 31 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-07 finished in 47840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 145 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 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 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 277 transition count 189
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 238 transition count 189
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 80 place count 238 transition count 137
Deduced a syphon composed of 52 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 196 place count 174 transition count 137
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 209 place count 161 transition count 124
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 223 place count 160 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 223 place count 160 transition count 123
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 225 place count 159 transition count 123
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 369 place count 86 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 85 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 371 place count 84 transition count 51
Applied a total of 371 rules in 38 ms. Remains 84 /284 variables (removed 200) and now considering 51/236 (removed 185) transitions.
// Phase 1: matrix 51 rows 84 cols
[2024-06-01 07:03:00] [INFO ] Computed 39 invariants in 1 ms
[2024-06-01 07:03:01] [INFO ] Implicit Places using invariants in 89 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/284 places, 51/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 83/284 places, 51/236 transitions.
Stuttering acceptance computed with spot in 112 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))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 15287 reset in 217 ms.
Product exploration explored 100000 steps with 15366 reset in 218 ms.
Computed a total of 83 stabilizing places and 50 stable transitions
Computed a total of 83 stabilizing places and 50 stable transitions
Detected a total of 83/83 stabilizing places and 50/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 1994 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 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))]
RANDOM walk for 40000 steps (7390 resets) in 837 ms. (47 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40000 steps (2856 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
// Phase 1: matrix 51 rows 83 cols
[2024-06-01 07:03:04] [INFO ] Computed 38 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/18 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/69 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/71 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 61/132 variables, 60/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 29/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 133/134 variables, and 121 constraints, problems are : Problem set: 1 solved, 0 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (OR p1 p0) (OR p2 p0))))]
Knowledge based reduction with 15 factoid took 2177 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 83 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 : 83/83 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-06-01 07:03:06] [INFO ] Invariant cache hit.
[2024-06-01 07:03:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 07:03:06] [INFO ] Invariant cache hit.
[2024-06-01 07:03:06] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [0, 1, 2, 3, 4, 5, 6, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 61, 63]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 151 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/83 places, 51/51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 46 transition count 44
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 39 transition count 44
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 34 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 34 transition count 39
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 34 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 30 place count 31 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 30 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 30 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 42 place count 25 transition count 30
Applied a total of 42 rules in 6 ms. Remains 25 /46 variables (removed 21) and now considering 30/51 (removed 21) transitions.
// Phase 1: matrix 30 rows 25 cols
[2024-06-01 07:03:06] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 07:03:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:03:06] [INFO ] Invariant cache hit.
[2024-06-01 07:03:06] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/83 places, 30/51 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 25/83 places, 30/51 transitions.
Computed a total of 25 stabilizing places and 29 stable transitions
Graph (complete) has 66 edges and 25 vertex of which 23 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 25 stabilizing places and 29 stable transitions
Detected a total of 25/25 stabilizing places and 29/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 6878 steps (1320 resets) in 20 ms. (327 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 466 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering criterion allowed to conclude after 1071 steps with 166 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-09 finished in 6999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p1))&&p0))))'
Support contains 4 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 270 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 270 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 9 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-06-01 07:03:07] [INFO ] Computed 55 invariants in 1 ms
[2024-06-01 07:03:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 07:03:08] [INFO ] Invariant cache hit.
[2024-06-01 07:03:08] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 07:03:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:10] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:03:11] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:03:12] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 6 ms to minimize.
[2024-06-01 07:03:13] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:03:15] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/360 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:17] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:17] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:18] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:03:19] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 14/374 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:21] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/490 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 0/490 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 375 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18463 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 51/106 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/376 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/596 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:03:30] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:31] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:32] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:03:33] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 62 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:03:34] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 17/613 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:03:38] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:03:39] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:03:40] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:03:41] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 7/620 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:45] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:51] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:03:52] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:03:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 5/626 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 626 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 82/82 constraints]
After SMT, in 48503ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 48506ms
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48961 ms. Remains : 269/284 places, 221/236 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-10 finished in 49145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 148 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 277 transition count 188
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 237 transition count 188
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 82 place count 237 transition count 135
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 201 place count 171 transition count 135
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 214 place count 158 transition count 122
Ensure Unique test removed 1 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 228 place count 157 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 228 place count 157 transition count 121
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 230 place count 156 transition count 121
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 376 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 377 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 378 place count 80 transition count 48
Applied a total of 378 rules in 32 ms. Remains 80 /284 variables (removed 204) and now considering 48/236 (removed 188) transitions.
// Phase 1: matrix 48 rows 80 cols
[2024-06-01 07:03:57] [INFO ] Computed 38 invariants in 1 ms
[2024-06-01 07:03:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 07:03:57] [INFO ] Invariant cache hit.
[2024-06-01 07:03:57] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 262 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/284 places, 48/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 43 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 36 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 31 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 31 transition count 36
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 31 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 28 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 28 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 42 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 22 transition count 26
Applied a total of 43 rules in 17 ms. Remains 22 /43 variables (removed 21) and now considering 26/48 (removed 22) transitions.
// Phase 1: matrix 26 rows 22 cols
[2024-06-01 07:03:57] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:03:57] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 07:03:57] [INFO ] Invariant cache hit.
[2024-06-01 07:03:57] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/284 places, 26/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 393 ms. Remains : 22/284 places, 26/236 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-12 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U p2))))'
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 270 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 270 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 269 transition count 221
Applied a total of 30 rules in 24 ms. Remains 269 /284 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 269 cols
[2024-06-01 07:03:57] [INFO ] Computed 55 invariants in 2 ms
[2024-06-01 07:03:57] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 07:03:57] [INFO ] Invariant cache hit.
[2024-06-01 07:03:57] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 07:03:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:03:59] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:04:00] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:04:01] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:02] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:04] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/353 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:04:07] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:04:08] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:04:09] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 7/360 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:11] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/490 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:04:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/490 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:04:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:04:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/490 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 14 (OVERLAPS) 0/490 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 366 constraints, problems are : Problem set: 0 solved, 220 unsolved in 24479 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 42/97 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:23] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:24] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/375 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/595 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:04:27] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:04:28] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:04:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:04:30] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 9/604 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:04:32] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:04:34] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:04:35] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 7/611 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:04:44] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-01 07:04:48] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:04:48] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 615 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 71/71 constraints]
After SMT, in 54535ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 54538ms
Starting structural reductions in LTL mode, iteration 1 : 269/284 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54948 ms. Remains : 269/284 places, 221/236 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-13 finished in 55118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 269 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 269 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 267 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 267 transition count 219
Applied a total of 34 rules in 10 ms. Remains 267 /284 variables (removed 17) and now considering 219/236 (removed 17) transitions.
// Phase 1: matrix 219 rows 267 cols
[2024-06-01 07:04:52] [INFO ] Computed 55 invariants in 2 ms
[2024-06-01 07:04:52] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 07:04:52] [INFO ] Invariant cache hit.
[2024-06-01 07:04:53] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-01 07:04:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:04:54] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 14 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:04:55] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:04:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:04:57] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/349 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:05:00] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:05:01] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/486 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 356 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12581 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:05:07] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:05:10] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:05:11] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:05:12] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:05:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 13/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:05:23] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/486 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:05:30] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 601 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 61/61 constraints]
After SMT, in 42628ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 42631ms
Starting structural reductions in LTL mode, iteration 1 : 267/284 places, 219/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42989 ms. Remains : 267/284 places, 219/236 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-14
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-14 finished in 43124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1&&G(p2))))'
Support contains 5 out of 284 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 284/284 places, 236/236 transitions.
Graph (trivial) has 145 edges and 284 vertex of which 6 / 284 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 590 edges and 279 vertex of which 278 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 277 transition count 188
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 237 transition count 188
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 82 place count 237 transition count 137
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 196 place count 174 transition count 137
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 208 place count 162 transition count 125
Iterating global reduction 2 with 12 rules applied. Total rules applied 220 place count 162 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 368 place count 87 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 369 place count 86 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 370 place count 85 transition count 51
Applied a total of 370 rules in 28 ms. Remains 85 /284 variables (removed 199) and now considering 51/236 (removed 185) transitions.
// Phase 1: matrix 51 rows 85 cols
[2024-06-01 07:05:35] [INFO ] Computed 40 invariants in 0 ms
[2024-06-01 07:05:35] [INFO ] Implicit Places using invariants in 128 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/284 places, 51/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 172 ms. Remains : 84/284 places, 51/236 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-15 finished in 281 ms.
All properties solved by simple procedures.
Total runtime 406284 ms.
ITS solved all properties within timeout

BK_STOP 1717225536116

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-05, 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 r472-tajo-171620399600484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;