Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 161K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716307669647

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:07:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:07:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:07:51] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-21 16:07:51] [INFO ] Transformed 650 places.
[2024-05-21 16:07:51] [INFO ] Transformed 580 transitions.
[2024-05-21 16:07:51] [INFO ] Found NUPN structural information;
[2024-05-21 16:07:51] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Support contains 114 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 575 transition count 508
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 575 transition count 508
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 169 place count 545 transition count 478
Iterating global reduction 1 with 30 rules applied. Total rules applied 199 place count 545 transition count 478
Applied a total of 199 rules in 133 ms. Remains 545 /646 variables (removed 101) and now considering 478/576 (removed 98) transitions.
// Phase 1: matrix 478 rows 545 cols
[2024-05-21 16:07:51] [INFO ] Computed 105 invariants in 30 ms
[2024-05-21 16:07:51] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-21 16:07:51] [INFO ] Invariant cache hit.
[2024-05-21 16:07:52] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-21 16:07:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/545 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 91 places in 187 ms of which 30 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 115 places in 211 ms of which 4 ms to minimize.
[2024-05-21 16:08:06] [INFO ] Deduced a trap composed of 108 places in 209 ms of which 11 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 13 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 105 places in 209 ms of which 3 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 113 places in 219 ms of which 3 ms to minimize.
[2024-05-21 16:08:07] [INFO ] Deduced a trap composed of 103 places in 207 ms of which 4 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 103 places in 199 ms of which 3 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 102 places in 193 ms of which 3 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 103 places in 181 ms of which 2 ms to minimize.
[2024-05-21 16:08:08] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 4 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:08:09] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 2 ms to minimize.
[2024-05-21 16:08:10] [INFO ] Deduced a trap composed of 106 places in 252 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 2 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:08:11] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 130 places in 192 ms of which 5 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 108 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 2 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 6 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:08:12] [INFO ] Deduced a trap composed of 93 places in 189 ms of which 6 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 115 places in 193 ms of which 5 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 107 places in 204 ms of which 8 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 108 places in 200 ms of which 7 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 4 ms to minimize.
[2024-05-21 16:08:13] [INFO ] Deduced a trap composed of 109 places in 195 ms of which 5 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 108 places in 195 ms of which 7 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 4 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 4 ms to minimize.
[2024-05-21 16:08:14] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:08:15] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 4 ms to minimize.
[2024-05-21 16:08:16] [INFO ] Deduced a trap composed of 105 places in 211 ms of which 6 ms to minimize.
[2024-05-21 16:08:16] [INFO ] Deduced a trap composed of 115 places in 195 ms of which 7 ms to minimize.
[2024-05-21 16:08:16] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 6 ms to minimize.
[2024-05-21 16:08:16] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 3 ms to minimize.
[2024-05-21 16:08:16] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:08:17] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 4 ms to minimize.
[2024-05-21 16:08:17] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:08:17] [INFO ] Deduced a trap composed of 109 places in 205 ms of which 3 ms to minimize.
[2024-05-21 16:08:17] [INFO ] Deduced a trap composed of 106 places in 212 ms of which 2 ms to minimize.
[2024-05-21 16:08:18] [INFO ] Deduced a trap composed of 114 places in 189 ms of which 3 ms to minimize.
[2024-05-21 16:08:18] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 13 ms to minimize.
[2024-05-21 16:08:18] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:08:18] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:08:18] [INFO ] Deduced a trap composed of 108 places in 192 ms of which 3 ms to minimize.
[2024-05-21 16:08:18] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/1023 variables, and 165 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/545 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/545 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 60/165 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:27] [INFO ] Deduced a trap composed of 108 places in 229 ms of which 5 ms to minimize.
[2024-05-21 16:08:27] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 4 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 106 places in 176 ms of which 4 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 4 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:08:28] [INFO ] Deduced a trap composed of 102 places in 207 ms of which 6 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 105 places in 192 ms of which 5 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:08:29] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 103 places in 179 ms of which 2 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 4 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:08:30] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 140 places in 199 ms of which 6 ms to minimize.
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:31] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 110 places in 262 ms of which 6 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:08:32] [INFO ] Deduced a trap composed of 100 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 4 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 4 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 6 ms to minimize.
[2024-05-21 16:08:33] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 6 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 104 places in 194 ms of which 5 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 103 places in 188 ms of which 3 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 110 places in 187 ms of which 2 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 2 ms to minimize.
[2024-05-21 16:08:34] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 108 places in 212 ms of which 5 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 108 places in 194 ms of which 6 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 109 places in 206 ms of which 3 ms to minimize.
[2024-05-21 16:08:35] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:36] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:08:36] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:08:36] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 18 ms to minimize.
[2024-05-21 16:08:36] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:08:37] [INFO ] Deduced a trap composed of 101 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:08:37] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 3 ms to minimize.
[2024-05-21 16:08:37] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:08:37] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:08:37] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 2 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:08:38] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:08:39] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 106 places in 217 ms of which 6 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 4 ms to minimize.
[2024-05-21 16:08:40] [INFO ] Deduced a trap composed of 103 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 102 places in 192 ms of which 6 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 104 places in 201 ms of which 14 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 104 places in 210 ms of which 4 ms to minimize.
[2024-05-21 16:08:41] [INFO ] Deduced a trap composed of 103 places in 208 ms of which 5 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 5 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 5 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 4 ms to minimize.
[2024-05-21 16:08:42] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 4 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 102 places in 196 ms of which 5 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 4 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 100 places in 206 ms of which 5 ms to minimize.
[2024-05-21 16:08:43] [INFO ] Deduced a trap composed of 110 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:08:44] [INFO ] Deduced a trap composed of 109 places in 174 ms of which 2 ms to minimize.
[2024-05-21 16:08:44] [INFO ] Deduced a trap composed of 103 places in 188 ms of which 3 ms to minimize.
[2024-05-21 16:08:44] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 102 places in 267 ms of which 10 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 4 ms to minimize.
[2024-05-21 16:08:45] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:08:46] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:08:46] [INFO ] Deduced a trap composed of 102 places in 246 ms of which 6 ms to minimize.
[2024-05-21 16:08:46] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 6 ms to minimize.
[2024-05-21 16:08:46] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 2 ms to minimize.
[2024-05-21 16:08:47] [INFO ] Deduced a trap composed of 100 places in 239 ms of which 5 ms to minimize.
[2024-05-21 16:08:47] [INFO ] Deduced a trap composed of 103 places in 234 ms of which 6 ms to minimize.
[2024-05-21 16:08:47] [INFO ] Deduced a trap composed of 100 places in 239 ms of which 6 ms to minimize.
[2024-05-21 16:08:47] [INFO ] Deduced a trap composed of 98 places in 192 ms of which 4 ms to minimize.
[2024-05-21 16:08:47] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 6 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 99 places in 187 ms of which 5 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 12 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:08:48] [INFO ] Deduced a trap composed of 109 places in 199 ms of which 4 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 8 ms to minimize.
[2024-05-21 16:08:49] [INFO ] Deduced a trap composed of 107 places in 193 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 477 unsolved
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 82 places in 239 ms of which 5 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 4 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 104 places in 193 ms of which 2 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:08:50] [INFO ] Deduced a trap composed of 115 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:08:51] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:08:51] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 4 ms to minimize.
[2024-05-21 16:08:51] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:08:51] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:08:51] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:08:52] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:08:52] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:08:52] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:08:52] [INFO ] Deduced a trap composed of 105 places in 199 ms of which 5 ms to minimize.
SMT process timed out in 60307ms, After SMT, problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 545/646 places, 478/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61458 ms. Remains : 545/646 places, 478/576 transitions.
Support contains 114 out of 545 places after structural reductions.
[2024-05-21 16:08:53] [INFO ] Flatten gal took : 124 ms
[2024-05-21 16:08:53] [INFO ] Flatten gal took : 55 ms
[2024-05-21 16:08:53] [INFO ] Input system was already deterministic with 478 transitions.
RANDOM walk for 40000 steps (262 resets) in 5217 ms. (7 steps per ms) remains 34/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
[2024-05-21 16:08:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 346/418 variables, 59/59 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 120/538 variables, 45/104 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/539 variables, 1/105 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 474/1013 variables, 539/644 constraints. Problems are: Problem set: 2 solved, 32 unsolved
[2024-05-21 16:08:58] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:08:58] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 11 ms to minimize.
[2024-05-21 16:08:58] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:08:58] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:08:58] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 10 ms to minimize.
[2024-05-21 16:08:58] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:08:59] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:08:59] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:08:59] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:08:59] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:08:59] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:08:59] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 11 ms to minimize.
[2024-05-21 16:08:59] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-05-21 16:09:00] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:09:00] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:09:00] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:09:00] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:09:00] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 4 ms to minimize.
SMT process timed out in 5136ms, After SMT, problems are : Problem set: 2 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 545 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 544 transition count 432
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 50 rules applied. Total rules applied 96 place count 499 transition count 427
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 494 transition count 427
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 101 place count 494 transition count 332
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 303 place count 387 transition count 332
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 317 place count 373 transition count 318
Ensure Unique test removed 1 places
Iterating global reduction 3 with 15 rules applied. Total rules applied 332 place count 372 transition count 318
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 553 place count 261 transition count 208
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 554 place count 261 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 555 place count 260 transition count 207
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 564 place count 260 transition count 207
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 565 place count 259 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 566 place count 258 transition count 206
Applied a total of 566 rules in 210 ms. Remains 258 /545 variables (removed 287) and now considering 206/478 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 258/545 places, 206/478 transitions.
RANDOM walk for 40000 steps (1182 resets) in 938 ms. (42 steps per ms) remains 19/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (19 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (18 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
// Phase 1: matrix 206 rows 258 cols
[2024-05-21 16:09:01] [INFO ] Computed 90 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 85/124 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 28/152 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 65/217 variables, 31/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 4/221 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/222 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 206/428 variables, 222/295 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 13 (OVERLAPS) 36/464 variables, 36/331 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/464 variables, 17/348 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:09:02] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:09:03] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2024-05-21 16:09:04] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:09:04] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:09:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 20/368 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/464 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 0/464 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 368 constraints, problems are : Problem set: 3 solved, 16 unsolved in 3644 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 3 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 89/122 variables, 17/17 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/18 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:05] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/19 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 28/150 variables, 20/39 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 3/42 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 67/217 variables, 31/73 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 2/75 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:05] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:09:05] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:09:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:09:05] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:09:05] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:09:05] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 14 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:09:06] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:09:07] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 18/93 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:07] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 3 ms to minimize.
[2024-05-21 16:09:07] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:09:07] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2024-05-21 16:09:07] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:09:07] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 1 ms to minimize.
[2024-05-21 16:09:07] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 1 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 1 ms to minimize.
[2024-05-21 16:09:08] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 1 ms to minimize.
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 1 ms to minimize.
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 1 ms to minimize.
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 20/113 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/114 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 1/115 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:09] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:09:10] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 10/125 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/217 variables, 0/125 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 4/221 variables, 4/129 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 1/130 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:11] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:09:11] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:09:11] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2024-05-21 16:09:11] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-05-21 16:09:11] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:09:11] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:09:11] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/221 variables, 7/137 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 1 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:09:12] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-05-21 16:09:13] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/221 variables, 20/157 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:09:14] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:09:15] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:09:15] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 11/168 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/221 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 22 (OVERLAPS) 1/222 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/222 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/222 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 206/428 variables, 222/392 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/428 variables, 7/399 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2024-05-21 16:09:16] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 1 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 1 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:09:17] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:09:18] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:09:18] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/428 variables, 20/419 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:18] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 3 ms to minimize.
[2024-05-21 16:09:18] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 4 ms to minimize.
[2024-05-21 16:09:18] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 4 ms to minimize.
[2024-05-21 16:09:18] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 4 ms to minimize.
[2024-05-21 16:09:19] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 4 ms to minimize.
[2024-05-21 16:09:19] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:09:19] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:09:19] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:09:19] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2024-05-21 16:09:19] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 1 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 1 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:09:20] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:09:21] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:09:21] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 13 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/428 variables, 20/439 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/428 variables, 0/439 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 30 (OVERLAPS) 36/464 variables, 36/475 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/464 variables, 17/492 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/464 variables, 9/501 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/464 variables, 12/513 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:24] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:09:24] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/464 variables, 2/515 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:26] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/464 variables, 1/516 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/464 variables, 0/516 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:28] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
At refinement iteration 37 (OVERLAPS) 0/464 variables, 1/517 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:29] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/464 variables, 1/518 constraints. Problems are: Problem set: 3 solved, 16 unsolved
[2024-05-21 16:09:30] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/464 variables, 1/519 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/464 variables, 0/519 constraints. Problems are: Problem set: 3 solved, 16 unsolved
At refinement iteration 41 (OVERLAPS) 0/464 variables, 0/519 constraints. Problems are: Problem set: 3 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 519 constraints, problems are : Problem set: 3 solved, 16 unsolved in 27902 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 258/258 constraints, PredecessorRefiner: 16/19 constraints, Known Traps: 155/155 constraints]
After SMT, in 31566ms problems are : Problem set: 3 solved, 16 unsolved
Parikh walk visited 14 properties in 7882 ms.
Support contains 6 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 206/206 transitions.
Graph (trivial) has 58 edges and 258 vertex of which 5 / 258 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 254 transition count 188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 242 transition count 188
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 25 place count 242 transition count 171
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 67 place count 217 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 208 transition count 162
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 208 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 85 place count 208 transition count 161
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 207 transition count 161
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 128 place count 185 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 183 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 183 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 182 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 181 transition count 161
Applied a total of 135 rules in 76 ms. Remains 181 /258 variables (removed 77) and now considering 161/206 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 181/258 places, 161/206 transitions.
RANDOM walk for 40000 steps (949 resets) in 470 ms. (84 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (262 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
// Phase 1: matrix 161 rows 181 cols
[2024-05-21 16:09:41] [INFO ] Computed 79 invariants in 5 ms
[2024-05-21 16:09:41] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/75 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:09:41] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:09:41] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/84 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/122 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/126 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 155/281 variables, 126/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 60/341 variables, 54/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 26/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/341 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/341 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/342 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/342 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/75 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/84 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/122 variables, 21/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:09:41] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-21 16:09:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/126 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 155/281 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/281 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 60/341 variables, 54/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/341 variables, 26/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/341 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/341 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/342 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/342 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/342 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 181/181 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 161/161 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 181 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 180 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 178 transition count 158
Applied a total of 6 rules in 19 ms. Remains 178 /181 variables (removed 3) and now considering 158/161 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 178/181 places, 158/161 transitions.
RANDOM walk for 40000 steps (986 resets) in 370 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (282 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Probably explored full state space saw : 11869 states, properties seen :0
Probabilistic random walk after 40295 steps, saw 11869 distinct states, run finished after 173 ms. (steps per millisecond=232 ) properties seen :0
Explored full state space saw : 11869 states, properties seen :0
Exhaustive walk after 40295 steps, saw 11869 distinct states, run finished after 140 ms. (steps per millisecond=287 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 24 ms
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:09:42] [INFO ] Input system was already deterministic with 478 transitions.
Computed a total of 229 stabilizing places and 201 stable transitions
Graph (complete) has 1188 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 514 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 503 transition count 436
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 503 transition count 436
Applied a total of 84 rules in 40 ms. Remains 503 /545 variables (removed 42) and now considering 436/478 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 503/545 places, 436/478 transitions.
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 21 ms
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:09:42] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 515 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 515 transition count 448
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 505 transition count 438
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 505 transition count 438
Applied a total of 80 rules in 38 ms. Remains 505 /545 variables (removed 40) and now considering 438/478 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 505/545 places, 438/478 transitions.
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 24 ms
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 28 ms
[2024-05-21 16:09:42] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 515 transition count 448
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 515 transition count 448
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 506 transition count 439
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 506 transition count 439
Applied a total of 78 rules in 31 ms. Remains 506 /545 variables (removed 39) and now considering 439/478 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 506/545 places, 439/478 transitions.
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 22 ms
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:09:42] [INFO ] Input system was already deterministic with 439 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 537 transition count 395
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 463 transition count 394
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 414 place count 306 transition count 258
Ensure Unique test removed 1 places
Iterating global reduction 3 with 31 rules applied. Total rules applied 445 place count 305 transition count 258
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 445 place count 305 transition count 256
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 449 place count 303 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 693 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 694 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 695 place count 177 transition count 135
Applied a total of 695 rules in 95 ms. Remains 177 /545 variables (removed 368) and now considering 135/478 (removed 343) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 177/545 places, 135/478 transitions.
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:09:42] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:09:43] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 415 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 689 place count 182 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 690 place count 181 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 691 place count 180 transition count 136
Applied a total of 691 rules in 89 ms. Remains 180 /545 variables (removed 365) and now considering 136/478 (removed 342) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 89 ms. Remains : 180/545 places, 136/478 transitions.
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 7 ms
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 14 ms
[2024-05-21 16:09:43] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 40000 steps (6852 resets) in 536 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1701 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 98 steps, run visited all 1 properties in 5 ms. (steps per millisecond=19 )
Probabilistic random walk after 98 steps, saw 70 distinct states, run finished after 8 ms. (steps per millisecond=12 ) properties seen :1
FORMULA BusinessProcesses-PT-17-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 152 place count 462 transition count 287
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 386 place count 335 transition count 287
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 416 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 695 place count 178 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 177 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 697 place count 176 transition count 134
Applied a total of 697 rules in 69 ms. Remains 176 /545 variables (removed 369) and now considering 134/478 (removed 344) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 176/545 places, 134/478 transitions.
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 16 ms
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:09:43] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 516 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 505 transition count 438
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 505 transition count 438
Applied a total of 80 rules in 34 ms. Remains 505 /545 variables (removed 40) and now considering 438/478 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 505/545 places, 438/478 transitions.
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 26 ms
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 31 ms
[2024-05-21 16:09:43] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 268 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 537 transition count 396
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 464 transition count 396
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 148 place count 464 transition count 291
Deduced a syphon composed of 105 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 376 place count 341 transition count 291
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 407 place count 310 transition count 260
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 439 place count 309 transition count 260
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 439 place count 309 transition count 258
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 443 place count 307 transition count 258
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 687 place count 183 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 688 place count 182 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 689 place count 181 transition count 137
Applied a total of 689 rules in 70 ms. Remains 181 /545 variables (removed 364) and now considering 137/478 (removed 341) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 181/545 places, 137/478 transitions.
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:09:43] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 512 transition count 445
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 512 transition count 445
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 501 transition count 434
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 501 transition count 434
Applied a total of 88 rules in 34 ms. Remains 501 /545 variables (removed 44) and now considering 434/478 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 501/545 places, 434/478 transitions.
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 21 ms
[2024-05-21 16:09:43] [INFO ] Flatten gal took : 25 ms
[2024-05-21 16:09:43] [INFO ] Input system was already deterministic with 434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 516 transition count 449
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 516 transition count 449
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 506 transition count 439
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 506 transition count 439
Applied a total of 78 rules in 36 ms. Remains 506 /545 variables (removed 39) and now considering 439/478 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 506/545 places, 439/478 transitions.
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 13 ms
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 33 ms
[2024-05-21 16:09:44] [INFO ] Input system was already deterministic with 439 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 520 transition count 453
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 520 transition count 453
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 512 transition count 445
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 512 transition count 445
Applied a total of 66 rules in 36 ms. Remains 512 /545 variables (removed 33) and now considering 445/478 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 512/545 places, 445/478 transitions.
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 26 ms
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 26 ms
[2024-05-21 16:09:44] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 543 transition count 410
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 477 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 475 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 137 place count 475 transition count 297
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 378 place count 345 transition count 297
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 410 place count 313 transition count 265
Ensure Unique test removed 1 places
Iterating global reduction 3 with 33 rules applied. Total rules applied 443 place count 312 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 443 place count 312 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 447 place count 310 transition count 263
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 687 place count 188 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 688 place count 187 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 689 place count 186 transition count 144
Applied a total of 689 rules in 66 ms. Remains 186 /545 variables (removed 359) and now considering 144/478 (removed 334) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 186/545 places, 144/478 transitions.
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:09:44] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 514 transition count 447
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 514 transition count 447
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 504 transition count 437
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 504 transition count 437
Applied a total of 82 rules in 38 ms. Remains 504 /545 variables (removed 41) and now considering 437/478 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 504/545 places, 437/478 transitions.
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 11 ms
[2024-05-21 16:09:44] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 270 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 537 transition count 395
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 463 transition count 395
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 150 place count 463 transition count 289
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 382 place count 337 transition count 289
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 412 place count 307 transition count 259
Ensure Unique test removed 1 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 443 place count 306 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 443 place count 306 transition count 257
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 693 place count 179 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 694 place count 178 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 695 place count 177 transition count 135
Applied a total of 695 rules in 66 ms. Remains 177 /545 variables (removed 368) and now considering 135/478 (removed 343) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 177/545 places, 135/478 transitions.
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 20 ms
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:09:44] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (complete) has 1188 edges and 545 vertex of which 544 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 543 transition count 410
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 477 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 475 transition count 408
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 137 place count 475 transition count 297
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 378 place count 345 transition count 297
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 408 place count 315 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 3 with 31 rules applied. Total rules applied 439 place count 314 transition count 267
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 439 place count 314 transition count 265
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 443 place count 312 transition count 265
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 683 place count 190 transition count 147
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 684 place count 190 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 189 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 188 transition count 146
Applied a total of 686 rules in 67 ms. Remains 188 /545 variables (removed 357) and now considering 146/478 (removed 332) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 188/545 places, 146/478 transitions.
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 19 ms
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:09:44] [INFO ] Input system was already deterministic with 146 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 478/478 transitions.
Graph (trivial) has 271 edges and 545 vertex of which 7 / 545 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1181 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 537 transition count 394
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 462 transition count 394
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 152 place count 462 transition count 288
Deduced a syphon composed of 106 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 384 place count 336 transition count 288
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 415 place count 305 transition count 257
Ensure Unique test removed 1 places
Iterating global reduction 2 with 32 rules applied. Total rules applied 447 place count 304 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 447 place count 304 transition count 255
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 451 place count 302 transition count 255
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 691 place count 180 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 692 place count 179 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 693 place count 178 transition count 136
Applied a total of 693 rules in 59 ms. Remains 178 /545 variables (removed 367) and now considering 136/478 (removed 342) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 178/545 places, 136/478 transitions.
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 6 ms
[2024-05-21 16:09:44] [INFO ] Flatten gal took : 5 ms
[2024-05-21 16:09:44] [INFO ] Input system was already deterministic with 136 transitions.
RANDOM walk for 40000 steps (6860 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1731 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 520 steps, run visited all 1 properties in 6 ms. (steps per millisecond=86 )
Probabilistic random walk after 520 steps, saw 261 distinct states, run finished after 6 ms. (steps per millisecond=86 ) properties seen :1
FORMULA BusinessProcesses-PT-17-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-21 16:09:45] [INFO ] Flatten gal took : 12 ms
[2024-05-21 16:09:45] [INFO ] Flatten gal took : 27 ms
[2024-05-21 16:09:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2024-05-21 16:09:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 545 places, 478 transitions and 1502 arcs took 7 ms.
Total runtime 114229 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-17

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 545
TRANSITIONS: 478
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1653
MODEL NAME: /home/mcc/execution/417/model
545 places, 478 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

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

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-17, 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 r047-tajo-171620398500578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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