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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 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 157K 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-15-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225908161

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:11:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:11:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:11:49] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 07:11:49] [INFO ] Transformed 630 places.
[2024-06-01 07:11:49] [INFO ] Transformed 566 transitions.
[2024-06-01 07:11:49] [INFO ] Found NUPN structural information;
[2024-06-01 07:11:49] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 84 place count 542 transition count 481
Iterating global reduction 1 with 81 rules applied. Total rules applied 165 place count 542 transition count 481
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 205 place count 502 transition count 441
Iterating global reduction 1 with 40 rules applied. Total rules applied 245 place count 502 transition count 441
Applied a total of 245 rules in 120 ms. Remains 502 /626 variables (removed 124) and now considering 441/562 (removed 121) transitions.
// Phase 1: matrix 441 rows 502 cols
[2024-06-01 07:11:50] [INFO ] Computed 99 invariants in 30 ms
[2024-06-01 07:11:50] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-06-01 07:11:50] [INFO ] Invariant cache hit.
[2024-06-01 07:11:51] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2024-06-01 07:11:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/94 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 28 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:00] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:12:01] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:12:02] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:03] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:04] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 5 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 4 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/139 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:08] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 4 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:09] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/159 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:12:12] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 90 places in 226 ms of which 6 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:13] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:14] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 4 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:15] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/179 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 104 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:16] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:17] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:18] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 415 unsolved
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:19] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:20] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:21] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/943 variables, and 214 constraints, problems are : Problem set: 25 solved, 415 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 25 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 35/35 constraints. Problems are: Problem set: 25 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/35 constraints. Problems are: Problem set: 25 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/94 constraints. Problems are: Problem set: 25 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/99 constraints. Problems are: Problem set: 25 solved, 415 unsolved
Problem TDEAD363 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 115/214 constraints. Problems are: Problem set: 27 solved, 413 unsolved
[2024-06-01 07:12:24] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:12:25] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:12:26] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 111 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:27] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/234 constraints. Problems are: Problem set: 27 solved, 413 unsolved
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:28] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:12:30] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:31] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/254 constraints. Problems are: Problem set: 27 solved, 413 unsolved
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:32] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:12:33] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 4 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:12:34] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/274 constraints. Problems are: Problem set: 27 solved, 413 unsolved
[2024-06-01 07:12:35] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 4 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:36] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 120 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:37] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:38] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:12:39] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/294 constraints. Problems are: Problem set: 27 solved, 413 unsolved
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:12:40] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:12:41] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:12:42] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:43] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 20/314 constraints. Problems are: Problem set: 27 solved, 413 unsolved
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:12:44] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:45] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:46] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:47] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 20/334 constraints. Problems are: Problem set: 27 solved, 413 unsolved
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:12:48] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:12:49] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 60249ms, After SMT, problems are : Problem set: 27 solved, 413 unsolved
Search for dead transitions found 27 dead transitions in 60273ms
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 : 502/626 places, 414/562 transitions.
Applied a total of 0 rules in 22 ms. Remains 502 /502 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61367 ms. Remains : 502/626 places, 414/562 transitions.
Support contains 39 out of 502 places after structural reductions.
[2024-06-01 07:12:51] [INFO ] Flatten gal took : 74 ms
[2024-06-01 07:12:51] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:12:51] [INFO ] Input system was already deterministic with 414 transitions.
Support contains 37 out of 502 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (267 resets) in 1827 ms. (21 steps per ms) remains 20/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
// Phase 1: matrix 414 rows 502 cols
[2024-06-01 07:12:52] [INFO ] Computed 101 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 129/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 222/378 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 5 (OVERLAPS) 118/496 variables, 43/101 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 7 (OVERLAPS) 410/906 variables, 496/597 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:12:53] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 7 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 10 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:12:54] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:12:55] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/906 variables, 20/617 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:12:56] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/906 variables, 8/625 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/916 variables, and 626 constraints, problems are : Problem set: 2 solved, 18 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 496/502 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 2 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 132/155 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:12:57] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 222/377 variables, 50/62 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 6/68 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:12:58] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:12:59] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 20/88 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:00] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 20/108 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:13:01] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:13:02] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
SMT process timed out in 10076ms, After SMT, problems are : Problem set: 2 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 220 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 4 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 1066 edges and 497 vertex of which 496 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 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 496 transition count 351
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 441 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 440 transition count 350
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 114 place count 440 transition count 255
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 322 place count 327 transition count 255
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 327 place count 322 transition count 250
Iterating global reduction 3 with 5 rules applied. Total rules applied 332 place count 322 transition count 250
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 580 place count 195 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 582 place count 194 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 584 place count 194 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 586 place count 192 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 192 transition count 131
Applied a total of 587 rules in 132 ms. Remains 192 /502 variables (removed 310) and now considering 131/414 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 192/502 places, 131/414 transitions.
RANDOM walk for 40000 steps (922 resets) in 2206 ms. (18 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (493 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (447 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
// Phase 1: matrix 131 rows 192 cols
[2024-06-01 07:13:03] [INFO ] Computed 77 invariants in 2 ms
[2024-06-01 07:13:03] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 98/152 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 37/189 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/190 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 131/321 variables, 190/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/321 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/323 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/323 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/323 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 286 constraints, problems are : Problem set: 0 solved, 2 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 192/192 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 98/152 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:13:03] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/189 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/190 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 131/321 variables, 190/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 12/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 17 (OVERLAPS) 2/323 variables, 2/296 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:13:04] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/323 variables, 1/297 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/323 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/323 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 297 constraints, problems are : Problem set: 1 solved, 1 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 192/192 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 969ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 7 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 216 stabilizing places and 188 stable transitions
Graph (complete) has 1073 edges and 502 vertex of which 501 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 241 edges and 502 vertex of which 6 / 502 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 1067 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 496 transition count 346
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 435 transition count 346
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 124 place count 435 transition count 244
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 348 place count 313 transition count 244
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 362 place count 299 transition count 230
Iterating global reduction 2 with 14 rules applied. Total rules applied 376 place count 299 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 376 place count 299 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 380 place count 297 transition count 228
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 632 place count 168 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 634 place count 167 transition count 109
Applied a total of 634 rules in 88 ms. Remains 167 /502 variables (removed 335) and now considering 109/414 (removed 305) transitions.
// Phase 1: matrix 109 rows 167 cols
[2024-06-01 07:13:04] [INFO ] Computed 75 invariants in 2 ms
[2024-06-01 07:13:05] [INFO ] Implicit Places using invariants in 119 ms returned [2, 3, 4, 5, 6, 9, 10, 31, 32, 33, 34, 39, 40, 41, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 122 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/502 places, 109/414 transitions.
Applied a total of 0 rules in 9 ms. Remains 145 /145 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 145/502 places, 109/414 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-00 finished in 453 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 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 398
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 396
Applied a total of 36 rules in 31 ms. Remains 484 /502 variables (removed 18) and now considering 396/414 (removed 18) transitions.
// Phase 1: matrix 396 rows 484 cols
[2024-06-01 07:13:05] [INFO ] Computed 101 invariants in 4 ms
[2024-06-01 07:13:05] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 07:13:05] [INFO ] Invariant cache hit.
[2024-06-01 07:13:05] [INFO ] Implicit Places using invariants and state equation in 480 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 676 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/502 places, 396/414 transitions.
Applied a total of 0 rules in 21 ms. Remains 481 /481 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 728 ms. Remains : 481/502 places, 396/414 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-02
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 16 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-02 finished in 846 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)||G(F(p1)))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 398
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 396
Applied a total of 36 rules in 63 ms. Remains 484 /502 variables (removed 18) and now considering 396/414 (removed 18) transitions.
[2024-06-01 07:13:06] [INFO ] Invariant cache hit.
[2024-06-01 07:13:06] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-06-01 07:13:06] [INFO ] Invariant cache hit.
[2024-06-01 07:13:07] [INFO ] Implicit Places using invariants and state equation in 503 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 887 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/502 places, 396/414 transitions.
Applied a total of 0 rules in 10 ms. Remains 481 /481 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 961 ms. Remains : 481/502 places, 396/414 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 676 reset in 321 ms.
Product exploration explored 100000 steps with 672 reset in 260 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1033 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/481 stabilizing places and 176/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 191 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (269 resets) in 499 ms. (80 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
// Phase 1: matrix 396 rows 481 cols
[2024-06-01 07:13:08] [INFO ] Computed 98 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 321/354 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 118/472 variables, 39/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/475 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 392/867 variables, 475/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/867 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/876 variables, 5/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/876 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/877 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/877 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/877 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 579 constraints, problems are : Problem set: 0 solved, 2 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 321/354 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 7/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 118/472 variables, 39/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:13:09] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:13:10] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 10/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/475 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 392/867 variables, 475/590 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/867 variables, 1/591 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:13:11] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 14 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:13:12] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/867 variables, 15/606 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/867 variables, 0/606 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/876 variables, 5/611 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/876 variables, 0/611 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/877 variables, 1/612 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/877 variables, 0/612 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/877 variables, 0/612 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 612 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3812 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 32/32 constraints]
After SMT, in 4401ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 396/396 transitions.
Graph (trivial) has 222 edges and 481 vertex of which 6 / 481 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 1026 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 475 transition count 338
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 425 transition count 338
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 102 place count 425 transition count 235
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 328 place count 302 transition count 235
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 592 place count 167 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 166 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 166 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 598 place count 164 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 599 place count 164 transition count 108
Applied a total of 599 rules in 36 ms. Remains 164 /481 variables (removed 317) and now considering 108/396 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 164/481 places, 108/396 transitions.
RANDOM walk for 4072 steps (101 resets) in 23 ms. (169 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 207 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 396/396 transitions.
Graph (trivial) has 221 edges and 481 vertex of which 6 / 481 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 1027 edges and 476 vertex of which 475 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 474 transition count 338
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 424 transition count 338
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 102 place count 424 transition count 235
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 328 place count 301 transition count 235
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 586 place count 169 transition count 109
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 588 place count 168 transition count 113
Applied a total of 588 rules in 55 ms. Remains 168 /481 variables (removed 313) and now considering 113/396 (removed 283) transitions.
// Phase 1: matrix 113 rows 168 cols
[2024-06-01 07:13:13] [INFO ] Computed 72 invariants in 1 ms
[2024-06-01 07:13:13] [INFO ] Implicit Places using invariants in 130 ms returned [1, 2, 3, 4, 5, 8, 9, 28, 29, 30, 31, 36, 37, 38, 42, 43, 44, 45, 46, 47, 48, 49]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 131 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/481 places, 113/396 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 146/481 places, 113/396 transitions.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/146 stabilizing places and 25/113 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (5720 resets) in 795 ms. (50 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (1966 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2099 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
// Phase 1: matrix 113 rows 146 cols
[2024-06-01 07:13:14] [INFO ] Computed 50 invariants in 1 ms
[2024-06-01 07:13:14] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/75 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/113 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/140 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/144 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 112/256 variables, 144/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/258 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/259 variables, and 201 constraints, problems are : Problem set: 0 solved, 2 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 146/146 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/75 variables, 33/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/113 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/140 variables, 13/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:13:14] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 1/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/144 variables, 2/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 112/256 variables, 144/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 5/201 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/258 variables, 2/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/259 variables, and 204 constraints, problems are : Problem set: 1 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 146/146 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 347ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 113/113 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 146 transition count 112
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 1 with 4 rules applied. Total rules applied 5 place count 144 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 144 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 142 transition count 108
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 10 place count 142 transition count 108
Applied a total of 10 rules in 20 ms. Remains 142 /146 variables (removed 4) and now considering 108/113 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 142/146 places, 108/113 transitions.
RANDOM walk for 1359 steps (34 resets) in 7 ms. (169 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13121 reset in 237 ms.
Product exploration explored 100000 steps with 13113 reset in 213 ms.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 113/113 transitions.
Applied a total of 0 rules in 18 ms. Remains 146 /146 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 07:13:15] [INFO ] Invariant cache hit.
[2024-06-01 07:13:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 07:13:15] [INFO ] Invariant cache hit.
[2024-06-01 07:13:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:13:15] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [3, 21, 23, 51, 53, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 124, 126, 136]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 325 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/146 places, 113/113 transitions.
Graph (complete) has 339 edges and 120 vertex of which 111 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 111 transition count 101
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 103 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 101 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 101 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 99 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 99 transition count 96
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 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 90 transition count 89
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 2 with 4 rules applied. Total rules applied 45 place count 88 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 88 transition count 86
Applied a total of 46 rules in 19 ms. Remains 88 /120 variables (removed 32) and now considering 86/113 (removed 27) transitions.
// Phase 1: matrix 86 rows 88 cols
[2024-06-01 07:13:15] [INFO ] Computed 17 invariants in 2 ms
[2024-06-01 07:13:15] [INFO ] Implicit Places using invariants in 59 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/146 places, 86/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 428 ms. Remains : 87/146 places, 86/113 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-03 finished in 9992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 240 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1067 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 346
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 435 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 434 transition count 345
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 124 place count 434 transition count 244
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 345 place count 314 transition count 244
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 359 place count 300 transition count 230
Iterating global reduction 3 with 14 rules applied. Total rules applied 373 place count 300 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 373 place count 300 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 377 place count 298 transition count 228
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 629 place count 169 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 3 with 2 rules applied. Total rules applied 631 place count 168 transition count 109
Applied a total of 631 rules in 47 ms. Remains 168 /502 variables (removed 334) and now considering 109/414 (removed 305) transitions.
// Phase 1: matrix 109 rows 168 cols
[2024-06-01 07:13:16] [INFO ] Computed 76 invariants in 2 ms
[2024-06-01 07:13:16] [INFO ] Implicit Places using invariants in 118 ms returned [1, 2, 3, 4, 5, 8, 9, 30, 31, 32, 33, 38, 41, 42, 46, 47, 48, 49, 50, 51, 52, 53, 135]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 120 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/502 places, 109/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 145/502 places, 109/414 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-05 finished in 221 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&&F(p1)&&X(p2)&&G(p3))))'
Support contains 3 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 488 transition count 400
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 488 transition count 400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 486 transition count 398
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 486 transition count 398
Applied a total of 32 rules in 33 ms. Remains 486 /502 variables (removed 16) and now considering 398/414 (removed 16) transitions.
// Phase 1: matrix 398 rows 486 cols
[2024-06-01 07:13:16] [INFO ] Computed 101 invariants in 5 ms
[2024-06-01 07:13:16] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 07:13:16] [INFO ] Invariant cache hit.
[2024-06-01 07:13:16] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 639 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/502 places, 398/414 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 679 ms. Remains : 483/502 places, 398/414 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), true, (NOT p1), (AND p3 (NOT p2)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-06 finished in 897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&F(p2)))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 239 edges and 502 vertex of which 6 / 502 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 1067 edges and 497 vertex of which 496 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 495 transition count 345
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 434 transition count 345
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 124 place count 434 transition count 243
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 348 place count 312 transition count 243
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 360 place count 300 transition count 231
Iterating global reduction 2 with 12 rules applied. Total rules applied 372 place count 300 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 229
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 628 place count 169 transition count 106
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 630 place count 168 transition count 110
Applied a total of 630 rules in 35 ms. Remains 168 /502 variables (removed 334) and now considering 110/414 (removed 304) transitions.
// Phase 1: matrix 110 rows 168 cols
[2024-06-01 07:13:17] [INFO ] Computed 75 invariants in 1 ms
[2024-06-01 07:13:17] [INFO ] Implicit Places using invariants in 108 ms returned [1, 2, 3, 4, 5, 8, 9, 30, 31, 32, 33, 38, 39, 40, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 110 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/502 places, 110/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 149 ms. Remains : 146/502 places, 110/414 transitions.
Stuttering acceptance computed with spot in 58 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-07 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 239 edges and 502 vertex of which 6 / 502 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 1067 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 346
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 435 transition count 346
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 122 place count 435 transition count 244
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 346 place count 313 transition count 244
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 359 place count 300 transition count 231
Iterating global reduction 2 with 13 rules applied. Total rules applied 372 place count 300 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 229
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 229
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 628 place count 169 transition count 106
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 630 place count 168 transition count 110
Applied a total of 630 rules in 36 ms. Remains 168 /502 variables (removed 334) and now considering 110/414 (removed 304) transitions.
// Phase 1: matrix 110 rows 168 cols
[2024-06-01 07:13:17] [INFO ] Computed 75 invariants in 1 ms
[2024-06-01 07:13:17] [INFO ] Implicit Places using invariants in 107 ms returned [1, 2, 3, 4, 5, 8, 9, 30, 31, 32, 33, 38, 39, 40, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 109 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/502 places, 110/414 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 146/502 places, 110/414 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 19821 reset in 174 ms.
Product exploration explored 100000 steps with 19830 reset in 243 ms.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/146 stabilizing places and 25/110 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 : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 15 steps (1 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 146 cols
[2024-06-01 07:13:18] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 07:13:18] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 07:13:18] [INFO ] Invariant cache hit.
[2024-06-01 07:13:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:13:18] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [3, 4, 5, 6, 23, 25, 31, 33, 35, 37, 39, 41, 43, 50, 52, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 124, 126, 130, 132, 136]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 358 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/146 places, 110/110 transitions.
Graph (complete) has 293 edges and 108 vertex of which 99 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 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 99 transition count 93
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 86 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 83 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 83 transition count 89
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 35 place count 83 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 81 transition count 87
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 40 place count 78 transition count 84
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 78 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 57 place count 70 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 61 place count 68 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 62 place count 68 transition count 75
Applied a total of 62 rules in 8 ms. Remains 68 /108 variables (removed 40) and now considering 75/110 (removed 35) transitions.
// Phase 1: matrix 75 rows 68 cols
[2024-06-01 07:13:18] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 07:13:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 07:13:18] [INFO ] Invariant cache hit.
[2024-06-01 07:13:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:13:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 172 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/146 places, 75/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 548 ms. Remains : 67/146 places, 75/110 transitions.
Computed a total of 11 stabilizing places and 12 stable transitions
Computed a total of 11 stabilizing places and 12 stable transitions
Detected a total of 11/67 stabilizing places and 12/75 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 : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 33 steps (7 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20390 reset in 139 ms.
Product exploration explored 100000 steps with 20386 reset in 145 ms.
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 67 cols
[2024-06-01 07:13:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 07:13:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 07:13:19] [INFO ] Invariant cache hit.
[2024-06-01 07:13:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:13:19] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-06-01 07:13:19] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-06-01 07:13:19] [INFO ] Invariant cache hit.
[2024-06-01 07:13:19] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 4 (OVERLAPS) 74/141 variables, 67/74 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 4/78 constraints. Problems are: Problem set: 9 solved, 61 unsolved
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:13:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 3/81 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/81 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/81 constraints. Problems are: Problem set: 9 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/142 variables, and 81 constraints, problems are : Problem set: 9 solved, 61 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 9 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/5 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/67 variables, 5/10 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 74/141 variables, 67/77 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 4/81 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 61/142 constraints. Problems are: Problem set: 9 solved, 61 unsolved
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/143 constraints. Problems are: Problem set: 9 solved, 61 unsolved
[2024-06-01 07:13:21] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/144 constraints. Problems are: Problem set: 9 solved, 61 unsolved
[2024-06-01 07:13:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 1/145 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/145 constraints. Problems are: Problem set: 9 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/145 constraints. Problems are: Problem set: 9 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/142 variables, and 145 constraints, problems are : Problem set: 9 solved, 61 unsolved in 2037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 61/70 constraints, Known Traps: 6/6 constraints]
After SMT, in 3258ms problems are : Problem set: 9 solved, 61 unsolved
Search for dead transitions found 9 dead transitions in 3260ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 67/67 places, 66/75 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 1 ms. Remains 65 /67 variables (removed 2) and now considering 66/66 (removed 0) transitions.
[2024-06-01 07:13:23] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 3507 ms. Remains : 65/67 places, 66/75 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-08 finished in 5777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 486 transition count 398
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 486 transition count 398
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 484 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 484 transition count 396
Applied a total of 36 rules in 19 ms. Remains 484 /502 variables (removed 18) and now considering 396/414 (removed 18) transitions.
// Phase 1: matrix 396 rows 484 cols
[2024-06-01 07:13:23] [INFO ] Computed 101 invariants in 4 ms
[2024-06-01 07:13:23] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 07:13:23] [INFO ] Invariant cache hit.
[2024-06-01 07:13:23] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 617 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 481/502 places, 396/414 transitions.
Applied a total of 0 rules in 18 ms. Remains 481 /481 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 654 ms. Remains : 481/502 places, 396/414 transitions.
Stuttering acceptance computed with spot in 140 ms :[(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-15-LTLFireability-10
Product exploration explored 100000 steps with 671 reset in 233 ms.
Product exploration explored 100000 steps with 675 reset in 253 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1033 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/481 stabilizing places and 176/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 23756 steps (158 resets) in 74 ms. (316 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 396/396 transitions.
Applied a total of 0 rules in 7 ms. Remains 481 /481 variables (removed 0) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 481 cols
[2024-06-01 07:13:25] [INFO ] Computed 98 invariants in 3 ms
[2024-06-01 07:13:25] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 07:13:25] [INFO ] Invariant cache hit.
[2024-06-01 07:13:26] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-06-01 07:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 58/96 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:13:33] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:13:34] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:35] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:37] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:13:38] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:13:39] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:40] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:13:41] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:47] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:13:48] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:50] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:13:51] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:13:52] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:13:53] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:13:54] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:13:55] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:13:56] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/877 variables, and 218 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 58/96 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 120/218 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:00] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 4 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:14:01] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:02] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:03] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:14:06] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:07] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:09] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 1 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:10] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:11] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:14:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:13] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:14:14] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/298 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:16] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:14:17] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:14:18] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:14:19] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/318 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:24] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 20/338 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/877 variables, and 338 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 0/395 constraints, Known Traps: 240/240 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Finished structural reductions in LTL mode , in 1 iterations and 60797 ms. Remains : 481/481 places, 396/396 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1033 edges and 481 vertex of which 480 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Detected a total of 204/481 stabilizing places and 176/396 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 34391 steps (230 resets) in 140 ms. (243 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 673 reset in 160 ms.
Product exploration explored 100000 steps with 679 reset in 175 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 481/481 places, 396/396 transitions.
Graph (trivial) has 220 edges and 481 vertex of which 6 / 481 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 1027 edges and 476 vertex of which 475 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
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 475 transition count 389
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 73 Pre rules applied. Total rules applied 51 place count 475 transition count 440
Deduced a syphon composed of 122 places in 1 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 124 place count 475 transition count 440
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 140 place count 459 transition count 409
Deduced a syphon composed of 106 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 156 place count 459 transition count 409
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 1 with 159 rules applied. Total rules applied 315 place count 459 transition count 409
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 353 place count 421 transition count 371
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 391 place count 421 transition count 371
Deduced a syphon composed of 227 places in 0 ms
Applied a total of 391 rules in 82 ms. Remains 421 /481 variables (removed 60) and now considering 371/396 (removed 25) transitions.
[2024-06-01 07:14:28] [INFO ] Redundant transitions in 20 ms returned []
Running 370 sub problems to find dead transitions.
// Phase 1: matrix 371 rows 421 cols
[2024-06-01 07:14:28] [INFO ] Computed 98 invariants in 4 ms
[2024-06-01 07:14:28] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/421 variables, 59/97 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 42 places in 97 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
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-01 07:14:34] [INFO ] Deduced a trap composed of 42 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
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
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 TDEAD33 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem 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 TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 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 TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 20/118 constraints. Problems are: Problem set: 150 solved, 220 unsolved
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:14:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 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 TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 20/138 constraints. Problems are: Problem set: 207 solved, 163 unsolved
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-06-01 07:14:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 07:14:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 20/158 constraints. Problems are: Problem set: 236 solved, 134 unsolved
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:38] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:14:39] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
Problem TDEAD171 is UNSAT
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD192 is UNSAT
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 20/178 constraints. Problems are: Problem set: 242 solved, 128 unsolved
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD200 is UNSAT
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 15/193 constraints. Problems are: Problem set: 244 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/193 constraints. Problems are: Problem set: 244 solved, 126 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 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 TDEAD235 is UNSAT
At refinement iteration 10 (OVERLAPS) 370/791 variables, 421/614 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/791 variables, 10/624 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/791 variables, 0/624 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 1/792 variables, 1/625 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/792 variables, 0/625 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 15 (OVERLAPS) 0/792 variables, 0/625 constraints. Problems are: Problem set: 272 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 792/792 variables, and 625 constraints, problems are : Problem set: 272 solved, 98 unsolved in 21969 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 421/421 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 272 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 181/374 variables, 59/59 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 3/62 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 95/157 constraints. Problems are: Problem set: 272 solved, 98 unsolved
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 13 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/177 constraints. Problems are: Problem set: 272 solved, 98 unsolved
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 8/185 constraints. Problems are: Problem set: 272 solved, 98 unsolved
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 14/199 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/199 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 45/419 variables, 36/235 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/235 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 370/789 variables, 419/654 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 10/664 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 98/762 constraints. Problems are: Problem set: 272 solved, 98 unsolved
[2024-06-01 07:15:02] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 1/763 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/763 constraints. Problems are: Problem set: 272 solved, 98 unsolved
At refinement iteration 15 (OVERLAPS) 2/791 variables, 2/765 constraints. Problems are: Problem set: 272 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/792 variables, and 765 constraints, problems are : Problem set: 272 solved, 98 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 421/421 constraints, ReadFeed: 10/11 constraints, PredecessorRefiner: 98/370 constraints, Known Traps: 138/138 constraints]
After SMT, in 52358ms problems are : Problem set: 272 solved, 98 unsolved
Search for dead transitions found 272 dead transitions in 52364ms
Found 272 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 272 transitions
Dead transitions reduction (with SMT) removed 272 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 421/481 places, 99/396 transitions.
Graph (complete) has 740 edges and 421 vertex of which 194 are kept as prefixes of interest. Removing 227 places using SCC suffix rule.1 ms
Discarding 227 places :
Also discarding 0 output transitions
Ensure Unique test removed 31 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 163 transition count 105
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 163 transition count 111
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 14 ms. Remains 163 /421 variables (removed 258) and now considering 111/99 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 163/481 places, 111/396 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52509 ms. Remains : 163/481 places, 111/396 transitions.
Support contains 2 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 396/396 transitions.
Applied a total of 0 rules in 12 ms. Remains 481 /481 variables (removed 0) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 481 cols
[2024-06-01 07:15:20] [INFO ] Computed 98 invariants in 3 ms
[2024-06-01 07:15:20] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 07:15:20] [INFO ] Invariant cache hit.
[2024-06-01 07:15:21] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-06-01 07:15:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 58/96 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:30] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:15:31] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:32] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 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 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 6 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 4 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 30176ms, After SMT, problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 30182ms
Finished structural reductions in LTL mode , in 1 iterations and 31166 ms. Remains : 481/481 places, 396/396 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 148432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(p1)) U X(X(p2))))'
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 487 transition count 399
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 487 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 485 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 485 transition count 397
Applied a total of 34 rules in 25 ms. Remains 485 /502 variables (removed 17) and now considering 397/414 (removed 17) transitions.
// Phase 1: matrix 397 rows 485 cols
[2024-06-01 07:15:51] [INFO ] Computed 101 invariants in 3 ms
[2024-06-01 07:15:51] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 07:15:51] [INFO ] Invariant cache hit.
[2024-06-01 07:15:52] [INFO ] Implicit Places using invariants and state equation in 446 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 731 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 482/502 places, 397/414 transitions.
Applied a total of 0 rules in 8 ms. Remains 482 /482 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 765 ms. Remains : 482/502 places, 397/414 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-11
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-11 finished in 1039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||(p1&&F(G(p2)))))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 487 transition count 399
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 487 transition count 399
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 485 transition count 397
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 485 transition count 397
Applied a total of 34 rules in 25 ms. Remains 485 /502 variables (removed 17) and now considering 397/414 (removed 17) transitions.
// Phase 1: matrix 397 rows 485 cols
[2024-06-01 07:15:52] [INFO ] Computed 101 invariants in 2 ms
[2024-06-01 07:15:53] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-06-01 07:15:53] [INFO ] Invariant cache hit.
[2024-06-01 07:15:53] [INFO ] Implicit Places using invariants and state equation in 526 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 838 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 482/502 places, 397/414 transitions.
Applied a total of 0 rules in 8 ms. Remains 482 /482 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 872 ms. Remains : 482/502 places, 397/414 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-12
Product exploration explored 100000 steps with 802 reset in 271 ms.
Product exploration explored 100000 steps with 799 reset in 314 ms.
Computed a total of 205 stabilizing places and 177 stable transitions
Graph (complete) has 1034 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 205 stabilizing places and 177 stable transitions
Detected a total of 205/482 stabilizing places and 177/397 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 232 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (269 resets) in 313 ms. (127 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (46 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (46 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (47 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
// Phase 1: matrix 397 rows 482 cols
[2024-06-01 07:15:55] [INFO ] Computed 98 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 212/357 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 113/470 variables, 37/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 6/476 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 393/869 variables, 476/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/869 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/878 variables, 5/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/878 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/879 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/879 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/879 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 879/879 variables, and 580 constraints, problems are : Problem set: 0 solved, 4 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 212/357 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:15:55] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:56] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 26 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 113/470 variables, 37/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 83 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/476 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/476 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 393/869 variables, 476/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/869 variables, 4/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 11/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 9/878 variables, 5/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 2 ms to minimize.
SMT process timed out in 5771ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 397/397 transitions.
Graph (trivial) has 221 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1027 edges and 477 vertex of which 476 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 476 transition count 338
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 425 transition count 338
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 425 transition count 237
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 326 place count 304 transition count 237
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 590 place count 169 transition count 108
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 592 place count 168 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 168 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 596 place count 166 transition count 110
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 597 place count 166 transition count 110
Applied a total of 597 rules in 30 ms. Remains 166 /482 variables (removed 316) and now considering 110/397 (removed 287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 166/482 places, 110/397 transitions.
RANDOM walk for 40000 steps (1079 resets) in 459 ms. (86 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (488 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (469 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
// Phase 1: matrix 110 rows 166 cols
[2024-06-01 07:16:01] [INFO ] Computed 72 invariants in 3 ms
[2024-06-01 07:16:01] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 75/131 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/158 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/164 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 110/274 variables, 164/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 13/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/276 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/276 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 251 constraints, problems are : Problem set: 0 solved, 2 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/166 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 75/131 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/158 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/164 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 110/274 variables, 164/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 13/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/276 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Int declared 276/276 variables, and 259 constraints, problems are : Problem set: 2 solved, 0 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 166/166 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 545ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) p0)), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 16 factoid took 370 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 482 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 397/397 transitions.
Graph (trivial) has 221 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1028 edges and 477 vertex of which 476 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 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 475 transition count 338
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 424 transition count 338
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 104 place count 424 transition count 237
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 326 place count 303 transition count 237
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 588 place count 169 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 590 place count 168 transition count 113
Applied a total of 590 rules in 29 ms. Remains 168 /482 variables (removed 314) and now considering 113/397 (removed 284) transitions.
// Phase 1: matrix 113 rows 168 cols
[2024-06-01 07:16:02] [INFO ] Computed 72 invariants in 1 ms
[2024-06-01 07:16:02] [INFO ] Implicit Places using invariants in 196 ms returned [1, 2, 3, 4, 5, 8, 9, 27, 28, 29, 30, 35, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 199 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/482 places, 113/397 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 233 ms. Remains : 146/482 places, 113/397 transitions.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/146 stabilizing places and 25/113 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 131 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 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 55 steps with 9 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-12 finished in 10524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G((p1||X(X((p2 U p3))))))))'
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 489 transition count 401
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 489 transition count 401
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 487 transition count 399
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 487 transition count 399
Applied a total of 30 rules in 42 ms. Remains 487 /502 variables (removed 15) and now considering 399/414 (removed 15) transitions.
// Phase 1: matrix 399 rows 487 cols
[2024-06-01 07:16:03] [INFO ] Computed 101 invariants in 3 ms
[2024-06-01 07:16:03] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 07:16:03] [INFO ] Invariant cache hit.
[2024-06-01 07:16:03] [INFO ] Implicit Places using invariants and state equation in 443 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 610 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 484/502 places, 399/414 transitions.
Applied a total of 0 rules in 12 ms. Remains 484 /484 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 664 ms. Remains : 484/502 places, 399/414 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-13
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-13 finished in 860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 240 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1067 edges and 497 vertex of which 496 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 495 transition count 345
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 434 transition count 345
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 124 place count 434 transition count 244
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 346 place count 313 transition count 244
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 359 place count 300 transition count 231
Iterating global reduction 2 with 13 rules applied. Total rules applied 372 place count 300 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 372 place count 300 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 376 place count 298 transition count 229
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 630 place count 168 transition count 105
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 632 place count 167 transition count 109
Applied a total of 632 rules in 35 ms. Remains 167 /502 variables (removed 335) and now considering 109/414 (removed 305) transitions.
// Phase 1: matrix 109 rows 167 cols
[2024-06-01 07:16:04] [INFO ] Computed 75 invariants in 1 ms
[2024-06-01 07:16:04] [INFO ] Implicit Places using invariants in 215 ms returned [1, 2, 3, 4, 5, 8, 9, 30, 31, 32, 33, 38, 39, 40, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 216 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/502 places, 109/414 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 254 ms. Remains : 145/502 places, 109/414 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-15-LTLFireability-14 finished in 372 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 X(X(X((!p0 U (p1||G(!p0)))))))))'
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 488 transition count 400
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 488 transition count 400
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 486 transition count 398
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 486 transition count 398
Applied a total of 32 rules in 27 ms. Remains 486 /502 variables (removed 16) and now considering 398/414 (removed 16) transitions.
// Phase 1: matrix 398 rows 486 cols
[2024-06-01 07:16:04] [INFO ] Computed 101 invariants in 3 ms
[2024-06-01 07:16:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 07:16:04] [INFO ] Invariant cache hit.
[2024-06-01 07:16:05] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [85, 86, 87]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 697 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 483/502 places, 398/414 transitions.
Applied a total of 0 rules in 8 ms. Remains 483 /483 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 732 ms. Remains : 483/502 places, 398/414 transitions.
Stuttering acceptance computed with spot in 337 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-15
Product exploration explored 100000 steps with 20000 reset in 118 ms.
Product exploration explored 100000 steps with 20000 reset in 189 ms.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1037 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (266 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 408940 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 3
Probabilistic random walk after 408940 steps, saw 70397 distinct states, run finished after 3005 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 398 rows 483 cols
[2024-06-01 07:16:09] [INFO ] Computed 98 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/354 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 117/471 variables, 38/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/477 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 394/871 variables, 477/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
SMT process timed out in 5080ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 398/398 transitions.
Graph (trivial) has 223 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1030 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 477 transition count 340
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 427 transition count 340
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 427 transition count 236
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 303 transition count 236
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 598 place count 166 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 600 place count 165 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 602 place count 165 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 604 place count 163 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 605 place count 163 transition count 107
Applied a total of 605 rules in 27 ms. Remains 163 /483 variables (removed 320) and now considering 107/398 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 163/483 places, 107/398 transitions.
RANDOM walk for 40000 steps (1154 resets) in 218 ms. (182 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (730 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
// Phase 1: matrix 107 rows 163 cols
[2024-06-01 07:16:14] [INFO ] Computed 72 invariants in 1 ms
[2024-06-01 07:16:14] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/161 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 107/268 variables, 161/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 12/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/270 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/270 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/161 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 107/268 variables, 161/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 12/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/270 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/270 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/270 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 527ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 398/398 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 398/398 (removed 0) transitions.
// Phase 1: matrix 398 rows 483 cols
[2024-06-01 07:16:15] [INFO ] Computed 98 invariants in 3 ms
[2024-06-01 07:16:15] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 07:16:15] [INFO ] Invariant cache hit.
[2024-06-01 07:16:16] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2024-06-01 07:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 58/96 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 4 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 7 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 86 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 90 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 88 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/881 variables, and 203 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 58/96 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 105/203 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 14/277 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 12/289 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/881 variables, and 301 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 0/397 constraints, Known Traps: 203/203 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Finished structural reductions in LTL mode , in 1 iterations and 60737 ms. Remains : 483/483 places, 398/398 transitions.
Computed a total of 204 stabilizing places and 176 stable transitions
Graph (complete) has 1037 edges and 483 vertex of which 482 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 204 stabilizing places and 176 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (269 resets) in 453 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (46 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 526860 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 3
Probabilistic random walk after 526860 steps, saw 87797 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-06-01 07:17:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 269/354 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:22] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 117/471 variables, 38/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/477 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 394/871 variables, 477/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
SMT process timed out in 5019ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 398/398 transitions.
Graph (trivial) has 223 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1030 edges and 478 vertex of which 477 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 477 transition count 340
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 427 transition count 340
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 102 place count 427 transition count 236
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 330 place count 303 transition count 236
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 598 place count 166 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 600 place count 165 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 602 place count 165 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 604 place count 163 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 605 place count 163 transition count 107
Applied a total of 605 rules in 24 ms. Remains 163 /483 variables (removed 320) and now considering 107/398 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 163/483 places, 107/398 transitions.
RANDOM walk for 40000 steps (1174 resets) in 149 ms. (266 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (737 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
// Phase 1: matrix 107 rows 163 cols
[2024-06-01 07:17:25] [INFO ] Computed 72 invariants in 1 ms
[2024-06-01 07:17:25] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/161 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 107/268 variables, 161/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 12/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/270 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/270 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/270 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 252 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/155 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/161 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 107/268 variables, 161/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 12/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/270 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:25] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/270 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/270 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 254 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 163/163 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 572ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 116 ms.
Product exploration explored 100000 steps with 20000 reset in 120 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 143 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 398/398 transitions.
Graph (trivial) has 223 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1031 edges and 478 vertex of which 477 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
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 477 transition count 391
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 74 Pre rules applied. Total rules applied 52 place count 477 transition count 446
Deduced a syphon composed of 124 places in 1 ms
Iterating global reduction 1 with 74 rules applied. Total rules applied 126 place count 477 transition count 446
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 143 place count 460 transition count 413
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 160 place count 460 transition count 413
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 267 places in 0 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 320 place count 460 transition count 413
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 358 place count 422 transition count 375
Deduced a syphon composed of 229 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 396 place count 422 transition count 375
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 396 rules in 49 ms. Remains 422 /483 variables (removed 61) and now considering 375/398 (removed 23) transitions.
[2024-06-01 07:17:26] [INFO ] Redundant transitions in 6 ms returned []
Running 374 sub problems to find dead transitions.
// Phase 1: matrix 375 rows 422 cols
[2024-06-01 07:17:26] [INFO ] Computed 98 invariants in 5 ms
[2024-06-01 07:17:26] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/422 variables, 59/97 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 42 places in 91 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
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
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
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem 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 TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 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 TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 20/118 constraints. Problems are: Problem set: 136 solved, 238 unsolved
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:17: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:17:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:17: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:17:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
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 TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/138 constraints. Problems are: Problem set: 191 solved, 183 unsolved
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD161 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 TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 20/158 constraints. Problems are: Problem set: 233 solved, 141 unsolved
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD98 is UNSAT
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 20/178 constraints. Problems are: Problem set: 244 solved, 130 unsolved
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD211 is UNSAT
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 1 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 19/197 constraints. Problems are: Problem set: 249 solved, 125 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/199 constraints. Problems are: Problem set: 249 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/199 constraints. Problems are: Problem set: 249 solved, 125 unsolved
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
At refinement iteration 11 (OVERLAPS) 374/796 variables, 422/621 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/796 variables, 9/630 constraints. Problems are: Problem set: 277 solved, 97 unsolved
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/796 variables, 1/631 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/796 variables, 0/631 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 1/797 variables, 1/632 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/797 variables, 0/632 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/797 variables, 0/632 constraints. Problems are: Problem set: 277 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 797/797 variables, and 632 constraints, problems are : Problem set: 277 solved, 97 unsolved in 23742 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 422/422 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 277 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 181/373 variables, 59/59 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 1/60 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 102/162 constraints. Problems are: Problem set: 277 solved, 97 unsolved
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/182 constraints. Problems are: Problem set: 277 solved, 97 unsolved
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 2/184 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/184 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 47/420 variables, 38/222 constraints. Problems are: Problem set: 277 solved, 97 unsolved
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 9/231 constraints. Problems are: Problem set: 277 solved, 97 unsolved
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:56] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 3/234 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/234 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 374/794 variables, 420/654 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/794 variables, 9/663 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/794 variables, 97/760 constraints. Problems are: Problem set: 277 solved, 97 unsolved
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/794 variables, 1/761 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/794 variables, 0/761 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 2/796 variables, 2/763 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/796 variables, 0/763 constraints. Problems are: Problem set: 277 solved, 97 unsolved
At refinement iteration 18 (OVERLAPS) 1/797 variables, 1/764 constraints. Problems are: Problem set: 277 solved, 97 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/797 variables, and 764 constraints, problems are : Problem set: 277 solved, 97 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 422/422 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 97/374 constraints, Known Traps: 137/137 constraints]
After SMT, in 54016ms problems are : Problem set: 277 solved, 97 unsolved
Search for dead transitions found 277 dead transitions in 54021ms
Found 277 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 277 transitions
Dead transitions reduction (with SMT) removed 277 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 422/483 places, 98/398 transitions.
Graph (complete) has 741 edges and 422 vertex of which 193 are kept as prefixes of interest. Removing 229 places using SCC suffix rule.1 ms
Discarding 229 places :
Also discarding 0 output transitions
Ensure Unique test removed 33 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 160 transition count 104
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 160 transition count 110
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 160 /422 variables (removed 262) and now considering 110/98 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 160/483 places, 110/398 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54100 ms. Remains : 160/483 places, 110/398 transitions.
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 398/398 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 398/398 (removed 0) transitions.
// Phase 1: matrix 398 rows 483 cols
[2024-06-01 07:18:20] [INFO ] Computed 98 invariants in 4 ms
[2024-06-01 07:18:21] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 07:18:21] [INFO ] Invariant cache hit.
[2024-06-01 07:18:21] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2024-06-01 07:18:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 58/96 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 1 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:18:33] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 95 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 90 places in 106 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 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/881 variables, and 218 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 58/96 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 120/218 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 3 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:06] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/278 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:19:09] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:19:10] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:19:11] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/298 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 5 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/318 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 28 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 18/336 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/881 variables, and 336 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 0/397 constraints, Known Traps: 238/238 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Finished structural reductions in LTL mode , in 1 iterations and 60910 ms. Remains : 483/483 places, 398/398 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-15 finished in 197283 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)||G(F(p1)))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-15-LTLFireability-03
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 239 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1067 edges and 497 vertex of which 496 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 495 transition count 345
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 124 place count 434 transition count 345
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 124 place count 434 transition count 244
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 346 place count 313 transition count 244
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 360 place count 299 transition count 230
Iterating global reduction 2 with 14 rules applied. Total rules applied 374 place count 299 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 374 place count 299 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 378 place count 297 transition count 228
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 622 place count 172 transition count 109
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 624 place count 171 transition count 113
Applied a total of 624 rules in 31 ms. Remains 171 /502 variables (removed 331) and now considering 113/414 (removed 301) transitions.
// Phase 1: matrix 113 rows 171 cols
[2024-06-01 07:19:21] [INFO ] Computed 75 invariants in 1 ms
[2024-06-01 07:19:22] [INFO ] Implicit Places using invariants in 92 ms returned [1, 2, 3, 4, 5, 8, 9, 31, 32, 33, 34, 39, 40, 41, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 114 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 149/502 places, 113/414 transitions.
Applied a total of 0 rules in 1 ms. Remains 149 /149 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 149 ms. Remains : 149/502 places, 113/414 transitions.
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 13176 reset in 131 ms.
Product exploration explored 100000 steps with 13124 reset in 271 ms.
Computed a total of 33 stabilizing places and 25 stable transitions
Computed a total of 33 stabilizing places and 25 stable transitions
Detected a total of 33/149 stabilizing places and 25/113 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (5658 resets) in 184 ms. (216 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (2001 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2080 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
// Phase 1: matrix 113 rows 149 cols
[2024-06-01 07:19:22] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 07:19:22] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 69/77 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/120 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/147 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 112/259 variables, 147/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/261 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/261 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/262 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/77 variables, 34/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/120 variables, 3/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 5/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/147 variables, 15/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 112/259 variables, 147/205 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 5/210 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 1/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/261 variables, 2/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/261 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/262 variables, and 213 constraints, problems are : Problem set: 1 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 149/149 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 529ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 113/113 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 149 transition count 112
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 1 with 4 rules applied. Total rules applied 5 place count 147 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 147 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 145 transition count 108
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 10 place count 145 transition count 108
Applied a total of 10 rules in 13 ms. Remains 145 /149 variables (removed 4) and now considering 108/113 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 145/149 places, 108/113 transitions.
RANDOM walk for 3726 steps (102 resets) in 11 ms. (310 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 191 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 149 /149 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 07:19:23] [INFO ] Invariant cache hit.
[2024-06-01 07:19:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 07:19:23] [INFO ] Invariant cache hit.
[2024-06-01 07:19:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:19:24] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [3, 5, 6, 7, 24, 26, 54, 56, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 127, 129, 139]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 233 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/149 places, 113/113 transitions.
Graph (complete) has 339 edges and 120 vertex of which 111 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 111 transition count 101
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 103 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 101 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 101 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 99 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 99 transition count 96
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 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 90 transition count 89
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 2 with 4 rules applied. Total rules applied 45 place count 88 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 88 transition count 86
Applied a total of 46 rules in 14 ms. Remains 88 /120 variables (removed 32) and now considering 86/113 (removed 27) transitions.
// Phase 1: matrix 86 rows 88 cols
[2024-06-01 07:19:24] [INFO ] Computed 17 invariants in 0 ms
[2024-06-01 07:19:24] [INFO ] Implicit Places using invariants in 53 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/149 places, 86/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 316 ms. Remains : 87/149 places, 86/113 transitions.
Computed a total of 17 stabilizing places and 16 stable transitions
Computed a total of 17 stabilizing places and 16 stable transitions
Detected a total of 17/87 stabilizing places and 16/86 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (5772 resets) in 119 ms. (333 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (2041 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2123 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
// Phase 1: matrix 86 rows 87 cols
[2024-06-01 07:19:24] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 07:19:24] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/54 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 70/126 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 34/160 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/162 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 7/169 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/172 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/172 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/173 variables, and 107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/30 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/54 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/56 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 70/126 variables, 56/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 34/160 variables, 23/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/162 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/169 variables, 4/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/169 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/172 variables, 2/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/172 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/173 variables, and 108 constraints, problems are : Problem set: 1 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 243 edges and 87 vertex of which 86 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 (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 84
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 1 with 4 rules applied. Total rules applied 7 place count 84 transition count 82
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 84 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 82 transition count 80
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 82 transition count 74
Reduce places removed 6 places and 0 transitions.
Graph (complete) has 208 edges and 76 vertex of which 74 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 7 rules applied. Total rules applied 24 place count 74 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 74 transition count 73
Applied a total of 25 rules in 25 ms. Remains 74 /87 variables (removed 13) and now considering 73/86 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 74/87 places, 73/86 transitions.
RANDOM walk for 3262 steps (132 resets) in 12 ms. (250 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13303 reset in 83 ms.
Product exploration explored 100000 steps with 13311 reset in 90 ms.
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-06-01 07:19:25] [INFO ] Invariant cache hit.
[2024-06-01 07:19:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 07:19:25] [INFO ] Invariant cache hit.
[2024-06-01 07:19:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:19:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 07:19:25] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2024-06-01 07:19:25] [INFO ] Invariant cache hit.
[2024-06-01 07:19:25] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/87 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 0 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 6 (OVERLAPS) 85/172 variables, 87/110 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 4/114 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 3/117 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 2/119 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/119 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/119 constraints. Problems are: Problem set: 9 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/173 variables, and 119 constraints, problems are : Problem set: 9 solved, 72 unsolved in 2742 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 9 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/4 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 6/10 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/87 variables, 12/22 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 6/28 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 85/172 variables, 87/115 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 4/119 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 72/191 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/194 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 2/196 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/196 constraints. Problems are: Problem set: 9 solved, 72 unsolved
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/172 variables, 1/197 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/197 constraints. Problems are: Problem set: 9 solved, 72 unsolved
At refinement iteration 15 (OVERLAPS) 0/172 variables, 0/197 constraints. Problems are: Problem set: 9 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/173 variables, and 197 constraints, problems are : Problem set: 9 solved, 72 unsolved in 4349 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/81 constraints, Known Traps: 18/18 constraints]
After SMT, in 7149ms problems are : Problem set: 9 solved, 72 unsolved
Search for dead transitions found 9 dead transitions in 7150ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 87/87 places, 77/86 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 3 ms. Remains 85 /87 variables (removed 2) and now considering 77/77 (removed 0) transitions.
[2024-06-01 07:19:32] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 7336 ms. Remains : 85/87 places, 77/86 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-03 finished in 10854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-15-LTLFireability-10
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 502 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 502/502 places, 414/414 transitions.
Graph (trivial) has 238 edges and 502 vertex of which 6 / 502 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1067 edges and 497 vertex of which 496 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 495 transition count 346
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 435 transition count 346
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 122 place count 435 transition count 246
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 340 place count 317 transition count 246
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 354 place count 303 transition count 232
Iterating global reduction 2 with 14 rules applied. Total rules applied 368 place count 303 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 368 place count 303 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 372 place count 301 transition count 230
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 624 place count 172 transition count 107
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 626 place count 171 transition count 111
Applied a total of 626 rules in 43 ms. Remains 171 /502 variables (removed 331) and now considering 111/414 (removed 303) transitions.
// Phase 1: matrix 111 rows 171 cols
[2024-06-01 07:19:32] [INFO ] Computed 77 invariants in 1 ms
[2024-06-01 07:19:33] [INFO ] Implicit Places using invariants in 164 ms returned [1, 2, 3, 4, 5, 8, 9, 30, 31, 32, 33, 38, 39, 40, 44, 45, 49, 50, 51, 52, 55, 56, 142, 146]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 169 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 147/502 places, 111/414 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 217 ms. Remains : 147/502 places, 111/414 transitions.
Running random walk in product with property : BusinessProcesses-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 21738 reset in 198 ms.
Product exploration explored 100000 steps with 21480 reset in 170 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/147 stabilizing places and 26/111 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 5764 steps (1411 resets) in 14 ms. (384 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 147 cols
[2024-06-01 07:19:34] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 07:19:34] [INFO ] Invariant cache hit.
[2024-06-01 07:19:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [3, 4, 5, 6, 23, 25, 36, 38, 40, 42, 44, 46, 48, 55, 57, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 125, 127, 131, 133, 137]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 304 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/147 places, 111/111 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 103 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 103 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 103
Applied a total of 14 rules in 4 ms. Remains 102 /109 variables (removed 7) and now considering 103/111 (removed 8) transitions.
// Phase 1: matrix 103 rows 102 cols
[2024-06-01 07:19:34] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 07:19:34] [INFO ] Invariant cache hit.
[2024-06-01 07:19:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:19:34] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/147 places, 103/111 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 492 ms. Remains : 102/147 places, 103/111 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 279 edges and 102 vertex of which 93 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/102 stabilizing places and 21/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 99 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 6290 steps (1519 resets) in 14 ms. (419 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 21497 reset in 80 ms.
Product exploration explored 100000 steps with 21526 reset in 90 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 103/103 transitions.
Graph (complete) has 279 edges and 102 vertex of which 93 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 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 93 transition count 99
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 93 transition count 102
Deduced a syphon composed of 19 places in 1 ms
Applied a total of 20 rules in 5 ms. Remains 93 /102 variables (removed 9) and now considering 102/103 (removed 1) transitions.
[2024-06-01 07:19:36] [INFO ] Redundant transitions in 0 ms returned []
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 93 cols
[2024-06-01 07:19:36] [INFO ] Computed 10 invariants in 0 ms
[2024-06-01 07:19:36] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:19:36] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/12 constraints. Problems are: Problem set: 2 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 95 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 5 (OVERLAPS) 101/194 variables, 93/105 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 4/109 constraints. Problems are: Problem set: 31 solved, 66 unsolved
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 2/111 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/111 constraints. Problems are: Problem set: 31 solved, 66 unsolved
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:19:37] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:19:38] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/194 variables, 3/114 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/114 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/114 constraints. Problems are: Problem set: 31 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/195 variables, and 114 constraints, problems are : Problem set: 31 solved, 66 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 31 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 5/6 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 3/76 variables, 7/13 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/16 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/16 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 2/78 variables, 1/17 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 101/179 variables, 78/95 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 4/99 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 66/165 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 0/165 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 15/194 variables, 15/180 constraints. Problems are: Problem set: 31 solved, 66 unsolved
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 3/183 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 0/183 constraints. Problems are: Problem set: 31 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 0/194 variables, 0/183 constraints. Problems are: Problem set: 31 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/195 variables, and 183 constraints, problems are : Problem set: 31 solved, 66 unsolved in 3287 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 66/97 constraints, Known Traps: 10/10 constraints]
After SMT, in 5642ms problems are : Problem set: 31 solved, 66 unsolved
Search for dead transitions found 31 dead transitions in 5645ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 93/102 places, 71/103 transitions.
Graph (complete) has 233 edges and 93 vertex of which 74 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 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 70 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 6 ms. Remains 70 /93 variables (removed 23) and now considering 71/71 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/102 places, 71/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5663 ms. Remains : 70/102 places, 71/103 transitions.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 102 cols
[2024-06-01 07:19:41] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 07:19:41] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 07:19:41] [INFO ] Invariant cache hit.
[2024-06-01 07:19:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:19:42] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-01 07:19:42] [INFO ] Invariant cache hit.
[2024-06-01 07:19:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 4 (OVERLAPS) 102/204 variables, 102/117 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 4/121 constraints. Problems are: Problem set: 9 solved, 89 unsolved
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 4/125 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/205 variables, and 125 constraints, problems are : Problem set: 9 solved, 89 unsolved in 1947 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 9 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 4/12 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 7/19 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 102/204 variables, 102/121 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 4/125 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 89/214 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/214 constraints. Problems are: Problem set: 9 solved, 89 unsolved
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:19:46] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/204 variables, 2/216 constraints. Problems are: Problem set: 9 solved, 89 unsolved
[2024-06-01 07:19:47] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 1/217 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/217 constraints. Problems are: Problem set: 9 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/217 constraints. Problems are: Problem set: 9 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/205 variables, and 217 constraints, problems are : Problem set: 9 solved, 89 unsolved in 5957 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 89/98 constraints, Known Traps: 7/7 constraints]
After SMT, in 7985ms problems are : Problem set: 9 solved, 89 unsolved
Search for dead transitions found 9 dead transitions in 7999ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 94/103 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 94
Applied a total of 2 rules in 2 ms. Remains 100 /102 variables (removed 2) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 100 cols
[2024-06-01 07:19:50] [INFO ] Computed 20 invariants in 0 ms
[2024-06-01 07:19:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 07:19:50] [INFO ] Invariant cache hit.
[2024-06-01 07:19:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:19:50] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [34, 40, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 192 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 97/102 places, 94/103 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 95 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 95 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 93 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 93 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 93 transition count 88
Applied a total of 9 rules in 2 ms. Remains 93 /97 variables (removed 4) and now considering 88/94 (removed 6) transitions.
// Phase 1: matrix 88 rows 93 cols
[2024-06-01 07:19:50] [INFO ] Computed 17 invariants in 3 ms
[2024-06-01 07:19:50] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 07:19:50] [INFO ] Invariant cache hit.
[2024-06-01 07:19:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:19:50] [INFO ] Implicit Places using invariants and state equation in 76 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 : 93/102 places, 88/103 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 8604 ms. Remains : 93/102 places, 88/103 transitions.
Treatment of property BusinessProcesses-PT-15-LTLFireability-10 finished in 17813 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 X(X(X((!p0 U (p1||G(!p0)))))))))'
[2024-06-01 07:19:50] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:19:50] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 07:19:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 502 places, 414 transitions and 1251 arcs took 8 ms.
Total runtime 481120 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BusinessProcesses-PT-15-LTLFireability-03
FORMULA BusinessProcesses-PT-15-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-15-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-15-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717227111709

--------------------
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-15-LTLFireability-03
ltl formula formula --ltl=/tmp/7180/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 502 places, 414 transitions and 1251 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/7180/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7180/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7180/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7180/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 504 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 503, there are 451 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): ~481 levels ~10000 states ~29672 transitions
pnml2lts-mc( 3/ 4): ~481 levels ~20000 states ~74016 transitions
pnml2lts-mc( 3/ 4): ~655 levels ~40000 states ~170552 transitions
pnml2lts-mc( 3/ 4): ~830 levels ~80000 states ~375500 transitions
pnml2lts-mc( 3/ 4): ~1355 levels ~160000 states ~801628 transitions
pnml2lts-mc( 3/ 4): ~2783 levels ~320000 states ~1602748 transitions
pnml2lts-mc( 3/ 4): ~4723 levels ~640000 states ~3528508 transitions
pnml2lts-mc( 3/ 4): ~9281 levels ~1280000 states ~7443776 transitions
pnml2lts-mc( 3/ 4): ~12674 levels ~2560000 states ~14811104 transitions
pnml2lts-mc( 3/ 4): ~12674 levels ~5120000 states ~31460112 transitions
pnml2lts-mc( 2/ 4): ~139 levels ~10240000 states ~90859580 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15320028
pnml2lts-mc( 0/ 4): unique states count: 16250844
pnml2lts-mc( 0/ 4): unique transitions count: 138148871
pnml2lts-mc( 0/ 4): - self-loop count: 208
pnml2lts-mc( 0/ 4): - claim dead count: 121487227
pnml2lts-mc( 0/ 4): - claim found count: 391617
pnml2lts-mc( 0/ 4): - claim success count: 16250852
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13091
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16250852 states 138148889 transitions, fanout: 8.501
pnml2lts-mc( 0/ 4): Total exploration time 168.620 sec (168.590 sec minimum, 168.602 sec on average)
pnml2lts-mc( 0/ 4): States per second: 96376, Transitions per second: 819291
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 188.1MB, 12.1 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 48.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 417 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 188.1MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-15-LTLFireability-08
ltl formula formula --ltl=/tmp/7180/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 502 places, 414 transitions and 1251 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7180/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7180/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7180/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7180/ltl_1_
pnml2lts-mc( 0/ 4): There are 503 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 503, there are 420 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( 0/ 4): ~137 levels ~10000 states ~39164 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~20000 states ~87424 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~40000 states ~192608 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~80000 states ~421156 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~160000 states ~897500 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~320000 states ~1954116 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~640000 states ~4186980 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~1280000 states ~8866668 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~2560000 states ~18193596 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~5120000 states ~38946392 transitions
pnml2lts-mc( 0/ 4): ~137 levels ~10240000 states ~82430628 transitions
pnml2lts-mc( 3/ 4): ~463 levels ~20480000 states ~160118900 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26626333
pnml2lts-mc( 0/ 4): unique states count: 33540720
pnml2lts-mc( 0/ 4): unique transitions count: 273748858
pnml2lts-mc( 0/ 4): - self-loop count: 255
pnml2lts-mc( 0/ 4): - claim dead count: 237409639
pnml2lts-mc( 0/ 4): - claim found count: 2780519
pnml2lts-mc( 0/ 4): - claim success count: 33540847
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11151
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33540863 states 273749835 transitions, fanout: 8.162
pnml2lts-mc( 0/ 4): Total exploration time 250.860 sec (250.840 sec minimum, 250.850 sec on average)
pnml2lts-mc( 0/ 4): States per second: 133704, Transitions per second: 1091245
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.4MB, 8.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 417 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.4MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-15-LTLFireability-10
ltl formula formula --ltl=/tmp/7180/ltl_2_
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 502 places, 414 transitions and 1251 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.090 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7180/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7180/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7180/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7180/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 503 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 503, there are 425 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( 0/ 4): ~474 levels ~10000 states ~35360 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~20000 states ~85852 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~40000 states ~182892 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~80000 states ~405148 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~160000 states ~998460 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~320000 states ~2092512 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~640000 states ~4508400 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~1280000 states ~9659080 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~2560000 states ~17946168 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~5120000 states ~38035968 transitions
pnml2lts-mc( 2/ 4): ~137 levels ~10240000 states ~80121340 transitions
pnml2lts-mc( 1/ 4): ~7305 levels ~20480000 states ~159536744 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26737406
pnml2lts-mc( 0/ 4): unique states count: 33541532
pnml2lts-mc( 0/ 4): unique transitions count: 286938493
pnml2lts-mc( 0/ 4): - self-loop count: 94
pnml2lts-mc( 0/ 4): - claim dead count: 250634452
pnml2lts-mc( 0/ 4): - claim found count: 2747505
pnml2lts-mc( 0/ 4): - claim success count: 33542290
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14787
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33542383 states 286942916 transitions, fanout: 8.555
pnml2lts-mc( 0/ 4): Total exploration time 299.130 sec (299.110 sec minimum, 299.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 112133, Transitions per second: 959258
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 319.5MB, 10.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 417 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 319.5MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-15-LTLFireability-15
ltl formula formula --ltl=/tmp/7180/ltl_3_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 502 places, 414 transitions and 1251 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.120 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7180/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7180/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7180/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7180/ltl_3_
pnml2lts-mc( 0/ 4): There are 503 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 503, there are 438 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20
pnml2lts-mc( 0/ 4): unique states count: 20
pnml2lts-mc( 0/ 4): unique transitions count: 25
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 13
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 40
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 40 states 68 transitions, fanout: 1.700
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 66.8 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 417 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~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-15"
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-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399800564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 ;