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-171620399800580.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-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 161K 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-17-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717226020152

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-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:13:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:13:41] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-01 07:13:41] [INFO ] Transformed 650 places.
[2024-06-01 07:13:41] [INFO ] Transformed 580 transitions.
[2024-06-01 07:13:41] [INFO ] Found NUPN structural information;
[2024-06-01 07:13:41] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 91 place count 555 transition count 488
Iterating global reduction 1 with 88 rules applied. Total rules applied 179 place count 555 transition count 488
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 223 place count 511 transition count 444
Iterating global reduction 1 with 44 rules applied. Total rules applied 267 place count 511 transition count 444
Applied a total of 267 rules in 149 ms. Remains 511 /646 variables (removed 135) and now considering 444/576 (removed 132) transitions.
// Phase 1: matrix 444 rows 511 cols
[2024-06-01 07:13:42] [INFO ] Computed 105 invariants in 44 ms
[2024-06-01 07:13:42] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-06-01 07:13:42] [INFO ] Invariant cache hit.
[2024-06-01 07:13:43] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-06-01 07:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/511 variables, 62/101 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 23 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 104 places in 199 ms of which 3 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 11 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 3 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 16 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 73 places in 280 ms of which 6 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 100 places in 234 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 95 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 92 places in 229 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:13:57] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:58] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:13:59] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 4 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 96 places in 231 ms of which 4 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 4 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 20/185 constraints. Problems are: Problem set: 2 solved, 441 unsolved
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 4 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 2 solved, 441 unsolved
Search for dead transitions found 2 dead transitions in 30330ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 511/646 places, 442/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 511 /511 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31549 ms. Remains : 511/646 places, 442/576 transitions.
Support contains 29 out of 511 places after structural reductions.
[2024-06-01 07:14:13] [INFO ] Flatten gal took : 94 ms
[2024-06-01 07:14:13] [INFO ] Flatten gal took : 45 ms
[2024-06-01 07:14:13] [INFO ] Input system was already deterministic with 442 transitions.
RANDOM walk for 40000 steps (261 resets) in 1761 ms. (22 steps per ms) remains 7/24 properties
BEST_FIRST walk for 40003 steps (44 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (44 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (44 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (44 resets) in 119 ms. (333 steps per ms) remains 6/7 properties
// Phase 1: matrix 442 rows 511 cols
[2024-06-01 07:14:14] [INFO ] Computed 105 invariants in 17 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 178/189 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:14:15] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 88 places in 751 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 212/401 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
SMT process timed out in 5072ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 442/442 transitions.
Graph (trivial) has 232 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1136 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 504 transition count 379
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 450 transition count 379
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 110 place count 450 transition count 275
Deduced a syphon composed of 104 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 338 place count 326 transition count 275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 343 place count 321 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 348 place count 321 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 348 place count 321 transition count 269
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 350 place count 320 transition count 269
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 613 place count 186 transition count 140
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 616 place count 186 transition count 137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 619 place count 183 transition count 137
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 624 place count 183 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 625 place count 182 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 626 place count 181 transition count 136
Applied a total of 626 rules in 126 ms. Remains 181 /511 variables (removed 330) and now considering 136/442 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 181/511 places, 136/442 transitions.
RANDOM walk for 40000 steps (771 resets) in 776 ms. (51 steps per ms) remains 1/6 properties
BEST_FIRST walk for 9812 steps (49 resets) in 51 ms. (188 steps per ms) remains 0/1 properties
Computed a total of 213 stabilizing places and 185 stable transitions
Graph (complete) has 1144 edges and 511 vertex of which 510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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(G(p0))))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 432
Applied a total of 20 rules in 25 ms. Remains 501 /511 variables (removed 10) and now considering 432/442 (removed 10) transitions.
// Phase 1: matrix 432 rows 501 cols
[2024-06-01 07:14:20] [INFO ] Computed 105 invariants in 4 ms
[2024-06-01 07:14:20] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 07:14:20] [INFO ] Invariant cache hit.
[2024-06-01 07:14:21] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:14:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 91 places in 351 ms of which 3 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:14:30] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:31] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:32] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 20 solved, 411 unsolved
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:33] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 408 unsolved
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 14 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 4 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 4 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 15 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/933 variables, and 225 constraints, problems are : Problem set: 26 solved, 405 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:56] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:57] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:58] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
Problem TDEAD366 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:15:11] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:13] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/325 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:16] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:17] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:18] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:19] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 3 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/345 constraints. Problems are: Problem set: 30 solved, 401 unsolved
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:21] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/933 variables, and 349 constraints, problems are : Problem set: 30 solved, 401 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 244/244 constraints]
After SMT, in 60162ms problems are : Problem set: 30 solved, 401 unsolved
Search for dead transitions found 30 dead transitions in 60178ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 402/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 402
Applied a total of 1 rules in 14 ms. Remains 500 /501 variables (removed 1) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 500 cols
[2024-06-01 07:15:21] [INFO ] Computed 109 invariants in 12 ms
[2024-06-01 07:15:22] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 07:15:22] [INFO ] Invariant cache hit.
[2024-06-01 07:15:22] [INFO ] Implicit Places using invariants and state equation in 465 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 739 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/511 places, 402/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61831 ms. Remains : 498/511 places, 402/442 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-00
Entered a terminal (fully accepting) state of product in 93 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-00 finished in 62108 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&&G(p1)))))))'
Support contains 2 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 432
Applied a total of 20 rules in 35 ms. Remains 501 /511 variables (removed 10) and now considering 432/442 (removed 10) transitions.
// Phase 1: matrix 432 rows 501 cols
[2024-06-01 07:15:22] [INFO ] Computed 105 invariants in 4 ms
[2024-06-01 07:15:23] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-06-01 07:15:23] [INFO ] Invariant cache hit.
[2024-06-01 07:15:23] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 20 solved, 411 unsolved
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 408 unsolved
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 112 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/933 variables, and 225 constraints, problems are : Problem set: 26 solved, 405 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 16 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/325 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/345 constraints. Problems are: Problem set: 30 solved, 401 unsolved
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 60208ms, After SMT, problems are : Problem set: 30 solved, 401 unsolved
Search for dead transitions found 30 dead transitions in 60216ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 402/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 402
Applied a total of 1 rules in 12 ms. Remains 500 /501 variables (removed 1) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 500 cols
[2024-06-01 07:16:23] [INFO ] Computed 109 invariants in 3 ms
[2024-06-01 07:16:24] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-01 07:16:24] [INFO ] Invariant cache hit.
[2024-06-01 07:16:24] [INFO ] Implicit Places using invariants and state equation in 471 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 774 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/511 places, 402/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61821 ms. Remains : 498/511 places, 402/442 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-01
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-01 finished in 62036 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(p0)))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 432
Applied a total of 20 rules in 26 ms. Remains 501 /511 variables (removed 10) and now considering 432/442 (removed 10) transitions.
// Phase 1: matrix 432 rows 501 cols
[2024-06-01 07:16:24] [INFO ] Computed 105 invariants in 4 ms
[2024-06-01 07:16:24] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 07:16:25] [INFO ] Invariant cache hit.
[2024-06-01 07:16:25] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:16:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 20 solved, 411 unsolved
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:36] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 4 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 408 unsolved
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 88 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 5 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 69 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/933 variables, and 225 constraints, problems are : Problem set: 26 solved, 405 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
Problem TDEAD366 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/325 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/345 constraints. Problems are: Problem set: 30 solved, 401 unsolved
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 2 ms to minimize.
SMT process timed out in 60263ms, After SMT, problems are : Problem set: 30 solved, 401 unsolved
Search for dead transitions found 30 dead transitions in 60271ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 402/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 402
Applied a total of 1 rules in 8 ms. Remains 500 /501 variables (removed 1) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 500 cols
[2024-06-01 07:17:25] [INFO ] Computed 109 invariants in 3 ms
[2024-06-01 07:17:25] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 07:17:25] [INFO ] Invariant cache hit.
[2024-06-01 07:17:26] [INFO ] Implicit Places using invariants and state equation in 393 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 606 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/511 places, 402/442 transitions.
Applied a total of 0 rules in 7 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61629 ms. Remains : 498/511 places, 402/442 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 652 reset in 239 ms.
Product exploration explored 100000 steps with 658 reset in 313 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1056 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (265 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 83655 steps, run visited all 1 properties in 297 ms. (steps per millisecond=281 )
Probabilistic random walk after 83655 steps, saw 18135 distinct states, run finished after 307 ms. (steps per millisecond=272 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-02 finished in 63126 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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 432
Applied a total of 20 rules in 34 ms. Remains 501 /511 variables (removed 10) and now considering 432/442 (removed 10) transitions.
// Phase 1: matrix 432 rows 501 cols
[2024-06-01 07:17:27] [INFO ] Computed 105 invariants in 3 ms
[2024-06-01 07:17:28] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-01 07:17:28] [INFO ] Invariant cache hit.
[2024-06-01 07:17:28] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 5 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 95 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 20 solved, 411 unsolved
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 408 unsolved
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 105 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 72 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:57] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:58] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/933 variables, and 225 constraints, problems are : Problem set: 26 solved, 405 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 85 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/325 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/345 constraints. Problems are: Problem set: 30 solved, 401 unsolved
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 20/365 constraints. Problems are: Problem set: 30 solved, 401 unsolved
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
SMT process timed out in 60207ms, After SMT, problems are : Problem set: 30 solved, 401 unsolved
Search for dead transitions found 30 dead transitions in 60212ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 402/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 402
Applied a total of 1 rules in 9 ms. Remains 500 /501 variables (removed 1) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 500 cols
[2024-06-01 07:18:28] [INFO ] Computed 109 invariants in 4 ms
[2024-06-01 07:18:29] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 07:18:29] [INFO ] Invariant cache hit.
[2024-06-01 07:18:29] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 705 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/511 places, 402/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 498 /498 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61738 ms. Remains : 498/511 places, 402/442 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1056 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/498 stabilizing places and 178/402 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 10 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-17-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-03 finished in 62219 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) U G(p0)))'
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 434
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 434
Applied a total of 16 rules in 12 ms. Remains 503 /511 variables (removed 8) and now considering 434/442 (removed 8) transitions.
// Phase 1: matrix 434 rows 503 cols
[2024-06-01 07:18:30] [INFO ] Computed 105 invariants in 3 ms
[2024-06-01 07:18:30] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 07:18:30] [INFO ] Invariant cache hit.
[2024-06-01 07:18:30] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 07:18:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:39] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 9 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 16 solved, 417 unsolved
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 16 solved, 417 unsolved
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 16 solved, 417 unsolved
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 85 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 1 ms to minimize.
Problem TDEAD403 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 17 solved, 416 unsolved
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD377 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 20 solved, 413 unsolved
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
Problem TDEAD407 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 20/225 constraints. Problems are: Problem set: 21 solved, 412 unsolved
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 21 solved, 412 unsolved
Search for dead transitions found 21 dead transitions in 30135ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/511 places, 413/442 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30790 ms. Remains : 503/511 places, 413/442 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-07 finished in 30873 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))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 432
Applied a total of 20 rules in 18 ms. Remains 501 /511 variables (removed 10) and now considering 432/442 (removed 10) transitions.
// Phase 1: matrix 432 rows 501 cols
[2024-06-01 07:19:01] [INFO ] Computed 105 invariants in 7 ms
[2024-06-01 07:19:01] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 07:19:01] [INFO ] Invariant cache hit.
[2024-06-01 07:19:01] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:19:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 20 solved, 411 unsolved
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 6 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 408 unsolved
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 3 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/933 variables, and 225 constraints, problems are : Problem set: 26 solved, 405 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:19:38] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:38] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:38] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:38] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:38] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 5 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:19:48] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 94 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:19:49] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/325 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(timeout
s314 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/933 variables, and 339 constraints, problems are : Problem set: 27 solved, 404 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 234/234 constraints]
After SMT, in 60140ms problems are : Problem set: 27 solved, 404 unsolved
Search for dead transitions found 27 dead transitions in 60146ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 405/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 405
Applied a total of 1 rules in 15 ms. Remains 500 /501 variables (removed 1) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 500 cols
[2024-06-01 07:20:01] [INFO ] Computed 106 invariants in 6 ms
[2024-06-01 07:20:02] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 07:20:02] [INFO ] Invariant cache hit.
[2024-06-01 07:20:02] [INFO ] Implicit Places using invariants and state equation in 595 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 820 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/511 places, 405/442 transitions.
Applied a total of 0 rules in 18 ms. Remains 498 /498 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61736 ms. Remains : 498/511 places, 405/442 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1062 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-08 finished in 62235 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 U p1)||(p2 U (p3||G(p2))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 432
Applied a total of 20 rules in 21 ms. Remains 501 /511 variables (removed 10) and now considering 432/442 (removed 10) transitions.
// Phase 1: matrix 432 rows 501 cols
[2024-06-01 07:20:03] [INFO ] Computed 105 invariants in 7 ms
[2024-06-01 07:20:03] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 07:20:03] [INFO ] Invariant cache hit.
[2024-06-01 07:20:04] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 4 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 20 solved, 411 unsolved
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 408 unsolved
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 86 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:20:19] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:20:20] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:20:21] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:20:22] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 3 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/933 variables, and 225 constraints, problems are : Problem set: 26 solved, 405 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 26 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 1 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:50] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:20:51] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:20:52] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:20:53] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/325 constraints. Problems are: Problem set: 27 solved, 404 unsolved
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 95 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/345 constraints. Problems are: Problem set: 27 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/933 variables, and 345 constraints, problems are : Problem set: 27 solved, 404 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 240/240 constraints]
After SMT, in 60140ms problems are : Problem set: 27 solved, 404 unsolved
Search for dead transitions found 27 dead transitions in 60147ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 405/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 405
Applied a total of 1 rules in 16 ms. Remains 500 /501 variables (removed 1) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 500 cols
[2024-06-01 07:21:04] [INFO ] Computed 106 invariants in 3 ms
[2024-06-01 07:21:04] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 07:21:04] [INFO ] Invariant cache hit.
[2024-06-01 07:21:04] [INFO ] Implicit Places using invariants and state equation in 447 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 609 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/511 places, 405/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 498 /498 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61669 ms. Remains : 498/511 places, 405/442 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1062 edges and 498 vertex of which 497 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 32 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-09 finished in 62383 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((X(p0) U (p1||G(p2)))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 505 transition count 436
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 505 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 504 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 504 transition count 435
Applied a total of 14 rules in 24 ms. Remains 504 /511 variables (removed 7) and now considering 435/442 (removed 7) transitions.
// Phase 1: matrix 435 rows 504 cols
[2024-06-01 07:21:05] [INFO ] Computed 105 invariants in 7 ms
[2024-06-01 07:21:05] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 07:21:05] [INFO ] Invariant cache hit.
[2024-06-01 07:21:06] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-06-01 07:21:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 20/125 constraints. Problems are: Problem set: 16 solved, 418 unsolved
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 88 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
Problem TDEAD374 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 411 unsolved
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 94 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 91 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:20] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 89 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:21] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:21:22] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/165 constraints. Problems are: Problem set: 23 solved, 411 unsolved
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 1 ms to minimize.
Problem TDEAD361 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 20/185 constraints. Problems are: Problem set: 24 solved, 410 unsolved
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:21:29] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 20/205 constraints. Problems are: Problem set: 24 solved, 410 unsolved
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 20/225 constraints. Problems are: Problem set: 24 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/939 variables, and 225 constraints, problems are : Problem set: 24 solved, 410 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 24 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 42/42 constraints. Problems are: Problem set: 24 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/42 constraints. Problems are: Problem set: 24 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 59/101 constraints. Problems are: Problem set: 24 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 4/105 constraints. Problems are: Problem set: 24 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 120/225 constraints. Problems are: Problem set: 24 solved, 410 unsolved
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 112 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 20/245 constraints. Problems are: Problem set: 24 solved, 410 unsolved
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 20/265 constraints. Problems are: Problem set: 24 solved, 410 unsolved
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 32 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:21:52] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:21:53] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 20/285 constraints. Problems are: Problem set: 28 solved, 406 unsolved
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:21:54] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:21:55] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:21:56] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:57] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 20/305 constraints. Problems are: Problem set: 28 solved, 406 unsolved
[2024-06-01 07:21:58] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:21:59] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 20/325 constraints. Problems are: Problem set: 28 solved, 406 unsolved
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/939 variables, and 333 constraints, problems are : Problem set: 28 solved, 406 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 0/434 constraints, Known Traps: 228/228 constraints]
After SMT, in 60112ms problems are : Problem set: 28 solved, 406 unsolved
Search for dead transitions found 28 dead transitions in 60116ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 504/511 places, 407/442 transitions.
Applied a total of 0 rules in 11 ms. Remains 504 /504 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60930 ms. Remains : 504/511 places, 407/442 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 777 reset in 328 ms.
Product exploration explored 100000 steps with 784 reset in 285 ms.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1079 edges and 504 vertex of which 503 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/504 stabilizing places and 181/407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 341 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
RANDOM walk for 40000 steps (263 resets) in 334 ms. (119 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (44 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
// Phase 1: matrix 407 rows 504 cols
[2024-06-01 07:22:08] [INFO ] Computed 108 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 136/496 variables, 48/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/498 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 403/901 variables, 498/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/901 variables, 5/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/901 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 9/910 variables, 5/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/910 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/910 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/911 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/911 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/911 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 911/911 variables, and 628 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2419 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 123/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 234/360 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 136/496 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 7/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/498 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 403/901 variables, 498/649 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/901 variables, 9/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/901 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 9/910 variables, 5/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/910 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/910 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 7499ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 407/407 transitions.
Graph (trivial) has 227 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1072 edges and 499 vertex of which 498 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 498 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 447 transition count 348
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 447 transition count 242
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 321 transition count 242
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 616 place count 177 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 618 place count 176 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 620 place count 176 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 622 place count 174 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 174 transition count 108
Applied a total of 623 rules in 48 ms. Remains 174 /504 variables (removed 330) and now considering 108/407 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 174/504 places, 108/407 transitions.
RANDOM walk for 40000 steps (1075 resets) in 399 ms. (100 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (307 resets) in 114 ms. (347 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (484 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
// Phase 1: matrix 108 rows 174 cols
[2024-06-01 07:22:16] [INFO ] Computed 80 invariants in 1 ms
[2024-06-01 07:22:16] [INFO ] State equation strengthened by 13 read => feed constraints.
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) 44/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/138 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/171 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/172 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 108/280 variables, 172/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/282 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/282 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/282 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 174/174 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 44/46 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/138 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/171 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/172 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 108/280 variables, 172/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 13/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/280 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/282 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/282 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 174/174 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 108/108 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 174 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 173 transition count 107
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 172 transition count 106
Applied a total of 4 rules in 7 ms. Remains 172 /174 variables (removed 2) and now considering 106/108 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 172/174 places, 106/108 transitions.
RANDOM walk for 40000 steps (1093 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (550 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5709 states, properties seen :0
Probabilistic random walk after 18617 steps, saw 5709 distinct states, run finished after 56 ms. (steps per millisecond=332 ) properties seen :0
Explored full state space saw : 5709 states, properties seen :0
Exhaustive walk after 18617 steps, saw 5709 distinct states, run finished after 37 ms. (steps per millisecond=503 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 18 factoid took 875 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 407/407 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 407/407 (removed 0) transitions.
// Phase 1: matrix 407 rows 504 cols
[2024-06-01 07:22:17] [INFO ] Computed 108 invariants in 3 ms
[2024-06-01 07:22:18] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 07:22:18] [INFO ] Invariant cache hit.
[2024-06-01 07:22:18] [INFO ] Implicit Places using invariants and state equation in 523 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 736 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/504 places, 407/407 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 753 ms. Remains : 501/504 places, 407/407 transitions.
Computed a total of 209 stabilizing places and 181 stable transitions
Graph (complete) has 1064 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 209 stabilizing places and 181 stable transitions
Detected a total of 209/501 stabilizing places and 181/407 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 311 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (267 resets) in 241 ms. (165 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (44 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
// Phase 1: matrix 407 rows 501 cols
[2024-06-01 07:22:19] [INFO ] Computed 105 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 317/360 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 132/492 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/495 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 403/898 variables, 495/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/898 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/907 variables, 5/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/907 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/908 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/908 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 908/908 variables, and 613 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 317/360 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 132/492 variables, 45/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/495 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 403/898 variables, 495/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/898 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/898 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/898 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 9/907 variables, 5/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/907 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/907 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/908 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/908 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/908 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 908/908 variables, and 624 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 2647ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 432 ms.
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 407/407 transitions.
Graph (trivial) has 228 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1057 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 348
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 444 transition count 348
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 104 place count 444 transition count 242
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 336 place count 318 transition count 242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 317 transition count 241
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 317 transition count 241
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 618 place count 173 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 620 place count 172 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 622 place count 172 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 624 place count 170 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 625 place count 170 transition count 107
Applied a total of 625 rules in 60 ms. Remains 170 /501 variables (removed 331) and now considering 107/407 (removed 300) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 170/501 places, 107/407 transitions.
RANDOM walk for 40000 steps (1081 resets) in 257 ms. (155 steps per ms) remains 1/2 properties
BEST_FIRST walk for 709 steps (3 resets) in 5 ms. (118 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 17 factoid took 869 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 654 reset in 255 ms.
Product exploration explored 100000 steps with 655 reset in 289 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 407/407 transitions.
Graph (trivial) has 227 edges and 501 vertex of which 6 / 501 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 1058 edges and 496 vertex of which 495 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
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 495 transition count 400
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 53 place count 495 transition count 454
Deduced a syphon composed of 125 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 127 place count 495 transition count 454
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 144 place count 478 transition count 421
Deduced a syphon composed of 108 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 161 place count 478 transition count 421
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 1 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 328 place count 478 transition count 421
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 366 place count 440 transition count 383
Deduced a syphon composed of 237 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 404 place count 440 transition count 383
Deduced a syphon composed of 237 places in 0 ms
Applied a total of 404 rules in 119 ms. Remains 440 /501 variables (removed 61) and now considering 383/407 (removed 24) transitions.
[2024-06-01 07:22:24] [INFO ] Redundant transitions in 25 ms returned []
Running 382 sub problems to find dead transitions.
// Phase 1: matrix 383 rows 440 cols
[2024-06-01 07:22:24] [INFO ] Computed 105 invariants in 9 ms
[2024-06-01 07:22:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:22:33] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/125 constraints. Problems are: Problem set: 152 solved, 230 unsolved
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:22:34] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/145 constraints. Problems are: Problem set: 207 solved, 175 unsolved
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-06-01 07:22:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/165 constraints. Problems are: Problem set: 243 solved, 139 unsolved
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD99 is UNSAT
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD206 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD208 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/185 constraints. Problems are: Problem set: 255 solved, 127 unsolved
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:22:40] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:22:41] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:22:41] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:22:41] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:22:41] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:22:41] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:22:41] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:22:41] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:42] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 20/205 constraints. Problems are: Problem set: 255 solved, 127 unsolved
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD301 is UNSAT
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:43] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
Problem TDEAD326 is UNSAT
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 11/216 constraints. Problems are: Problem set: 257 solved, 125 unsolved
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 1/217 constraints. Problems are: Problem set: 257 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/217 constraints. Problems are: Problem set: 257 solved, 125 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD277 is UNSAT
At refinement iteration 12 (OVERLAPS) 382/822 variables, 440/657 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 7/664 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 2/666 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 1/667 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 0/667 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 17 (OVERLAPS) 1/823 variables, 1/668 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/823 variables, 0/668 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 19 (OVERLAPS) 0/823 variables, 0/668 constraints. Problems are: Problem set: 281 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 668 constraints, problems are : Problem set: 281 solved, 101 unsolved in 29957 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 440/440 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 281 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 185/387 variables, 61/61 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 115/176 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:22:56] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 20/196 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 2/198 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/198 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 51/438 variables, 44/242 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 4/246 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 3/249 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/249 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 382/820 variables, 438/687 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/820 variables, 7/694 constraints. Problems are: Problem set: 281 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 101/795 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 5/800 constraints. Problems are: Problem set: 281 solved, 101 unsolved
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2024-06-01 07:23:19] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/820 variables, 3/803 constraints. Problems are: Problem set: 281 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/823 variables, and 803 constraints, problems are : Problem set: 281 solved, 101 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 438/440 constraints, ReadFeed: 7/8 constraints, PredecessorRefiner: 101/382 constraints, Known Traps: 152/152 constraints]
After SMT, in 60564ms problems are : Problem set: 281 solved, 101 unsolved
Search for dead transitions found 281 dead transitions in 60569ms
Found 281 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 281 transitions
Dead transitions reduction (with SMT) removed 281 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 440/501 places, 102/407 transitions.
Graph (complete) has 778 edges and 440 vertex of which 203 are kept as prefixes of interest. Removing 237 places using SCC suffix rule.1 ms
Discarding 237 places :
Also discarding 0 output transitions
Ensure Unique test removed 34 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 169 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 169 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 12 ms. Remains 169 /440 variables (removed 271) and now considering 114/102 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 169/501 places, 114/407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60761 ms. Remains : 169/501 places, 114/407 transitions.
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 407/407 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 407/407 (removed 0) transitions.
// Phase 1: matrix 407 rows 501 cols
[2024-06-01 07:23:25] [INFO ] Computed 105 invariants in 5 ms
[2024-06-01 07:23:25] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-06-01 07:23:25] [INFO ] Invariant cache hit.
[2024-06-01 07:23:26] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2024-06-01 07:23:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 5 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:23:49] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/908 variables, and 225 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/225 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:24:00] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 94 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:24:02] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:24:03] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:24:04] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:24:05] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:24:06] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:07] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:08] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:24:09] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:24:09] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:24:09] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:09] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:10] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:24:11] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:24:12] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:24:15] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 68 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 2 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:24:18] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:24:20] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 68 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:24:21] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:22] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:23] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/908 variables, and 325 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/406 constraints, Known Traps: 220/220 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Finished structural reductions in LTL mode , in 1 iterations and 60978 ms. Remains : 501/501 places, 407/407 transitions.
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 201005 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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 502 transition count 433
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 502 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 501 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 501 transition count 432
Applied a total of 20 rules in 26 ms. Remains 501 /511 variables (removed 10) and now considering 432/442 (removed 10) transitions.
// Phase 1: matrix 432 rows 501 cols
[2024-06-01 07:24:26] [INFO ] Computed 105 invariants in 3 ms
[2024-06-01 07:24:26] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 07:24:26] [INFO ] Invariant cache hit.
[2024-06-01 07:24:27] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:24:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:24:35] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:24:35] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:35] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:24:35] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:24:35] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:35] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:24:36] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 20 solved, 411 unsolved
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 26 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 23 solved, 408 unsolved
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 112 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 1 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
Problem TDEAD361 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:24:46] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:24:47] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 100 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:24:48] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:49] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:24:50] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 26 solved, 405 unsolved
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:24:57] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 30097ms, After SMT, problems are : Problem set: 26 solved, 405 unsolved
Search for dead transitions found 26 dead transitions in 30102ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/511 places, 406/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 406
Applied a total of 1 rules in 8 ms. Remains 500 /501 variables (removed 1) and now considering 406/406 (removed 0) transitions.
// Phase 1: matrix 406 rows 500 cols
[2024-06-01 07:24:57] [INFO ] Computed 106 invariants in 3 ms
[2024-06-01 07:24:57] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 07:24:57] [INFO ] Invariant cache hit.
[2024-06-01 07:24:58] [INFO ] Implicit Places using invariants and state equation in 386 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 606 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/511 places, 406/442 transitions.
Applied a total of 0 rules in 24 ms. Remains 498 /498 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31678 ms. Remains : 498/511 places, 406/442 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 1799 reset in 118 ms.
Stack based approach found an accepted trace after 182 steps with 3 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 31914 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 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Graph (trivial) has 237 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1137 edges and 505 vertex of which 504 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 503 transition count 378
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 448 transition count 378
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 112 place count 448 transition count 272
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 344 place count 322 transition count 272
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 351 place count 315 transition count 265
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 315 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 358 place count 315 transition count 264
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 360 place count 314 transition count 264
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 625 place count 179 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 627 place count 178 transition count 138
Applied a total of 627 rules in 29 ms. Remains 178 /511 variables (removed 333) and now considering 138/442 (removed 304) transitions.
// Phase 1: matrix 138 rows 178 cols
[2024-06-01 07:24:58] [INFO ] Computed 80 invariants in 2 ms
[2024-06-01 07:24:58] [INFO ] Implicit Places using invariants in 153 ms returned [1, 2, 3, 4, 5, 8, 9, 33, 34, 35, 36, 43, 44, 45, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 154 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/511 places, 138/442 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 156/511 places, 138/442 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 17787 reset in 223 ms.
Product exploration explored 100000 steps with 17781 reset in 222 ms.
Computed a total of 31 stabilizing places and 23 stable transitions
Computed a total of 31 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (7942 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2411 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 585 steps, run visited all 1 properties in 5 ms. (steps per millisecond=117 )
Probabilistic random walk after 585 steps, saw 275 distinct states, run finished after 5 ms. (steps per millisecond=117 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 138/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 156 cols
[2024-06-01 07:24:59] [INFO ] Computed 58 invariants in 0 ms
[2024-06-01 07:24:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 07:24:59] [INFO ] Invariant cache hit.
[2024-06-01 07:24:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:25:00] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [3, 26, 28, 30, 37, 39, 41, 43, 45, 52, 54, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 343 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/156 places, 138/138 transitions.
Graph (complete) has 392 edges and 124 vertex of which 115 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 115 transition count 121
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 102 transition count 121
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 37 place count 92 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 92 transition count 90
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 49 place count 92 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 87 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 87 transition count 85
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 75 place count 76 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 74 transition count 76
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 80 place count 74 transition count 75
Applied a total of 80 rules in 11 ms. Remains 74 /124 variables (removed 50) and now considering 75/138 (removed 63) transitions.
// Phase 1: matrix 75 rows 74 cols
[2024-06-01 07:25:00] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 07:25:00] [INFO ] Implicit Places using invariants in 37 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/156 places, 75/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 397 ms. Remains : 73/156 places, 75/138 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8142 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2433 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 316 steps, run visited all 1 properties in 4 ms. (steps per millisecond=79 )
Probabilistic random walk after 316 steps, saw 166 distinct states, run finished after 4 ms. (steps per millisecond=79 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18095 reset in 78 ms.
Product exploration explored 100000 steps with 18094 reset in 83 ms.
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 73 cols
[2024-06-01 07:25:00] [INFO ] Computed 16 invariants in 9 ms
[2024-06-01 07:25:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 07:25:00] [INFO ] Invariant cache hit.
[2024-06-01 07:25:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:25:00] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [11, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 200 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/73 places, 75/75 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 71 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 70 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 69 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 69 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 66 transition count 69
Applied a total of 10 rules in 3 ms. Remains 66 /71 variables (removed 5) and now considering 69/75 (removed 6) transitions.
// Phase 1: matrix 69 rows 66 cols
[2024-06-01 07:25:00] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 07:25:00] [INFO ] Implicit Places using invariants in 65 ms returned [51, 56, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/73 places, 69/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 68
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 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 65
Applied a total of 6 rules in 12 ms. Remains 60 /63 variables (removed 3) and now considering 65/69 (removed 4) transitions.
// Phase 1: matrix 65 rows 60 cols
[2024-06-01 07:25:00] [INFO ] Computed 11 invariants in 0 ms
[2024-06-01 07:25:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 07:25:01] [INFO ] Invariant cache hit.
[2024-06-01 07:25:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:25:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 60/73 places, 65/75 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 461 ms. Remains : 60/73 places, 65/75 transitions.
Treatment of property BusinessProcesses-PT-17-LTLFireability-12 finished in 2675 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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 503 transition count 434
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 503 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 502 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 502 transition count 433
Applied a total of 18 rules in 30 ms. Remains 502 /511 variables (removed 9) and now considering 433/442 (removed 9) transitions.
// Phase 1: matrix 433 rows 502 cols
[2024-06-01 07:25:01] [INFO ] Computed 105 invariants in 3 ms
[2024-06-01 07:25:01] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 07:25:01] [INFO ] Invariant cache hit.
[2024-06-01 07:25:01] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-01 07:25:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:25:09] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:25:09] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:25:09] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:10] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:25:11] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:25:13] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 16 solved, 416 unsolved
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:25:14] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:25:15] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:16] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:25:17] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 16 solved, 416 unsolved
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:25:20] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:25:21] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:25:22] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/185 constraints. Problems are: Problem set: 16 solved, 416 unsolved
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:23] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 1 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:24] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:25] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
Problem TDEAD381 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/205 constraints. Problems are: Problem set: 17 solved, 415 unsolved
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:27] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:25:28] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD403 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 20/225 constraints. Problems are: Problem set: 27 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/935 variables, and 225 constraints, problems are : Problem set: 27 solved, 405 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 27 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 27 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 27 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 27 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 27 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 120/225 constraints. Problems are: Problem set: 27 solved, 405 unsolved
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:25:35] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:25:36] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:25:37] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/245 constraints. Problems are: Problem set: 28 solved, 404 unsolved
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 113 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:39] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:40] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:41] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
Problem TDEAD406 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/265 constraints. Problems are: Problem set: 29 solved, 403 unsolved
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:42] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:25:43] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:25:44] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:25:45] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 3 ms to minimize.
Problem TDEAD402 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/285 constraints. Problems are: Problem set: 30 solved, 402 unsolved
[2024-06-01 07:25:46] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:46] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:25:47] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:25:47] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 4 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:25:48] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:25:49] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/305 constraints. Problems are: Problem set: 30 solved, 402 unsolved
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:25:50] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:25:51] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:25:52] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 20/325 constraints. Problems are: Problem set: 30 solved, 402 unsolved
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:25:53] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:25:54] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:25:55] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:25:56] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:25:57] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 20/345 constraints. Problems are: Problem set: 30 solved, 402 unsolved
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:26:02] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 60193ms, After SMT, problems are : Problem set: 30 solved, 402 unsolved
Search for dead transitions found 30 dead transitions in 60199ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/511 places, 403/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 501 transition count 403
Applied a total of 1 rules in 7 ms. Remains 501 /502 variables (removed 1) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 501 cols
[2024-06-01 07:26:02] [INFO ] Computed 109 invariants in 3 ms
[2024-06-01 07:26:02] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 07:26:02] [INFO ] Invariant cache hit.
[2024-06-01 07:26:02] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 619 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 499/511 places, 403/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 499 /499 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61543 ms. Remains : 499/511 places, 403/442 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 207 stabilizing places and 179 stable transitions
Graph (complete) has 1057 edges and 499 vertex of which 498 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 207 stabilizing places and 179 stable transitions
Detected a total of 207/499 stabilizing places and 179/403 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 21 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-17-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-13 finished in 61915 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&&G((F(p1)&&F(G(p2)))))))'
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 435
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 434
Applied a total of 16 rules in 24 ms. Remains 503 /511 variables (removed 8) and now considering 434/442 (removed 8) transitions.
// Phase 1: matrix 434 rows 503 cols
[2024-06-01 07:26:03] [INFO ] Computed 105 invariants in 6 ms
[2024-06-01 07:26:03] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 07:26:03] [INFO ] Invariant cache hit.
[2024-06-01 07:26:03] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 07:26:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:26:13] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 10 solved, 423 unsolved
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:26:16] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:26:17] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 1 ms to minimize.
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 18 solved, 415 unsolved
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:26:18] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:19] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:20] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:21] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 18 solved, 415 unsolved
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:26:23] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:24] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:26:25] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:26:25] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:26:25] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:26:25] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:26:25] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:26:25] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:26:25] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:26:26] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 24 solved, 409 unsolved
[2024-06-01 07:26:26] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:26:26] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:26] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:26:26] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:26:26] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 101 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:26:27] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 30 solved, 403 unsolved
[2024-06-01 07:26:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:26:29] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:26:30] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:26:31] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:31] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 20/225 constraints. Problems are: Problem set: 30 solved, 403 unsolved
[2024-06-01 07:26:33] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:26:33] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 30 solved, 403 unsolved
Search for dead transitions found 30 dead transitions in 30146ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/511 places, 404/442 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 501 transition count 404
Applied a total of 2 rules in 7 ms. Remains 501 /503 variables (removed 2) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 501 cols
[2024-06-01 07:26:33] [INFO ] Computed 109 invariants in 2 ms
[2024-06-01 07:26:34] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 07:26:34] [INFO ] Invariant cache hit.
[2024-06-01 07:26:34] [INFO ] Implicit Places using invariants and state equation in 464 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 681 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 500/511 places, 404/442 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31510 ms. Remains : 500/511 places, 404/442 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-14 finished in 31739 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((G(p0)&&X((p1||X(X((p2 U p3)))))))))'
Support contains 6 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 504 transition count 435
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 504 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 503 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 503 transition count 434
Applied a total of 16 rules in 26 ms. Remains 503 /511 variables (removed 8) and now considering 434/442 (removed 8) transitions.
// Phase 1: matrix 434 rows 503 cols
[2024-06-01 07:26:34] [INFO ] Computed 105 invariants in 8 ms
[2024-06-01 07:26:35] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 07:26:35] [INFO ] Invariant cache hit.
[2024-06-01 07:26:35] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 07:26:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 63/102 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:26:43] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:26:45] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:26:46] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:26:47] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 14 solved, 419 unsolved
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:26:48] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:26:49] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:26:50] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:26:51] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 3 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 28 solved, 405 unsolved
[2024-06-01 07:26:53] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:26:54] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:26:55] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 28 solved, 405 unsolved
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:26:56] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 95 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:26:57] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:26:58] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 28 solved, 405 unsolved
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:00] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:27:01] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:02] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 20/225 constraints. Problems are: Problem set: 32 solved, 401 unsolved
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 32 solved, 401 unsolved
Search for dead transitions found 32 dead transitions in 30149ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/511 places, 402/442 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 402
Applied a total of 1 rules in 11 ms. Remains 502 /503 variables (removed 1) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 502 cols
[2024-06-01 07:27:05] [INFO ] Computed 111 invariants in 2 ms
[2024-06-01 07:27:05] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 07:27:05] [INFO ] Invariant cache hit.
[2024-06-01 07:27:06] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 623 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 501/511 places, 402/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 501 /501 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31573 ms. Remains : 501/511 places, 402/442 transitions.
Stuttering acceptance computed with spot in 590 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 654 reset in 150 ms.
Product exploration explored 100000 steps with 656 reset in 219 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1059 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 41 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 761 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (260 resets) in 460 ms. (86 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (44 resets) in 318 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 300 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 256 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 414 ms. (96 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (45 resets) in 256 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (47 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 236 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 218 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (46 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (42 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (47 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
// Phase 1: matrix 402 rows 501 cols
[2024-06-01 07:27:09] [INFO ] Computed 110 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf4 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 2 (OVERLAPS) 120/126 variables, 4/5 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 234/360 variables, 55/60 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-01 07:27:09] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/65 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 135/495 variables, 50/115 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:27:10] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:11] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:12] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/495 variables, 20/135 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:27:13] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:27:14] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 5037ms, After SMT, problems are : Problem set: 2 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 402/402 transitions.
Graph (trivial) has 225 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1052 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 495 transition count 345
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 446 transition count 345
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 100 place count 446 transition count 238
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 334 place count 319 transition count 238
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 279 rules applied. Total rules applied 613 place count 174 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 615 place count 173 transition count 108
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 619 place count 173 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 623 place count 169 transition count 104
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 628 place count 169 transition count 104
Applied a total of 628 rules in 20 ms. Remains 169 /501 variables (removed 332) and now considering 104/402 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 169/501 places, 104/402 transitions.
RANDOM walk for 2130 steps (51 resets) in 30 ms. (68 steps per ms) remains 0/11 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p0 p3 (NOT p2))), (G (OR p0 p1 p3 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p1 p3 p2))), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F p3), (F (NOT p0)), (F (NOT (OR p0 p3 p2)))]
Knowledge based reduction with 9 factoid took 1035 ms. Reduced automaton from 13 states, 41 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 787 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 816 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-06-01 07:27:17] [INFO ] Invariant cache hit.
[2024-06-01 07:27:17] [INFO ] [Real]Absence check using 59 positive place invariants in 27 ms returned sat
[2024-06-01 07:27:17] [INFO ] [Real]Absence check using 59 positive and 51 generalized place invariants in 31 ms returned sat
[2024-06-01 07:27:18] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2024-06-01 07:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:27:18] [INFO ] [Nat]Absence check using 59 positive place invariants in 58 ms returned sat
[2024-06-01 07:27:18] [INFO ] [Nat]Absence check using 59 positive and 51 generalized place invariants in 59 ms returned sat
[2024-06-01 07:27:19] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2024-06-01 07:27:19] [INFO ] Computed and/alt/rep : 400/708/400 causal constraints (skipped 1 transitions) in 33 ms.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 85 places in 249 ms of which 5 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2024-06-01 07:27:22] [INFO ] Added : 288 causal constraints over 58 iterations in 2975 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 402/402 transitions.
Applied a total of 0 rules in 12 ms. Remains 501 /501 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-06-01 07:27:22] [INFO ] Invariant cache hit.
[2024-06-01 07:27:23] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-06-01 07:27:23] [INFO ] Invariant cache hit.
[2024-06-01 07:27:23] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-06-01 07:27:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/106 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:27:31] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:32] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:27:33] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:34] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:35] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 3 ms to minimize.
Problem TDEAD369 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/150 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:27:36] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:27:37] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:38] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:39] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:27:39] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/170 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:27:42] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:27:44] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/190 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 117 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:27:45] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:27:46] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:27:47] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/210 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:27:48] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:49] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 117 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:50] [INFO ] Deduced a trap composed of 116 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:27:51] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:52] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/230 constraints. Problems are: Problem set: 1 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/903 variables, and 230 constraints, problems are : Problem set: 1 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 1 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 59/106 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 4/110 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 120/230 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:27:56] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:27:57] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:27:58] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/250 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:27:59] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:28:00] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:01] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/270 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:28:02] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:03] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 1 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:04] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:28:05] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/290 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 9 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/310 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:28:09] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:28:10] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 115 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 115 places in 125 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/330 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:28:12] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:28:13] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:28:14] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:28:15] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/350 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:28:16] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:28:17] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 95 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:28:18] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:28:19] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:28:19] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:28:19] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:28:19] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:28:20] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 20/370 constraints. Problems are: Problem set: 1 solved, 400 unsolved
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/903 variables, and 379 constraints, problems are : Problem set: 1 solved, 400 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/401 constraints, Known Traps: 269/269 constraints]
After SMT, in 60085ms problems are : Problem set: 1 solved, 400 unsolved
Search for dead transitions found 1 dead transitions in 60089ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/501 places, 401/402 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60904 ms. Remains : 501/501 places, 401/402 transitions.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1057 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 714 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (259 resets) in 1208 ms. (33 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 684 ms. (58 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (47 resets) in 247 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (44 resets) in 164 ms. (242 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (44 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (45 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (45 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
// Phase 1: matrix 401 rows 501 cols
[2024-06-01 07:28:25] [INFO ] Computed 111 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 120/126 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 234/360 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:28:26] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:28:27] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 135/495 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/495 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 397/892 variables, 495/636 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/892 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/892 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 9/901 variables, 5/643 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:28:28] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:28:29] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/901 variables, 18/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/901 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1/902 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/902 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/902 variables, and 662 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 120/126 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 234/360 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:28:34] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 135/495 variables, 51/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 397/892 variables, 495/689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/892 variables, 7/696 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:28:35] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
SMT process timed out in 10079ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 401/401 transitions.
Graph (trivial) has 225 edges and 501 vertex of which 6 / 501 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1050 edges and 496 vertex of which 495 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 495 transition count 344
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 446 transition count 344
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 100 place count 446 transition count 237
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 334 place count 319 transition count 237
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 281 rules applied. Total rules applied 615 place count 172 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 617 place count 171 transition count 107
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 621 place count 171 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 625 place count 167 transition count 103
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 630 place count 167 transition count 103
Applied a total of 630 rules in 34 ms. Remains 167 /501 variables (removed 334) and now considering 103/401 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 167/501 places, 103/401 transitions.
RANDOM walk for 3205 steps (79 resets) in 76 ms. (41 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (AND p0 (NOT p1) (NOT p3)))), (F (NOT (OR (NOT p0) p1 p3 (NOT p2)))), (F p1), (F (NOT (OR p0 p1 p3))), (F p2), (F (NOT (AND p0 (NOT p3) (NOT p2)))), (F p3), (F (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 737 ms. Reduced automaton from 13 states, 38 edges and 4 AP (stutter sensitive) to 13 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 743 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 814 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2024-06-01 07:28:38] [INFO ] Invariant cache hit.
[2024-06-01 07:28:38] [INFO ] [Real]Absence check using 59 positive place invariants in 27 ms returned sat
[2024-06-01 07:28:38] [INFO ] [Real]Absence check using 59 positive and 52 generalized place invariants in 26 ms returned sat
[2024-06-01 07:28:39] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2024-06-01 07:28:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:39] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2024-06-01 07:28:39] [INFO ] [Nat]Absence check using 59 positive and 52 generalized place invariants in 23 ms returned sat
[2024-06-01 07:28:40] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2024-06-01 07:28:40] [INFO ] Computed and/alt/rep : 399/702/399 causal constraints (skipped 1 transitions) in 31 ms.
[2024-06-01 07:28:42] [INFO ] Added : 288 causal constraints over 58 iterations in 2213 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 775 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 656 reset in 227 ms.
Stack based approach found an accepted trace after 49557 steps with 322 reset with depth 9 and stack size 9 in 117 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-15 finished in 128601 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((X(p0) U (p1||G(p2)))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-17-LTLFireability-10
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 511/511 places, 442/442 transitions.
Graph (trivial) has 234 edges and 511 vertex of which 7 / 511 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1137 edges and 505 vertex of which 504 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 503 transition count 379
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 449 transition count 379
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 110 place count 449 transition count 273
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 342 place count 323 transition count 273
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 346 place count 319 transition count 269
Iterating global reduction 2 with 4 rules applied. Total rules applied 350 place count 319 transition count 269
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 623 place count 180 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 625 place count 179 transition count 139
Applied a total of 625 rules in 44 ms. Remains 179 /511 variables (removed 332) and now considering 139/442 (removed 303) transitions.
// Phase 1: matrix 139 rows 179 cols
[2024-06-01 07:28:43] [INFO ] Computed 80 invariants in 2 ms
[2024-06-01 07:28:44] [INFO ] Implicit Places using invariants in 251 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 254 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 157/511 places, 139/442 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 302 ms. Remains : 157/511 places, 139/442 transitions.
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10
Product exploration explored 100000 steps with 15377 reset in 207 ms.
Product exploration explored 100000 steps with 15374 reset in 281 ms.
Computed a total of 34 stabilizing places and 26 stable transitions
Computed a total of 34 stabilizing places and 26 stable transitions
Detected a total of 34/157 stabilizing places and 26/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 1201 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
RANDOM walk for 40000 steps (6417 resets) in 756 ms. (52 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (2199 resets) in 252 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2054 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
// Phase 1: matrix 139 rows 157 cols
[2024-06-01 07:28:46] [INFO ] Computed 58 invariants in 3 ms
[2024-06-01 07:28:46] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/113 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/153 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/155 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 138/293 variables, 155/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/295 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/295 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/296 variables, and 220 constraints, problems are : Problem set: 0 solved, 3 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 157/157 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/113 variables, 33/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/153 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/155 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 138/293 variables, 155/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/295 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/295 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/296 variables, and 223 constraints, problems are : Problem set: 0 solved, 3 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 157/157 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 221 ms.
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 139/139 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 157 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 155 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 155 transition count 136
Applied a total of 6 rules in 18 ms. Remains 155 /157 variables (removed 2) and now considering 136/139 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 155/157 places, 136/139 transitions.
RANDOM walk for 40000 steps (1065 resets) in 831 ms. (48 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (340 resets) in 85 ms. (465 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (535 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
// Phase 1: matrix 136 rows 155 cols
[2024-06-01 07:28:47] [INFO ] Computed 58 invariants in 1 ms
[2024-06-01 07:28:47] [INFO ] State equation strengthened by 5 read => feed constraints.
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) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/111 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/150 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:28:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/153 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 136/289 variables, 153/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/291 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/291 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 155/155 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/111 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/150 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/153 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/289 variables, 153/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:28:48] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/291 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/291 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/291 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 155/155 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 1010ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 136/136 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 155 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 154 transition count 135
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 153 transition count 134
Applied a total of 4 rules in 6 ms. Remains 153 /155 variables (removed 2) and now considering 134/136 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/155 places, 134/136 transitions.
RANDOM walk for 40000 steps (1066 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (557 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5709 states, properties seen :0
Probabilistic random walk after 18617 steps, saw 5709 distinct states, run finished after 48 ms. (steps per millisecond=387 ) properties seen :0
Explored full state space saw : 5709 states, properties seen :0
Exhaustive walk after 18617 steps, saw 5709 distinct states, run finished after 39 ms. (steps per millisecond=477 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 14 factoid took 1458 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 139/139 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 139/139 (removed 0) transitions.
// Phase 1: matrix 139 rows 157 cols
[2024-06-01 07:28:50] [INFO ] Computed 58 invariants in 1 ms
[2024-06-01 07:28:50] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 07:28:50] [INFO ] Invariant cache hit.
[2024-06-01 07:28:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:28:51] [INFO ] Implicit Places using invariants and state equation in 253 ms returned [3, 25, 27, 29, 36, 38, 43, 45, 54, 56, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 357 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/157 places, 139/139 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 120 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 120 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 119 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 119 transition count 131
Applied a total of 14 rules in 8 ms. Remains 119 /126 variables (removed 7) and now considering 131/139 (removed 8) transitions.
// Phase 1: matrix 131 rows 119 cols
[2024-06-01 07:28:51] [INFO ] Computed 27 invariants in 1 ms
[2024-06-01 07:28:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 07:28:51] [INFO ] Invariant cache hit.
[2024-06-01 07:28:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:28:51] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 119/157 places, 131/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 578 ms. Remains : 119/157 places, 131/139 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 386 edges and 119 vertex of which 110 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 21 stable transitions
Detected a total of 19/119 stabilizing places and 21/131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 631 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (6362 resets) in 400 ms. (99 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (2168 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1991 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
[2024-06-01 07:28:52] [INFO ] Invariant cache hit.
[2024-06-01 07:28:52] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 54/77 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 23/100 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 128/228 variables, 100/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/249 variables, 19/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/249 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/250 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 119/119 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 54/77 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 23/100 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:28:52] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 128/228 variables, 100/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/249 variables, 19/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/249 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/250 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 119/119 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 131/131 transitions.
Graph (complete) has 370 edges and 119 vertex of which 109 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 109 transition count 113
Reduce places removed 12 places and 0 transitions.
Graph (complete) has 292 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 96 transition count 113
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 96 transition count 112
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 37 place count 88 transition count 81
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 88 transition count 81
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 65 place count 76 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 74 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 74 transition count 70
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 74 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 72 transition count 68
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 72 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 71 transition count 67
Applied a total of 76 rules in 17 ms. Remains 71 /119 variables (removed 48) and now considering 67/131 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 71/119 places, 67/131 transitions.
RANDOM walk for 40000 steps (1779 resets) in 103 ms. (384 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1471 steps (22 resets) in 5 ms. (245 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 1895 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 14653 reset in 140 ms.
Product exploration explored 100000 steps with 14671 reset in 130 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 131/131 transitions.
Graph (complete) has 386 edges and 119 vertex of which 110 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 110 transition count 127
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 21 place count 102 transition count 96
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 102 transition count 96
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 102 transition count 98
Deduced a syphon composed of 19 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 102 transition count 96
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 38 rules in 13 ms. Remains 102 /119 variables (removed 17) and now considering 96/131 (removed 35) transitions.
[2024-06-01 07:28:55] [INFO ] Redundant transitions in 1 ms returned []
Running 91 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 102 cols
[2024-06-01 07:28:55] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 07:28:55] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 07:28:57] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 18/40 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/40 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 95/197 variables, 102/142 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 4/146 constraints. Problems are: Problem set: 23 solved, 68 unsolved
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 5/151 constraints. Problems are: Problem set: 23 solved, 68 unsolved
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:58] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 3/154 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/154 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/154 constraints. Problems are: Problem set: 23 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/198 variables, and 154 constraints, problems are : Problem set: 23 solved, 68 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 102/102 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 23 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 9/16 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 20/102 variables, 11/27 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/31 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 17/48 constraints. Problems are: Problem set: 23 solved, 68 unsolved
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:28:59] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/51 constraints. Problems are: Problem set: 23 solved, 68 unsolved
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:29:00] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 3/54 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 95/197 variables, 102/156 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 4/160 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 68/228 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/228 constraints. Problems are: Problem set: 23 solved, 68 unsolved
At refinement iteration 13 (OVERLAPS) 0/197 variables, 0/228 constraints. Problems are: Problem set: 23 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/198 variables, and 228 constraints, problems are : Problem set: 23 solved, 68 unsolved in 2689 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 102/102 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 68/91 constraints, Known Traps: 32/32 constraints]
After SMT, in 6522ms problems are : Problem set: 23 solved, 68 unsolved
Search for dead transitions found 23 dead transitions in 6524ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/119 places, 73/131 transitions.
Graph (complete) has 271 edges and 102 vertex of which 83 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 79 /102 variables (removed 23) and now considering 73/73 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/119 places, 73/131 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6546 ms. Remains : 79/119 places, 73/131 transitions.
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 131/131 transitions.
Applied a total of 0 rules in 0 ms. Remains 119 /119 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 119 cols
[2024-06-01 07:29:02] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 07:29:02] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 07:29:02] [INFO ] Invariant cache hit.
[2024-06-01 07:29:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:29:02] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 07:29:02] [INFO ] Invariant cache hit.
[2024-06-01 07:29:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:29:03] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 20/47 constraints. Problems are: Problem set: 7 solved, 119 unsolved
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:29:04] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 20/67 constraints. Problems are: Problem set: 25 solved, 101 unsolved
[2024-06-01 07:29:05] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 7/74 constraints. Problems are: Problem set: 33 solved, 93 unsolved
[2024-06-01 07:29:06] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 1/75 constraints. Problems are: Problem set: 33 solved, 93 unsolved
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 5/80 constraints. Problems are: Problem set: 33 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/80 constraints. Problems are: Problem set: 33 solved, 93 unsolved
Problem TDEAD21 is UNSAT
At refinement iteration 10 (OVERLAPS) 130/249 variables, 119/199 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 4/203 constraints. Problems are: Problem set: 34 solved, 92 unsolved
[2024-06-01 07:29:07] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:29:08] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 5/208 constraints. Problems are: Problem set: 34 solved, 92 unsolved
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:29:09] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 2/210 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/210 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 15 (OVERLAPS) 0/249 variables, 0/210 constraints. Problems are: Problem set: 34 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/250 variables, and 210 constraints, problems are : Problem set: 34 solved, 92 unsolved in 7863 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 119/119 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 34 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 6/6 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 12/18 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 29/47 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/47 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/119 variables, 9/56 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 31/87 constraints. Problems are: Problem set: 34 solved, 92 unsolved
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:29:11] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 5/92 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/92 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 130/249 variables, 119/211 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 4/215 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 92/307 constraints. Problems are: Problem set: 34 solved, 92 unsolved
[2024-06-01 07:29:13] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 1/308 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/308 constraints. Problems are: Problem set: 34 solved, 92 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/308 constraints. Problems are: Problem set: 34 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/250 variables, and 308 constraints, problems are : Problem set: 34 solved, 92 unsolved in 5898 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 119/119 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 92/126 constraints, Known Traps: 66/66 constraints]
After SMT, in 13842ms problems are : Problem set: 34 solved, 92 unsolved
Search for dead transitions found 34 dead transitions in 13844ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 119/119 places, 97/131 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 107 transition count 97
Applied a total of 12 rules in 1 ms. Remains 107 /119 variables (removed 12) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 107 cols
[2024-06-01 07:29:16] [INFO ] Computed 24 invariants in 1 ms
[2024-06-01 07:29:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 07:29:16] [INFO ] Invariant cache hit.
[2024-06-01 07:29:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:29:16] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [35, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/119 places, 97/131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 103 transition count 94
Applied a total of 5 rules in 3 ms. Remains 103 /105 variables (removed 2) and now considering 94/97 (removed 3) transitions.
// Phase 1: matrix 94 rows 103 cols
[2024-06-01 07:29:16] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 07:29:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 07:29:16] [INFO ] Invariant cache hit.
[2024-06-01 07:29:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:29:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 103/119 places, 94/131 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14417 ms. Remains : 103/119 places, 94/131 transitions.
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 33376 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)))'
[2024-06-01 07:29:17] [INFO ] Flatten gal took : 51 ms
[2024-06-01 07:29:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 07:29:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 511 places, 442 transitions and 1422 arcs took 12 ms.
Total runtime 935662 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-17-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-17-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717227478931

--------------------
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
mcc2024
ltl formula name BusinessProcesses-PT-17-LTLFireability-10
ltl formula formula --ltl=/tmp/13028/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 511 places, 442 transitions and 1422 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13028/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13028/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13028/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13028/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 512 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 512, there are 469 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~141 levels ~10000 states ~40992 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~20000 states ~91872 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~40000 states ~193576 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~80000 states ~426904 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~160000 states ~910388 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~320000 states ~1939096 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~640000 states ~4154204 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~1280000 states ~8748552 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~2560000 states ~18614896 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~5120000 states ~39687480 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~10240000 states ~82273680 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~20480000 states ~174147492 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25670239
pnml2lts-mc( 0/ 4): unique states count: 33542911
pnml2lts-mc( 0/ 4): unique transitions count: 271575313
pnml2lts-mc( 0/ 4): - self-loop count: 286
pnml2lts-mc( 0/ 4): - claim dead count: 235397080
pnml2lts-mc( 0/ 4): - claim found count: 2629412
pnml2lts-mc( 0/ 4): - claim success count: 33545076
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7035
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33545528 states 271596204 transitions, fanout: 8.096
pnml2lts-mc( 0/ 4): Total exploration time 266.620 sec (266.590 sec minimum, 266.602 sec on average)
pnml2lts-mc( 0/ 4): States per second: 125818, Transitions per second: 1018664
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.0MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 445 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.0MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-17-LTLFireability-12
ltl formula formula --ltl=/tmp/13028/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 511 places, 442 transitions and 1422 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/13028/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/13028/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/13028/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/13028/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 513 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 512, there are 445 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~747 levels ~10000 states ~31028 transitions
pnml2lts-mc( 3/ 4): ~747 levels ~20000 states ~75004 transitions
pnml2lts-mc( 3/ 4): ~747 levels ~40000 states ~178144 transitions
pnml2lts-mc( 3/ 4): ~932 levels ~80000 states ~349892 transitions
pnml2lts-mc( 3/ 4): ~932 levels ~160000 states ~753716 transitions
pnml2lts-mc( 3/ 4): ~951 levels ~320000 states ~1584548 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~640000 states ~3994040 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~1280000 states ~8627760 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~2560000 states ~18391212 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~5120000 states ~39207368 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~10240000 states ~83197196 transitions
pnml2lts-mc( 1/ 4): ~141 levels ~20480000 states ~173305076 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25711621
pnml2lts-mc( 0/ 4): unique states count: 33548610
pnml2lts-mc( 0/ 4): unique transitions count: 270669409
pnml2lts-mc( 0/ 4): - self-loop count: 305
pnml2lts-mc( 0/ 4): - claim dead count: 234799808
pnml2lts-mc( 0/ 4): - claim found count: 2638592
pnml2lts-mc( 0/ 4): - claim success count: 33631745
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33641538 states 271461814 transitions, fanout: 8.069
pnml2lts-mc( 0/ 4): Total exploration time 253.880 sec (253.850 sec minimum, 253.863 sec on average)
pnml2lts-mc( 0/ 4): States per second: 132510, Transitions per second: 1069252
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.1MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 445 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.1MB (~256.0MB paged-in)

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

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