Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 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 148K 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-13-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717225757675

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:09:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:09:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:09:19] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-01 07:09:19] [INFO ] Transformed 593 places.
[2024-06-01 07:09:19] [INFO ] Transformed 536 transitions.
[2024-06-01 07:09:19] [INFO ] Found NUPN structural information;
[2024-06-01 07:09:19] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
Support contains 137 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 69 place count 516 transition count 464
Iterating global reduction 1 with 64 rules applied. Total rules applied 133 place count 516 transition count 464
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 162 place count 487 transition count 435
Iterating global reduction 1 with 29 rules applied. Total rules applied 191 place count 487 transition count 435
Applied a total of 191 rules in 108 ms. Remains 487 /585 variables (removed 98) and now considering 435/528 (removed 93) transitions.
// Phase 1: matrix 435 rows 487 cols
[2024-06-01 07:09:19] [INFO ] Computed 90 invariants in 43 ms
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-06-01 07:09:20] [INFO ] Invariant cache hit.
[2024-06-01 07:09:20] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-06-01 07:09:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 29 ms to minimize.
[2024-06-01 07:09:30] [INFO ] Deduced a trap composed of 114 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 108 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:32] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 113 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 110 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 15 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 106 places in 189 ms of which 4 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:09:34] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 113 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 6 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:35] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:09:36] [INFO ] Deduced a trap composed of 102 places in 192 ms of which 5 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 103 places in 175 ms of which 5 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 104 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:09:37] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:09:38] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 11 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:09:39] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:09:46] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 9 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:47] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:09:49] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 115 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 5 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:50] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 30220ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30245ms
Starting structural reductions in LTL mode, iteration 1 : 487/585 places, 435/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31238 ms. Remains : 487/585 places, 435/528 transitions.
Support contains 137 out of 487 places after structural reductions.
[2024-06-01 07:09:51] [INFO ] Flatten gal took : 75 ms
[2024-06-01 07:09:51] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:09:51] [INFO ] Input system was already deterministic with 435 transitions.
RANDOM walk for 40000 steps (285 resets) in 1740 ms. (22 steps per ms) remains 61/97 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
[2024-06-01 07:09:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 220/313 variables, 33/33 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 77/390 variables, 19/52 constraints. Problems are: Problem set: 2 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 59 unsolved
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 5 (OVERLAPS) 87/477 variables, 38/90 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/90 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 428/905 variables, 477/567 constraints. Problems are: Problem set: 4 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 0/567 constraints. Problems are: Problem set: 4 solved, 57 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 9 (OVERLAPS) 11/916 variables, 6/573 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/916 variables, 0/573 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 6/922 variables, 4/577 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/922 variables, 0/577 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/922 variables, 0/577 constraints. Problems are: Problem set: 9 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 922/922 variables, and 577 constraints, problems are : Problem set: 9 solved, 52 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 218/298 variables, 31/31 constraints. Problems are: Problem set: 9 solved, 52 unsolved
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:09:57] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 108 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/51 constraints. Problems are: Problem set: 9 solved, 52 unsolved
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:00] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/71 constraints. Problems are: Problem set: 9 solved, 52 unsolved
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:10:01] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:10:02] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
SMT process timed out in 10126ms, After SMT, problems are : Problem set: 9 solved, 52 unsolved
Fused 52 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 80 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (complete) has 1079 edges and 487 vertex of which 486 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 486 transition count 394
Reduce places removed 40 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 446 transition count 391
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 87 place count 443 transition count 391
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 87 place count 443 transition count 323
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 145 rules applied. Total rules applied 232 place count 366 transition count 323
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 242 place count 356 transition count 313
Iterating global reduction 3 with 10 rules applied. Total rules applied 252 place count 356 transition count 313
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 252 place count 356 transition count 311
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 257 place count 353 transition count 311
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 453 place count 254 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 454 place count 254 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 456 place count 253 transition count 217
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 462 place count 253 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 463 place count 252 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 464 place count 251 transition count 216
Applied a total of 464 rules in 138 ms. Remains 251 /487 variables (removed 236) and now considering 216/435 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 251/487 places, 216/435 transitions.
RANDOM walk for 40000 steps (2077 resets) in 1624 ms. (24 steps per ms) remains 49/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (32 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (32 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (29 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (35 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (32 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (33 resets) in 44 ms. (88 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
Interrupted probabilistic random walk after 401841 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :26 out of 49
Probabilistic random walk after 401841 steps, saw 63221 distinct states, run finished after 3005 ms. (steps per millisecond=133 ) properties seen :26
// Phase 1: matrix 216 rows 251 cols
[2024-06-01 07:10:06] [INFO ] Computed 77 invariants in 5 ms
[2024-06-01 07:10:06] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 87/125 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 39/164 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 55/219 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 4/223 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 214/438 variables, 224/290 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 29/467 variables, 27/322 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/467 variables, 11/333 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/467 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (OVERLAPS) 0/467 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 333 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 251/251 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 87/125 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 39/164 variables, 21/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 55/219 variables, 25/93 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
Problem AtomicPropp89 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 20/113 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 3 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 12/125 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 4 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 20/145 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 9/154 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:15] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 20/174 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:16] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 20/194 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 20/214 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:10:19] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:20] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 20/234 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:21] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:22] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 20/254 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:23] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 11/265 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 4/223 variables, 4/269 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/223 variables, 8/277 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/223 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 24 (OVERLAPS) 1/224 variables, 1/278 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/224 variables, 1/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:26] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:10:27] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/224 variables, 20/299 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:29] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/224 variables, 20/319 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/224 variables, 2/321 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/224 variables, 8/329 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/224 variables, 3/332 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/224 variables, 20/352 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/224 variables, 9/361 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/224 variables, 0/361 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 34 (OVERLAPS) 214/438 variables, 224/585 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/438 variables, 5/590 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/438 variables, 19/609 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/438 variables, 0/609 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 38 (OVERLAPS) 29/467 variables, 27/636 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/467 variables, 11/647 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/467 variables, 3/650 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/467 variables, 4/654 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/467 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
At refinement iteration 43 (OVERLAPS) 0/467 variables, 4/658 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/467 variables, 1/659 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 659 constraints, problems are : Problem set: 1 solved, 22 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 251/251 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 22/23 constraints, Known Traps: 304/304 constraints]
After SMT, in 46101ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 216/216 transitions.
Graph (trivial) has 41 edges and 251 vertex of which 2 / 251 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 250 transition count 206
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 242 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 241 transition count 205
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 19 place count 241 transition count 189
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 56 place count 220 transition count 189
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 60 place count 216 transition count 185
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 216 transition count 185
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 203 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 92 place count 202 transition count 183
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 202 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 200 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 199 transition count 180
Applied a total of 97 rules in 68 ms. Remains 199 /251 variables (removed 52) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 199/251 places, 180/216 transitions.
RANDOM walk for 40000 steps (1168 resets) in 345 ms. (115 steps per ms) remains 4/22 properties
BEST_FIRST walk for 40004 steps (380 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (388 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (321 resets) in 113 ms. (350 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (302 resets) in 297 ms. (134 steps per ms) remains 2/3 properties
// Phase 1: matrix 180 rows 199 cols
[2024-06-01 07:10:53] [INFO ] Computed 72 invariants in 22 ms
[2024-06-01 07:10:53] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/87 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/93 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/137 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/141 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 169/310 variables, 141/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 63/373 variables, 53/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 18/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/373 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/377 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/377 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/377 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/379 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/379 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/379 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 199/199 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/87 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/93 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/137 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/141 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 169/310 variables, 141/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 63/373 variables, 53/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 18/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/373 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/377 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/377 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/377 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/379 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/379 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/379 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 280 constraints, problems are : Problem set: 0 solved, 2 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 199/199 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 199 transition count 171
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 190 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 18 place count 190 transition count 159
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 45 place count 175 transition count 159
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 171 transition count 155
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 171 transition count 155
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 78 place count 158 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 158 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 157 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 157 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 156 transition count 141
Applied a total of 82 rules in 29 ms. Remains 156 /199 variables (removed 43) and now considering 141/180 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 156/199 places, 141/180 transitions.
RANDOM walk for 40000 steps (1800 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1003 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (990 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3269 steps, run visited all 2 properties in 24 ms. (steps per millisecond=136 )
Probabilistic random walk after 3269 steps, saw 1224 distinct states, run finished after 27 ms. (steps per millisecond=121 ) properties seen :2
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 25 ms
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 22 ms
[2024-06-01 07:10:54] [INFO ] Input system was already deterministic with 435 transitions.
Support contains 91 out of 487 places (down from 97) after GAL structural reductions.
Computed a total of 138 stabilizing places and 131 stable transitions
Graph (complete) has 1079 edges and 487 vertex of which 486 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 243 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 480 transition count 362
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 415 transition count 362
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 132 place count 415 transition count 266
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 341 place count 302 transition count 266
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 369 place count 274 transition count 238
Iterating global reduction 2 with 28 rules applied. Total rules applied 397 place count 274 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 397 place count 274 transition count 235
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 404 place count 270 transition count 235
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 617 place count 162 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 619 place count 161 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 620 place count 160 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 621 place count 159 transition count 128
Applied a total of 621 rules in 48 ms. Remains 159 /487 variables (removed 328) and now considering 128/435 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 159/487 places, 128/435 transitions.
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:10:54] [INFO ] Input system was already deterministic with 128 transitions.
RANDOM walk for 40000 steps (8461 resets) in 766 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2385 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 158 steps, run visited all 1 properties in 5 ms. (steps per millisecond=31 )
Probabilistic random walk after 158 steps, saw 106 distinct states, run finished after 5 ms. (steps per millisecond=31 ) properties seen :1
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 405
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 405
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 446 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 446 transition count 394
Applied a total of 82 rules in 21 ms. Remains 446 /487 variables (removed 41) and now considering 394/435 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 446/487 places, 394/435 transitions.
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 19 ms
[2024-06-01 07:10:54] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 448 transition count 396
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 448 transition count 396
Applied a total of 78 rules in 19 ms. Remains 448 /487 variables (removed 39) and now considering 396/435 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 448/487 places, 396/435 transitions.
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 17 ms
[2024-06-01 07:10:54] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 459 transition count 407
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 459 transition count 407
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 449 transition count 397
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 449 transition count 397
Applied a total of 76 rules in 20 ms. Remains 449 /487 variables (removed 38) and now considering 397/435 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 449/487 places, 397/435 transitions.
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:10:54] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 464 transition count 412
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 464 transition count 412
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 455 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 455 transition count 403
Applied a total of 64 rules in 19 ms. Remains 455 /487 variables (removed 32) and now considering 403/435 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 455/487 places, 403/435 transitions.
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:10:54] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:10:54] [INFO ] Input system was already deterministic with 403 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 238 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 480 transition count 365
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 418 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 417 transition count 364
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 128 place count 417 transition count 271
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 329 place count 309 transition count 271
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 283 transition count 245
Iterating global reduction 3 with 26 rules applied. Total rules applied 381 place count 283 transition count 245
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 381 place count 283 transition count 242
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 388 place count 279 transition count 242
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 605 place count 169 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 607 place count 168 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 608 place count 167 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 609 place count 166 transition count 133
Applied a total of 609 rules in 47 ms. Remains 166 /487 variables (removed 321) and now considering 133/435 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 166/487 places, 133/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 7 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 405
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 405
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 446 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 446 transition count 394
Applied a total of 82 rules in 19 ms. Remains 446 /487 variables (removed 41) and now considering 394/435 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 446/487 places, 394/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 448 transition count 396
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 448 transition count 396
Applied a total of 78 rules in 21 ms. Remains 448 /487 variables (removed 39) and now considering 396/435 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 448/487 places, 396/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 461 transition count 409
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 461 transition count 409
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 453 transition count 401
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 453 transition count 401
Applied a total of 68 rules in 19 ms. Remains 453 /487 variables (removed 34) and now considering 401/435 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 453/487 places, 401/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 13 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 244 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 480 transition count 362
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 415 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 414 transition count 361
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 134 place count 414 transition count 265
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 343 place count 301 transition count 265
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 370 place count 274 transition count 238
Iterating global reduction 3 with 27 rules applied. Total rules applied 397 place count 274 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 397 place count 274 transition count 235
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 404 place count 270 transition count 235
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 619 place count 161 transition count 129
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 3 with 2 rules applied. Total rules applied 621 place count 160 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 622 place count 159 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 623 place count 158 transition count 127
Applied a total of 623 rules in 39 ms. Remains 158 /487 variables (removed 329) and now considering 127/435 (removed 308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 158/487 places, 127/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 40000 steps (8411 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2451 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5986 steps, run visited all 1 properties in 18 ms. (steps per millisecond=332 )
Probabilistic random walk after 5986 steps, saw 1825 distinct states, run finished after 18 ms. (steps per millisecond=332 ) properties seen :1
FORMULA BusinessProcesses-PT-13-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 447 transition count 395
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 447 transition count 395
Applied a total of 80 rules in 19 ms. Remains 447 /487 variables (removed 40) and now considering 395/435 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 447/487 places, 395/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 16 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 395 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 239 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 480 transition count 362
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 415 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 414 transition count 361
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 134 place count 414 transition count 269
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 335 place count 305 transition count 269
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 361 place count 279 transition count 243
Iterating global reduction 3 with 26 rules applied. Total rules applied 387 place count 279 transition count 243
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 387 place count 279 transition count 240
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 394 place count 275 transition count 240
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 598 place count 172 transition count 139
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 3 with 2 rules applied. Total rules applied 600 place count 171 transition count 138
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 606 place count 171 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 607 place count 170 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 608 place count 169 transition count 137
Applied a total of 608 rules in 39 ms. Remains 169 /487 variables (removed 318) and now considering 137/435 (removed 298) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 169/487 places, 137/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 447 transition count 395
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 447 transition count 395
Applied a total of 80 rules in 19 ms. Remains 447 /487 variables (removed 40) and now considering 395/435 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 447/487 places, 395/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 395 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Graph (trivial) has 236 edges and 487 vertex of which 6 / 487 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 1073 edges and 482 vertex of which 481 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 480 transition count 364
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 417 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 416 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 130 place count 416 transition count 272
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 327 place count 310 transition count 272
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 351 place count 286 transition count 248
Iterating global reduction 3 with 24 rules applied. Total rules applied 375 place count 286 transition count 248
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 375 place count 286 transition count 245
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 382 place count 282 transition count 245
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 592 place count 176 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 594 place count 175 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 595 place count 174 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 173 transition count 139
Applied a total of 596 rules in 33 ms. Remains 173 /487 variables (removed 314) and now considering 139/435 (removed 296) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 173/487 places, 139/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 6 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 457 transition count 405
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 457 transition count 405
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 446 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 446 transition count 394
Applied a total of 82 rules in 18 ms. Remains 446 /487 variables (removed 41) and now considering 394/435 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 446/487 places, 394/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 435/435 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 458 transition count 406
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 458 transition count 406
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 447 transition count 395
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 447 transition count 395
Applied a total of 80 rules in 18 ms. Remains 447 /487 variables (removed 40) and now considering 395/435 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 447/487 places, 395/435 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 11 ms
[2024-06-01 07:10:55] [INFO ] Input system was already deterministic with 395 transitions.
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:10:55] [INFO ] Flatten gal took : 12 ms
[2024-06-01 07:10:55] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 07:10:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 487 places, 435 transitions and 1375 arcs took 3 ms.
Total runtime 96593 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-01
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-02
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-03
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-04
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-05
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-06
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-07
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-08
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-10
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2024-11
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2023-12
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2023-13
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2023-14
Could not compute solution for formula : BusinessProcesses-PT-13-CTLFireability-2023-15

BK_STOP 1717225856246

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/2007/ctl_0_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2007/ctl_1_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/2007/ctl_2_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2007/ctl_3_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/2007/ctl_4_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/2007/ctl_5_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/2007/ctl_6_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/2007/ctl_7_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/2007/ctl_8_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/2007/ctl_9_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/2007/ctl_10_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/2007/ctl_11_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/2007/ctl_12_
ctl formula name BusinessProcesses-PT-13-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/2007/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-13"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-13, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399700546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;