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.r047-tajo-171620398500572.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 greatspnxred
Input is BusinessProcesses-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 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 159K 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-16-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716307461124

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:04:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:04:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:04:23] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-05-21 16:04:23] [INFO ] Transformed 638 places.
[2024-05-21 16:04:23] [INFO ] Transformed 578 transitions.
[2024-05-21 16:04:23] [INFO ] Found NUPN structural information;
[2024-05-21 16:04:23] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 99 place count 531 transition count 476
Iterating global reduction 1 with 94 rules applied. Total rules applied 193 place count 531 transition count 476
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 243 place count 481 transition count 426
Iterating global reduction 1 with 50 rules applied. Total rules applied 293 place count 481 transition count 426
Applied a total of 293 rules in 150 ms. Remains 481 /630 variables (removed 149) and now considering 426/570 (removed 144) transitions.
// Phase 1: matrix 426 rows 481 cols
[2024-05-21 16:04:23] [INFO ] Computed 95 invariants in 29 ms
[2024-05-21 16:04:24] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-21 16:04:24] [INFO ] Invariant cache hit.
[2024-05-21 16:04:24] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-21 16:04:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 23 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:04:35] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:04:36] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:04:37] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:38] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 6 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:39] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:04:40] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:04:41] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 7 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:42] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/155 constraints. Problems are: Problem set: 4 solved, 421 unsolved
[2024-05-21 16:04:45] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:04:46] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:04:47] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:04:48] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/175 constraints. Problems are: Problem set: 23 solved, 402 unsolved
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:04:49] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:04:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:04:51] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/195 constraints. Problems are: Problem set: 31 solved, 394 unsolved
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:04:52] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 1 ms to minimize.
[2024-05-21 16:04:53] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:04:54] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/215 constraints. Problems are: Problem set: 32 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/907 variables, and 215 constraints, problems are : Problem set: 32 solved, 393 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/481 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 32 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 37/37 constraints. Problems are: Problem set: 32 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 32 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/481 variables, 56/93 constraints. Problems are: Problem set: 32 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 2/95 constraints. Problems are: Problem set: 32 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 120/215 constraints. Problems are: Problem set: 32 solved, 393 unsolved
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:04:59] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:05:00] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:05:01] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 20/235 constraints. Problems are: Problem set: 32 solved, 393 unsolved
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:05:02] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 4 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:05:03] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2024-05-21 16:05:04] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:05:05] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 20/255 constraints. Problems are: Problem set: 32 solved, 393 unsolved
[2024-05-21 16:05:06] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:05:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:05:08] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:05:08] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2024-05-21 16:05:08] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:05:08] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 15 ms to minimize.
[2024-05-21 16:05:09] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:05:10] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 20/275 constraints. Problems are: Problem set: 32 solved, 393 unsolved
[2024-05-21 16:05:11] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-21 16:05:12] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 2 ms to minimize.
[2024-05-21 16:05:13] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:05:13] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:05:13] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:05:14] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:05:14] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:05:14] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:05:14] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:05:15] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:05:16] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 20/295 constraints. Problems are: Problem set: 32 solved, 393 unsolved
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:05:21] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:05:22] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:05:23] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
Problem TDEAD338 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 20/315 constraints. Problems are: Problem set: 33 solved, 392 unsolved
[2024-05-21 16:05:24] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:05:24] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:05:24] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:05:25] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 6 ms to minimize.
[2024-05-21 16:05:25] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:05:25] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
SMT process timed out in 60488ms, After SMT, problems are : Problem set: 33 solved, 392 unsolved
Search for dead transitions found 33 dead transitions in 60526ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 481/630 places, 393/570 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 480 transition count 393
Applied a total of 1 rules in 31 ms. Remains 480 /481 variables (removed 1) and now considering 393/393 (removed 0) transitions.
// Phase 1: matrix 393 rows 480 cols
[2024-05-21 16:05:25] [INFO ] Computed 100 invariants in 10 ms
[2024-05-21 16:05:25] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-21 16:05:25] [INFO ] Invariant cache hit.
[2024-05-21 16:05:26] [INFO ] Implicit Places using invariants and state equation in 456 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 479/630 places, 393/570 transitions.
Applied a total of 0 rules in 23 ms. Remains 479 /479 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62717 ms. Remains : 479/630 places, 393/570 transitions.
Support contains 36 out of 479 places after structural reductions.
[2024-05-21 16:05:26] [INFO ] Flatten gal took : 72 ms
[2024-05-21 16:05:26] [INFO ] Flatten gal took : 32 ms
[2024-05-21 16:05:26] [INFO ] Input system was already deterministic with 393 transitions.
Support contains 33 out of 479 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (268 resets) in 1726 ms. (23 steps per ms) remains 12/26 properties
BEST_FIRST walk for 40004 steps (46 resets) in 185 ms. (215 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (62 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (35 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (46 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (47 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (45 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (47 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
// Phase 1: matrix 393 rows 479 cols
[2024-05-21 16:05:27] [INFO ] Computed 99 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 257/274 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 16:05:28] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2024-05-21 16:05:28] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 1 ms to minimize.
[2024-05-21 16:05:28] [INFO ] Deduced a trap composed of 62 places in 600 ms of which 2 ms to minimize.
[2024-05-21 16:05:29] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:05:29] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:05:29] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 84/358 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 16:05:29] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:05:29] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 0 ms to minimize.
[2024-05-21 16:05:30] [INFO ] Deduced a trap composed of 20 places in 427 ms of which 1 ms to minimize.
[2024-05-21 16:05:30] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:05:30] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 7 (OVERLAPS) 112/470 variables, 43/110 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-21 16:05:30] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 4 ms to minimize.
[2024-05-21 16:05:30] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:05:31] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:05:32] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
SMT process timed out in 5041ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 479 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 479/479 places, 393/393 transitions.
Graph (complete) has 1015 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 478 transition count 345
Reduce places removed 47 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 52 rules applied. Total rules applied 100 place count 431 transition count 340
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 426 transition count 340
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 105 place count 426 transition count 245
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 310 place count 316 transition count 245
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 314 place count 312 transition count 241
Iterating global reduction 3 with 4 rules applied. Total rules applied 318 place count 312 transition count 241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 318 place count 312 transition count 240
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 320 place count 311 transition count 240
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 263 rules applied. Total rules applied 583 place count 174 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 584 place count 174 transition count 113
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 585 place count 174 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 586 place count 173 transition count 112
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 591 place count 173 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 592 place count 172 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 593 place count 171 transition count 111
Applied a total of 593 rules in 103 ms. Remains 171 /479 variables (removed 308) and now considering 111/393 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 171/479 places, 111/393 transitions.
RANDOM walk for 40000 steps (3688 resets) in 1156 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1179 resets) in 159 ms. (250 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (1352 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1153 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1139 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1128 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1144 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1165 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1163 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
// Phase 1: matrix 111 rows 171 cols
[2024-05-21 16:05:33] [INFO ] Computed 72 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 100/113 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 16:05:33] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-21 16:05:34] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 22/135 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 28/163 variables, 15/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/164 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/166 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:05:35] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:05:36] [INFO ] Deduced a trap composed of 41 places in 737 ms of which 2 ms to minimize.
[2024-05-21 16:05:36] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:05:36] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 111/277 variables, 166/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 16:05:36] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:05:36] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2024-05-21 16:05:37] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/277 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 5/282 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 16:05:37] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:05:37] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/282 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/282 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/282 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 279 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3695 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 100/113 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 16:05:37] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:05:37] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:05:37] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 22/135 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 28/163 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/164 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/166 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 16:05:37] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 111/277 variables, 166/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/277 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/277 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 5/282 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/282 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/282 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/282 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/282 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 291 constraints, problems are : Problem set: 0 solved, 8 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 40/40 constraints]
After SMT, in 4607ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 78 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 483 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 130 stabilizing places and 123 stable transitions
Graph (complete) has 1015 edges and 479 vertex of which 478 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 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)&&F(G(p1)))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Graph (trivial) has 225 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1009 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 472 transition count 334
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 421 transition count 334
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 421 transition count 233
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 323 place count 303 transition count 233
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 296 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 296 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 296 transition count 225
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 339 place count 295 transition count 225
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 594 place count 162 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 161 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 597 place count 160 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 598 place count 159 transition count 106
Applied a total of 598 rules in 90 ms. Remains 159 /479 variables (removed 320) and now considering 106/393 (removed 287) transitions.
// Phase 1: matrix 106 rows 159 cols
[2024-05-21 16:05:39] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 16:05:39] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 16:05:39] [INFO ] Invariant cache hit.
[2024-05-21 16:05:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:05:39] [INFO ] Implicit Places using invariants and state equation in 202 ms returned [29, 47, 49, 51, 53, 54, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 79, 81, 83, 85, 87, 89, 91, 93, 97, 101, 103, 105, 107, 109, 145, 147, 157]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 322 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/479 places, 106/393 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 125 transition count 95
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 114 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 108 transition count 87
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 108 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 37 place count 108 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 105 transition count 84
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 64 place count 92 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 90 transition count 71
Applied a total of 68 rules in 30 ms. Remains 90 /125 variables (removed 35) and now considering 71/106 (removed 35) transitions.
// Phase 1: matrix 71 rows 90 cols
[2024-05-21 16:05:39] [INFO ] Computed 36 invariants in 1 ms
[2024-05-21 16:05:39] [INFO ] Implicit Places using invariants in 91 ms returned [28, 33, 36, 80]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 94 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/479 places, 71/393 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 84 transition count 69
Applied a total of 4 rules in 6 ms. Remains 84 /86 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 84 cols
[2024-05-21 16:05:39] [INFO ] Computed 32 invariants in 1 ms
[2024-05-21 16:05:39] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 16:05:39] [INFO ] Invariant cache hit.
[2024-05-21 16:05:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 16:05:40] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [4, 5, 6, 7, 9, 10, 11, 13, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 34, 35, 36, 77, 82]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 268 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 61/479 places, 69/393 transitions.
Graph (complete) has 194 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 56 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 56 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 55 transition count 65
Applied a total of 5 rules in 5 ms. Remains 55 /61 variables (removed 6) and now considering 65/69 (removed 4) transitions.
// Phase 1: matrix 65 rows 55 cols
[2024-05-21 16:05:40] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 16:05:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 16:05:40] [INFO ] Invariant cache hit.
[2024-05-21 16:05:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:05:40] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 55/479 places, 65/393 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 967 ms. Remains : 55/479 places, 65/393 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-00 finished in 1301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&(p1 U p2)))||G(p3)))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 472 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 472 transition count 386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 471 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 471 transition count 385
Applied a total of 16 rules in 36 ms. Remains 471 /479 variables (removed 8) and now considering 385/393 (removed 8) transitions.
// Phase 1: matrix 385 rows 471 cols
[2024-05-21 16:05:40] [INFO ] Computed 99 invariants in 2 ms
[2024-05-21 16:05:40] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 16:05:40] [INFO ] Invariant cache hit.
[2024-05-21 16:05:41] [INFO ] Implicit Places using invariants and state equation in 368 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 385/393 transitions.
Applied a total of 0 rules in 7 ms. Remains 470 /470 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 726 ms. Remains : 470/479 places, 385/393 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p2), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-02
Entered a terminal (fully accepting) state of product in 121 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-02 finished in 993 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 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Graph (trivial) has 225 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1009 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 472 transition count 333
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 420 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 419 transition count 332
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 108 place count 419 transition count 233
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 322 place count 304 transition count 233
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 329 place count 297 transition count 226
Iterating global reduction 3 with 7 rules applied. Total rules applied 336 place count 297 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 336 place count 297 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 296 transition count 225
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 11 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 595 place count 162 transition count 102
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 597 place count 161 transition count 106
Applied a total of 597 rules in 81 ms. Remains 161 /479 variables (removed 318) and now considering 106/393 (removed 287) transitions.
// Phase 1: matrix 106 rows 161 cols
[2024-05-21 16:05:41] [INFO ] Computed 72 invariants in 1 ms
[2024-05-21 16:05:41] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 21, 22, 23, 24, 25, 26, 41, 42, 43, 44, 45, 124]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 121 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/479 places, 106/393 transitions.
Applied a total of 0 rules in 12 ms. Remains 140 /140 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 140/479 places, 106/393 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-03 finished in 279 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((G(F(p0)) U (p1||(p0&&G(p2))))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Graph (trivial) has 222 edges and 479 vertex of which 6 / 479 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 1009 edges and 474 vertex of which 473 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 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 472 transition count 335
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 422 transition count 333
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 420 transition count 333
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 106 place count 420 transition count 235
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 318 place count 306 transition count 235
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 324 place count 300 transition count 229
Iterating global reduction 3 with 6 rules applied. Total rules applied 330 place count 300 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 300 transition count 228
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 332 place count 299 transition count 228
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 593 place count 163 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 162 transition count 107
Applied a total of 595 rules in 59 ms. Remains 162 /479 variables (removed 317) and now considering 107/393 (removed 286) transitions.
// Phase 1: matrix 107 rows 162 cols
[2024-05-21 16:05:41] [INFO ] Computed 72 invariants in 2 ms
[2024-05-21 16:05:42] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 25, 40, 43, 44, 45, 46, 135]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 146 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/479 places, 107/393 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 142/479 places, 107/393 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-04 finished in 485 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))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 471 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 471 transition count 385
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 469 transition count 383
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 469 transition count 383
Applied a total of 20 rules in 22 ms. Remains 469 /479 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 469 cols
[2024-05-21 16:05:42] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 16:05:42] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 16:05:42] [INFO ] Invariant cache hit.
[2024-05-21 16:05:43] [INFO ] Implicit Places using invariants and state equation in 511 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 754 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 468/479 places, 383/393 transitions.
Applied a total of 0 rules in 10 ms. Remains 468 /468 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 786 ms. Remains : 468/479 places, 383/393 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-05 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p0))) U G(p1))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 472 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 472 transition count 386
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 470 transition count 384
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 470 transition count 384
Applied a total of 18 rules in 22 ms. Remains 470 /479 variables (removed 9) and now considering 384/393 (removed 9) transitions.
// Phase 1: matrix 384 rows 470 cols
[2024-05-21 16:05:43] [INFO ] Computed 99 invariants in 2 ms
[2024-05-21 16:05:43] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-21 16:05:43] [INFO ] Invariant cache hit.
[2024-05-21 16:05:43] [INFO ] Implicit Places using invariants and state equation in 342 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 544 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 469/479 places, 384/393 transitions.
Applied a total of 0 rules in 7 ms. Remains 469 /469 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 469/479 places, 384/393 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-06
Product exploration explored 100000 steps with 832 reset in 230 ms.
Stack based approach found an accepted trace after 2557 steps with 20 reset with depth 133 and stack size 133 in 7 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-06 finished in 1034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 471 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 471 transition count 385
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 469 transition count 383
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 469 transition count 383
Applied a total of 20 rules in 19 ms. Remains 469 /479 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 469 cols
[2024-05-21 16:05:44] [INFO ] Computed 99 invariants in 7 ms
[2024-05-21 16:05:44] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 16:05:44] [INFO ] Invariant cache hit.
[2024-05-21 16:05:44] [INFO ] Implicit Places using invariants and state equation in 364 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 537 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 468/479 places, 383/393 transitions.
Applied a total of 0 rules in 9 ms. Remains 468 /468 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 566 ms. Remains : 468/479 places, 383/393 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 667 reset in 300 ms.
Product exploration explored 100000 steps with 667 reset in 352 ms.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1000 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (265 resets) in 288 ms. (138 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
// Phase 1: matrix 383 rows 468 cols
[2024-05-21 16:05:46] [INFO ] Computed 98 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/343 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:05:46] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:05:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:05:46] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:05:46] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 116/459 variables, 42/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 377/836 variables, 459/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 13/849 variables, 7/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/851 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/343 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:05:46] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:05:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:05:46] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 116/459 variables, 42/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 377/836 variables, 459/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/836 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/849 variables, 7/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/851 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:05:47] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/851 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/851 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 582 constraints, problems are : Problem set: 0 solved, 1 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 1383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 383/383 transitions.
Graph (complete) has 1000 edges and 468 vertex of which 467 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 467 transition count 335
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 420 transition count 333
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 418 transition count 333
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 99 place count 418 transition count 232
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 318 place count 300 transition count 232
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 11 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 591 place count 158 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 592 place count 158 transition count 100
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 158 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 594 place count 157 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 600 place count 157 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 601 place count 156 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 602 place count 155 transition count 98
Applied a total of 602 rules in 31 ms. Remains 155 /468 variables (removed 313) and now considering 98/383 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 155/468 places, 98/383 transitions.
RANDOM walk for 40000 steps (4454 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1937 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1029 steps, run visited all 1 properties in 22 ms. (steps per millisecond=46 )
Probabilistic random walk after 1029 steps, saw 507 distinct states, run finished after 25 ms. (steps per millisecond=41 ) properties seen :1
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 383/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 468 /468 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2024-05-21 16:05:48] [INFO ] Invariant cache hit.
[2024-05-21 16:05:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 16:05:48] [INFO ] Invariant cache hit.
[2024-05-21 16:05:49] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-21 16:05:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:05:56] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:05:56] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:05:57] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
[2024-05-21 16:05:57] [INFO ] Deduced a trap composed of 95 places in 869 ms of which 6 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:05:58] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:05:59] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:05:59] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:05:59] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:05:59] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:05:59] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:05:59] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:05:59] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:00] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:06:00] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:06:00] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:06:00] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:06:00] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:06:00] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:06:00] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 85 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:06:01] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:06:02] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:06:02] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:06:02] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:06:02] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:02] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:06:03] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:06:03] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:06:03] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:06:03] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:06:03] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:06:03] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:06:03] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 3 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:06:04] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:06:05] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:06:05] [INFO ] Deduced a trap composed of 140 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:06:05] [INFO ] Deduced a trap composed of 138 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:06:05] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:08] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:06:08] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:06:08] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:06:08] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:06:08] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:06:08] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 111 places in 102 ms of which 1 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 15 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:06:09] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:06:10] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 1 ms to minimize.
[2024-05-21 16:06:10] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:06:11] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:06:11] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:06:11] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:06:11] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:12] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:06:13] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2024-05-21 16:06:13] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:06:13] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:06:13] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:06:13] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:06:14] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:06:15] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:06:15] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:15] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:06:15] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:06:15] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:06:15] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:17] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:06:17] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:06:17] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:06:17] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-21 16:06:17] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:06:18] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:06:19] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:06:19] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 2.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 2.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/851 variables, and 214 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 116/214 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:22] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 3 ms to minimize.
[2024-05-21 16:06:22] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:06:22] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:06:22] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:22] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:06:22] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:06:23] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:06:23] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:06:23] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:06:23] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:06:23] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:06:23] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:06:24] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:06:24] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:06:24] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:06:25] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:06:25] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:06:25] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:06:25] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:06:25] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:26] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:06:26] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:06:26] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:06:26] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:06:26] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:06:26] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:06:27] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:06:27] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:06:27] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:06:27] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:06:28] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:06:28] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:06:28] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:06:28] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:06:29] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:06:29] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:06:29] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:06:29] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:06:29] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:06:29] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:31] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:06:31] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:06:31] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:06:31] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:06:32] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:06:32] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:06:32] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:06:32] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-21 16:06:32] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:06:32] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:06:33] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:06:33] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:06:33] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:06:33] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:06:33] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:06:34] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:06:34] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:06:34] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:06:34] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:06:34] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:34] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:06:35] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:06:35] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:06:35] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:06:35] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:06:35] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-05-21 16:06:36] [INFO ] Deduced a trap composed of 106 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:06:36] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:06:36] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:06:37] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:06:38] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:06:38] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:06:38] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:06:38] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:06:38] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:06:38] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:06:39] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:06:39] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:06:39] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:06:39] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:42] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:06:42] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:06:42] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:06:42] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 21 ms to minimize.
[2024-05-21 16:06:42] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:06:43] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:06:44] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:06:44] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:06:44] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:06:44] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 18/312 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:06:46] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:06:46] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:06:46] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:06:46] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:06:46] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:06:47] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:06:47] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:06:47] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:06:48] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 9/321 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/851 variables, and 321 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 0/382 constraints, Known Traps: 223/223 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 468/468 places, 383/383 transitions.
Computed a total of 125 stabilizing places and 118 stable transitions
Graph (complete) has 1000 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 125 stabilizing places and 118 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (267 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 655946 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 3
Probabilistic random walk after 655946 steps, saw 104078 distinct states, run finished after 3005 ms. (steps per millisecond=218 ) properties seen :0
[2024-05-21 16:06:52] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 213/343 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 116/459 variables, 42/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 377/836 variables, 459/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/849 variables, 7/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/849 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/851 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/851 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 566 constraints, problems are : Problem set: 0 solved, 3 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 126/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 213/343 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:06:53] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 3 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:06:54] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 116/459 variables, 42/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:06:55] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 377/836 variables, 459/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:06:56] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/836 variables, 4/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/836 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 13/849 variables, 7/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:06:57] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:06:57] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:06:57] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/849 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:06:57] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/849 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/849 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/851 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 16:06:57] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:06:57] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:06:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/851 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/851 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/851 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 616 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 47/47 constraints]
After SMT, in 5330ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 10457 steps, including 43 resets, run visited all 1 properties in 26 ms. (steps per millisecond=402 )
Parikh walk visited 3 properties in 96 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 671 reset in 265 ms.
Product exploration explored 100000 steps with 667 reset in 314 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 383/383 transitions.
Graph (complete) has 1000 edges and 468 vertex of which 467 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 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 467 transition count 382
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 72 Pre rules applied. Total rules applied 48 place count 467 transition count 435
Deduced a syphon composed of 119 places in 6 ms
Iterating global reduction 1 with 72 rules applied. Total rules applied 120 place count 467 transition count 435
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 134 place count 453 transition count 409
Deduced a syphon composed of 105 places in 2 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 148 place count 453 transition count 409
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 262 places in 0 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 305 place count 453 transition count 409
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 342 place count 416 transition count 372
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 379 place count 416 transition count 372
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 227 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 381 place count 416 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 382 place count 416 transition count 375
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 384 place count 414 transition count 371
Deduced a syphon composed of 225 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 386 place count 414 transition count 371
Deduced a syphon composed of 225 places in 0 ms
Applied a total of 386 rules in 164 ms. Remains 414 /468 variables (removed 54) and now considering 371/383 (removed 12) transitions.
[2024-05-21 16:07:00] [INFO ] Redundant transitions in 29 ms returned []
Running 370 sub problems to find dead transitions.
// Phase 1: matrix 371 rows 414 cols
[2024-05-21 16:07:00] [INFO ] Computed 98 invariants in 4 ms
[2024-05-21 16:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/414 variables, 57/97 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-05-21 16:07:06] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:07:06] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:07:06] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:07:06] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:07:06] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-21 16:07:06] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:07:07] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD153 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 TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 20/118 constraints. Problems are: Problem set: 125 solved, 245 unsolved
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 16:07:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
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 TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 20/138 constraints. Problems are: Problem set: 189 solved, 181 unsolved
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-21 16:07:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
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 TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 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 TDEAD170 is UNSAT
Problem TDEAD171 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 TDEAD231 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 20/158 constraints. Problems are: Problem set: 239 solved, 131 unsolved
[2024-05-21 16:07:10] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
[2024-05-21 16:07:11] [INFO ] Deduced a trap composed of 3 places in 964 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-21 16:07:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 16:07:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD94 is UNSAT
[2024-05-21 16:07:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
[2024-05-21 16:07:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
[2024-05-21 16:07:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:07:12] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:07:13] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-05-21 16:07:13] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:07:13] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:07:13] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:07:13] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 20/178 constraints. Problems are: Problem set: 254 solved, 116 unsolved
[2024-05-21 16:07:13] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:07:13] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:07:14] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD198 is UNSAT
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD205 is UNSAT
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD207 is UNSAT
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD209 is UNSAT
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-05-21 16:07:15] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 20/198 constraints. Problems are: Problem set: 259 solved, 111 unsolved
[2024-05-21 16:07:16] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:07:16] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:07:16] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:07:16] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:07:16] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-05-21 16:07:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD281 is UNSAT
[2024-05-21 16:07:16] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 7/205 constraints. Problems are: Problem set: 260 solved, 110 unsolved
[2024-05-21 16:07:18] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:07:18] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:07:18] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:07:18] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:07:18] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:07:18] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 6/211 constraints. Problems are: Problem set: 260 solved, 110 unsolved
[2024-05-21 16:07:19] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:07:19] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 2/213 constraints. Problems are: Problem set: 260 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/213 constraints. Problems are: Problem set: 260 solved, 110 unsolved
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD318 is UNSAT
At refinement iteration 13 (OVERLAPS) 371/785 variables, 414/627 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/785 variables, 1/628 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/785 variables, 0/628 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/785 variables, 0/628 constraints. Problems are: Problem set: 271 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 785/785 variables, and 628 constraints, problems are : Problem set: 271 solved, 99 unsolved in 23844 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 414/414 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 271 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 177/365 variables, 57/57 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 1/58 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 115/173 constraints. Problems are: Problem set: 271 solved, 99 unsolved
[2024-05-21 16:07:24] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:07:24] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:07:25] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:07:26] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:07:26] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 13/186 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/186 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 46/411 variables, 40/226 constraints. Problems are: Problem set: 271 solved, 99 unsolved
[2024-05-21 16:07:27] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:07:27] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:07:27] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:07:28] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:07:28] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:07:28] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:07:28] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-21 16:07:28] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:07:28] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:07:28] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 10/236 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/236 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 371/782 variables, 411/647 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/782 variables, 1/648 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/782 variables, 99/747 constraints. Problems are: Problem set: 271 solved, 99 unsolved
[2024-05-21 16:07:33] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/782 variables, 1/748 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/782 variables, 0/748 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 3/785 variables, 3/751 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/785 variables, 0/751 constraints. Problems are: Problem set: 271 solved, 99 unsolved
At refinement iteration 16 (OVERLAPS) 0/785 variables, 0/751 constraints. Problems are: Problem set: 271 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 785/785 variables, and 751 constraints, problems are : Problem set: 271 solved, 99 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 414/414 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/370 constraints, Known Traps: 139/139 constraints]
After SMT, in 54030ms problems are : Problem set: 271 solved, 99 unsolved
Search for dead transitions found 271 dead transitions in 54036ms
Found 271 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 271 transitions
Dead transitions reduction (with SMT) removed 271 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 414/468 places, 100/383 transitions.
Graph (complete) has 725 edges and 414 vertex of which 189 are kept as prefixes of interest. Removing 225 places using SCC suffix rule.1 ms
Discarding 225 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 158 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 22 ms. Remains 158 /414 variables (removed 256) and now considering 106/100 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/468 places, 106/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54262 ms. Remains : 158/468 places, 106/383 transitions.
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 383/383 transitions.
Applied a total of 0 rules in 14 ms. Remains 468 /468 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 468 cols
[2024-05-21 16:07:54] [INFO ] Computed 98 invariants in 6 ms
[2024-05-21 16:07:54] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-21 16:07:54] [INFO ] Invariant cache hit.
[2024-05-21 16:07:55] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2024-05-21 16:07:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:08:02] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:08:03] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:08:04] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:08:05] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 111 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:08:16] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:08:16] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:08:17] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:08:17] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:18] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:08:19] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:08:19] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:08:19] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:19] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:19] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:08:19] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:08:20] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 4 ms to minimize.
[2024-05-21 16:08:21] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:08:21] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:08:21] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:08:21] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:08:21] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:23] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:08:23] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:08:23] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:08:23] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:08:23] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 4 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 3 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:08:24] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:08:25] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:08:25] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/851 variables, and 214 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 116/214 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 107 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 1 ms to minimize.
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 4 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:37] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 3 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 5 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2024-05-21 16:08:44] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:08:44] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:08:46] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 1 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 4 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 18/312 constraints. Problems are: Problem set: 0 solved, 382 unsolved
[2024-05-21 16:08:52] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:08:52] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:08:52] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:08:53] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:08:53] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:08:54] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:08:54] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:08:54] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:08:54] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 9/321 constraints. Problems are: Problem set: 0 solved, 382 unsolved
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 Int declared 468/851 variables, and 321 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 0/382 constraints, Known Traps: 223/223 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 60999 ms. Remains : 468/468 places, 383/383 transitions.
Treatment of property BusinessProcesses-PT-16-LTLFireability-07 finished in 191118 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&&G(F(p1)))))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Graph (trivial) has 223 edges and 479 vertex of which 6 / 479 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 1009 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 472 transition count 333
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 420 transition count 333
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 106 place count 420 transition count 234
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 321 place count 304 transition count 234
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 326 place count 299 transition count 229
Iterating global reduction 2 with 5 rules applied. Total rules applied 331 place count 299 transition count 229
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 596 place count 161 transition count 102
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 598 place count 160 transition count 106
Applied a total of 598 rules in 27 ms. Remains 160 /479 variables (removed 319) and now considering 106/393 (removed 287) transitions.
// Phase 1: matrix 106 rows 160 cols
[2024-05-21 16:08:55] [INFO ] Computed 71 invariants in 1 ms
[2024-05-21 16:08:56] [INFO ] Implicit Places using invariants in 676 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 40, 41, 42, 43, 44]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 678 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/479 places, 106/393 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 708 ms. Remains : 140/479 places, 106/393 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-08 finished in 943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 471 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 471 transition count 385
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 469 transition count 383
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 469 transition count 383
Applied a total of 20 rules in 21 ms. Remains 469 /479 variables (removed 10) and now considering 383/393 (removed 10) transitions.
// Phase 1: matrix 383 rows 469 cols
[2024-05-21 16:08:56] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 16:08:56] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 16:08:56] [INFO ] Invariant cache hit.
[2024-05-21 16:08:57] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 714 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 468/479 places, 383/393 transitions.
Applied a total of 0 rules in 8 ms. Remains 468 /468 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 743 ms. Remains : 468/479 places, 383/393 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-09 finished in 814 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 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Graph (trivial) has 225 edges and 479 vertex of which 6 / 479 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1009 edges and 474 vertex of which 473 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 472 transition count 333
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 420 transition count 333
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 106 place count 420 transition count 233
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 323 place count 303 transition count 233
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 296 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 296 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 337 place count 296 transition count 225
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 339 place count 295 transition count 225
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 600 place count 159 transition count 100
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 602 place count 158 transition count 104
Applied a total of 602 rules in 24 ms. Remains 158 /479 variables (removed 321) and now considering 104/393 (removed 289) transitions.
// Phase 1: matrix 104 rows 158 cols
[2024-05-21 16:08:57] [INFO ] Computed 71 invariants in 1 ms
[2024-05-21 16:08:57] [INFO ] Implicit Places using invariants in 130 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 40, 41, 42, 43, 44]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 134 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/479 places, 104/393 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 138/479 places, 104/393 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-11 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&((p1&&X(F(p2))) U ((X(F(p2))&&p3)||G((p1&&F(p2))))))))'
Support contains 3 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 472 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 472 transition count 386
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 471 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 471 transition count 385
Applied a total of 16 rules in 24 ms. Remains 471 /479 variables (removed 8) and now considering 385/393 (removed 8) transitions.
// Phase 1: matrix 385 rows 471 cols
[2024-05-21 16:08:57] [INFO ] Computed 99 invariants in 3 ms
[2024-05-21 16:08:57] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 16:08:57] [INFO ] Invariant cache hit.
[2024-05-21 16:08:58] [INFO ] Implicit Places using invariants and state equation in 400 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 577 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 470/479 places, 385/393 transitions.
Applied a total of 0 rules in 7 ms. Remains 470 /470 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 609 ms. Remains : 470/479 places, 385/393 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-13 finished in 907 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))'
Support contains 1 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 472 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 472 transition count 386
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 470 transition count 384
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 470 transition count 384
Applied a total of 18 rules in 23 ms. Remains 470 /479 variables (removed 9) and now considering 384/393 (removed 9) transitions.
// Phase 1: matrix 384 rows 470 cols
[2024-05-21 16:08:58] [INFO ] Computed 99 invariants in 5 ms
[2024-05-21 16:08:58] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 16:08:58] [INFO ] Invariant cache hit.
[2024-05-21 16:08:59] [INFO ] Implicit Places using invariants and state equation in 472 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 626 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 469/479 places, 384/393 transitions.
Applied a total of 0 rules in 7 ms. Remains 469 /469 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 656 ms. Remains : 469/479 places, 384/393 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-16-LTLFireability-14 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&G(p1))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-16-LTLFireability-07
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 479 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 479/479 places, 393/393 transitions.
Graph (complete) has 1015 edges and 479 vertex of which 478 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 52 place count 477 transition count 340
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 426 transition count 338
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 424 transition count 338
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 107 place count 424 transition count 237
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 326 place count 306 transition count 237
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 333 place count 299 transition count 230
Iterating global reduction 3 with 7 rules applied. Total rules applied 340 place count 299 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 340 place count 299 transition count 229
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 342 place count 298 transition count 229
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 11 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 263 rules applied. Total rules applied 605 place count 161 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 606 place count 161 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 607 place count 160 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 608 place count 159 transition count 101
Applied a total of 608 rules in 25 ms. Remains 159 /479 variables (removed 320) and now considering 101/393 (removed 292) transitions.
// Phase 1: matrix 101 rows 159 cols
[2024-05-21 16:08:59] [INFO ] Computed 70 invariants in 1 ms
[2024-05-21 16:08:59] [INFO ] Implicit Places using invariants in 101 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 41, 42, 43, 44]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 102 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 141/479 places, 101/393 transitions.
Applied a total of 0 rules in 2 ms. Remains 141 /141 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 129 ms. Remains : 141/479 places, 101/393 transitions.
Running random walk in product with property : BusinessProcesses-PT-16-LTLFireability-07
Product exploration explored 100000 steps with 12984 reset in 160 ms.
Product exploration explored 100000 steps with 13187 reset in 236 ms.
Computed a total of 11 stabilizing places and 8 stable transitions
Computed a total of 11 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (5242 resets) in 191 ms. (208 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (1801 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
// Phase 1: matrix 101 rows 141 cols
[2024-05-21 16:09:00] [INFO ] Computed 52 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/47 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/76 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/81 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/86 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 101/187 variables, 86/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/242 variables, 55/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 26/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/47 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/76 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/81 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/86 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 101/187 variables, 86/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/242 variables, 55/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 26/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/242 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-21 16:09:01] [INFO ] Invariant cache hit.
[2024-05-21 16:09:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 16:09:01] [INFO ] Invariant cache hit.
[2024-05-21 16:09:01] [INFO ] Implicit Places using invariants and state equation in 159 ms returned [0, 2, 7, 13, 14, 28, 30, 32, 34, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 60, 62, 64, 66, 68, 70, 72, 74, 78, 82, 84, 86, 88, 90, 127, 129, 139]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 279 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/141 places, 101/101 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 96
Applied a total of 10 rules in 3 ms. Remains 98 /103 variables (removed 5) and now considering 96/101 (removed 5) transitions.
// Phase 1: matrix 96 rows 98 cols
[2024-05-21 16:09:01] [INFO ] Computed 16 invariants in 7 ms
[2024-05-21 16:09:01] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 16:09:01] [INFO ] Invariant cache hit.
[2024-05-21 16:09:01] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/141 places, 96/101 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 455 ms. Remains : 98/141 places, 96/101 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Graph (complete) has 231 edges and 98 vertex of which 87 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 40000 steps (5238 resets) in 176 ms. (225 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (1781 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-21 16:09:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/69 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/70 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/166 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/194 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/194 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/69 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/70 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/166 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/194 variables, 28/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/194 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/194 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 84 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=84 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 13088 reset in 146 ms.
Stack based approach found an accepted trace after 72120 steps with 9429 reset with depth 37 and stack size 31 in 136 ms.
Treatment of property BusinessProcesses-PT-16-LTLFireability-07 finished in 4366 ms.
FORMULA BusinessProcesses-PT-16-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 16:09:03] [INFO ] Flatten gal took : 48 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 280645 ms.
ITS solved all properties within timeout

BK_STOP 1716307743715

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-16, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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