Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761500633.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761500633
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K May 18 16:43 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 ShieldPPPt-PT-020B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717257560108

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:59:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:59:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:59:21] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-01 15:59:21] [INFO ] Transformed 1563 places.
[2024-06-01 15:59:21] [INFO ] Transformed 1423 transitions.
[2024-06-01 15:59:21] [INFO ] Found NUPN structural information;
[2024-06-01 15:59:21] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 206 places :
Symmetric choice reduction at 0 with 206 rule applications. Total rules 206 place count 1357 transition count 1217
Iterating global reduction 0 with 206 rules applied. Total rules applied 412 place count 1357 transition count 1217
Applied a total of 412 rules in 276 ms. Remains 1357 /1563 variables (removed 206) and now considering 1217/1423 (removed 206) transitions.
// Phase 1: matrix 1217 rows 1357 cols
[2024-06-01 15:59:21] [INFO ] Computed 221 invariants in 30 ms
[2024-06-01 15:59:22] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-06-01 15:59:22] [INFO ] Invariant cache hit.
[2024-06-01 15:59:23] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
Running 1216 sub problems to find dead transitions.
[2024-06-01 15:59:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 30311ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 30336ms
Starting structural reductions in LTL mode, iteration 1 : 1357/1563 places, 1217/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32231 ms. Remains : 1357/1563 places, 1217/1423 transitions.
Support contains 76 out of 1357 places after structural reductions.
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 110 ms
[2024-06-01 15:59:54] [INFO ] Flatten gal took : 62 ms
[2024-06-01 15:59:54] [INFO ] Input system was already deterministic with 1217 transitions.
Support contains 72 out of 1357 places (down from 76) after GAL structural reductions.
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2112 ms. (18 steps per ms) remains 8/45 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
[2024-06-01 15:59:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/262 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1095/1357 variables, 189/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1217/2574 variables, 1357/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2574 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/2574 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2574/2574 variables, and 1578 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 247/262 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1095/1357 variables, 189/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 28 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 4 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2024-06-01 15:59:57] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:59:58] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 16/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1217/2574 variables, 1357/1594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2574 variables, 8/1602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 15:59:59] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:59:59] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:00:00] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2574 variables, 7/1609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 16:00:01] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2574 variables, 1/1610 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2574/2574 variables, and 1610 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 24/24 constraints]
After SMT, in 6298ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1357 transition count 942
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1082 transition count 939
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1079 transition count 939
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 556 place count 1079 transition count 785
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 864 place count 925 transition count 785
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 872 place count 917 transition count 777
Iterating global reduction 3 with 8 rules applied. Total rules applied 880 place count 917 transition count 777
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 880 place count 917 transition count 772
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 890 place count 912 transition count 772
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 328
Deduced a syphon composed of 328 places in 2 ms
Reduce places removed 328 places and 0 transitions.
Iterating global reduction 3 with 656 rules applied. Total rules applied 1546 place count 584 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1547 place count 584 transition count 443
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1549 place count 583 transition count 442
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1665 place count 525 transition count 442
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 1726 place count 525 transition count 442
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1727 place count 524 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1728 place count 523 transition count 441
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1728 place count 523 transition count 439
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1732 place count 521 transition count 439
Applied a total of 1732 rules in 322 ms. Remains 521 /1357 variables (removed 836) and now considering 439/1217 (removed 778) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 322 ms. Remains : 521/1357 places, 439/1217 transitions.
RANDOM walk for 40000 steps (8 resets) in 967 ms. (41 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
// Phase 1: matrix 439 rows 521 cols
[2024-06-01 16:00:02] [INFO ] Computed 220 invariants in 2 ms
[2024-06-01 16:00:02] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 72/85 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 46/131 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 151/282 variables, 131/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 21/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 193/475 variables, 109/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 42/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/482 variables, 7/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 7/369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/496 variables, 7/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 162/658 variables, 89/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/658 variables, 24/489 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 14/672 variables, 13/503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/672 variables, 12/515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/672 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 19/691 variables, 10/525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/691 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/691 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 129/820 variables, 88/614 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/820 variables, 26/640 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/820 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/820 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 5/825 variables, 6/647 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/825 variables, 5/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/825 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 8/833 variables, 4/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/833 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 59/892 variables, 37/693 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/892 variables, 10/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/892 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 3/895 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/895 variables, 3/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/895 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 4/899 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/899 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 40/939 variables, 25/737 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/939 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/939 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (OVERLAPS) 2/941 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/941 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/941 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (OVERLAPS) 4/945 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/945 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (OVERLAPS) 12/957 variables, 10/761 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/957 variables, 3/764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/957 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (OVERLAPS) 3/960 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/960 variables, 1/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/960 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 58 (OVERLAPS) 0/960 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 960/960 variables, and 767 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 521/521 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 72/85 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 46/131 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 151/282 variables, 131/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 193/475 variables, 109/312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 42/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 5/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 2 ms to minimize.
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 7/482 variables, 7/373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:05] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 14/496 variables, 7/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/496 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 162/658 variables, 89/478 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/658 variables, 24/502 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/658 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:06] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-06-01 16:00:06] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/658 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/658 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 14/672 variables, 13/518 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/672 variables, 12/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/672 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 19/691 variables, 10/540 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/691 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/691 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 129/820 variables, 88/629 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/820 variables, 26/655 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/820 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:06] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 5 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/820 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/820 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 5/825 variables, 6/663 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/825 variables, 5/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/825 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 8/833 variables, 4/672 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/833 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (OVERLAPS) 59/892 variables, 37/709 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/892 variables, 10/719 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:07] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:00:07] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/892 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/892 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 3/895 variables, 4/725 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/895 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/895 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (OVERLAPS) 4/899 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/899 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 53 (OVERLAPS) 40/939 variables, 25/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/939 variables, 8/763 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/939 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 56 (OVERLAPS) 2/941 variables, 2/765 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/941 variables, 2/767 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:00:07] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/941 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/941 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 60 (OVERLAPS) 4/945 variables, 2/770 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/945 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 62 (OVERLAPS) 12/957 variables, 10/780 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/957 variables, 3/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/957 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 65 (OVERLAPS) 3/960 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/960 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/960 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 68 (OVERLAPS) 0/960 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 960/960 variables, and 786 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 521/521 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 5900ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 316 ms.
Support contains 13 out of 521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 521/521 places, 439/439 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 521 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 520 transition count 438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 519 transition count 437
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 519 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 518 transition count 436
Applied a total of 6 rules in 54 ms. Remains 518 /521 variables (removed 3) and now considering 436/439 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 518/521 places, 436/439 transitions.
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 155983 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :2 out of 6
Probabilistic random walk after 155983 steps, saw 123955 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :2
// Phase 1: matrix 436 rows 518 cols
[2024-06-01 16:00:12] [INFO ] Computed 220 invariants in 2 ms
[2024-06-01 16:00:12] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 16:00:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 109/206 variables, 97/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 16/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 135/341 variables, 75/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 29/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/346 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 5/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/346 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 10/356 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/356 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 124/480 variables, 66/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 18/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 8/488 variables, 9/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/488 variables, 8/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/488 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 11/499 variables, 6/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/499 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/499 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 146/645 variables, 84/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/645 variables, 25/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/645 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/645 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 9/654 variables, 10/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/654 variables, 9/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/654 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 14/668 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/668 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 116/784 variables, 67/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/784 variables, 18/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/784 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 6/790 variables, 7/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/790 variables, 6/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/790 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 8/798 variables, 4/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/798 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 99/897 variables, 62/682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/897 variables, 15/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/897 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/897 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 6/903 variables, 11/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/903 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/903 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 15/918 variables, 7/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/918 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 30/948 variables, 30/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/948 variables, 6/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/948 variables, 4/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/948 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 6/954 variables, 4/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/954 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/954 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 0/954 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 954/954 variables, and 766 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 518/518 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:13] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 109/206 variables, 97/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 16/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 135/341 variables, 75/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 29/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:13] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:00:13] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/341 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 5/346 variables, 5/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 10/356 variables, 5/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/356 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 124/480 variables, 66/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/480 variables, 18/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/480 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/480 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/480 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 8/488 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/488 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/488 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 11/499 variables, 6/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/499 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/499 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 146/645 variables, 84/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/645 variables, 25/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/645 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/645 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 9/654 variables, 10/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/654 variables, 9/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/654 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 14/668 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/668 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 116/784 variables, 67/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/784 variables, 18/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/784 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 6/790 variables, 7/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/790 variables, 6/626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/790 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 8/798 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/798 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 99/897 variables, 62/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/897 variables, 15/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/897 variables, 1/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:14] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/897 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/897 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 6/903 variables, 11/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/903 variables, 4/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/903 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 15/918 variables, 7/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/918 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 30/948 variables, 30/761 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/948 variables, 6/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/948 variables, 4/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/948 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 6/954 variables, 4/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/954 variables, 2/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/954 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 0/954 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 954/954 variables, and 777 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 518/518 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3038ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 358 ms.
Support contains 9 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 436/436 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 514 transition count 432
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 513 transition count 431
Applied a total of 9 rules in 32 ms. Remains 513 /518 variables (removed 5) and now considering 431/436 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 513/518 places, 431/436 transitions.
RANDOM walk for 40000 steps (8 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 187414 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 4
Probabilistic random walk after 187414 steps, saw 149651 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 431 rows 513 cols
[2024-06-01 16:00:19] [INFO ] Computed 220 invariants in 5 ms
[2024-06-01 16:00:19] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 135/341 variables, 75/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 29/253 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/346 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/356 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 122/478 variables, 66/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 19/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 7/485 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/485 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/485 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 11/496 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/496 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 146/642 variables, 84/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/642 variables, 26/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/642 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/642 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 8/650 variables, 9/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/650 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/650 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 14/664 variables, 7/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/664 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 115/779 variables, 67/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/779 variables, 19/600 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/779 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 5/784 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/784 variables, 5/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/784 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 8/792 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/792 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 98/890 variables, 62/677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/890 variables, 20/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/890 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 4/894 variables, 6/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/894 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/894 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 4/898 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/898 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 30/928 variables, 21/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/928 variables, 7/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/928 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 1/929 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/929 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/929 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 2/931 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/931 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 13/944 variables, 10/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/944 variables, 4/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/944 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 0/944 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 944/944 variables, and 754 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 513/513 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 109/206 variables, 97/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 16/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 135/341 variables, 75/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 29/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 16:00:20] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 5/346 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 10/356 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 122/478 variables, 66/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/478 variables, 19/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/478 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:21] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/478 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/478 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 7/485 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/485 variables, 7/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/485 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 11/496 variables, 6/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/496 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:21] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/496 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/496 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 146/642 variables, 84/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/642 variables, 26/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/642 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:21] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/642 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/642 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 8/650 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/650 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/650 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 14/664 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/664 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 115/779 variables, 67/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/779 variables, 19/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/779 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 5/784 variables, 6/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/784 variables, 5/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/784 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 8/792 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:21] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 4 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/792 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/792 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 98/890 variables, 62/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/890 variables, 20/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/890 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 4/894 variables, 6/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/894 variables, 4/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/894 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 4/898 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/898 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 30/928 variables, 21/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/928 variables, 7/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/928 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 1/929 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/929 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/929 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 2/931 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/931 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 13/944 variables, 10/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/944 variables, 4/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/944 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 0/944 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 944/944 variables, and 768 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 513/513 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 3365ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 9 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 22 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 513/513 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-01 16:00:22] [INFO ] Invariant cache hit.
[2024-06-01 16:00:23] [INFO ] Implicit Places using invariants in 281 ms returned [496, 500]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/513 places, 431/431 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 509 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 509 transition count 429
Applied a total of 4 rules in 20 ms. Remains 509 /511 variables (removed 2) and now considering 429/431 (removed 2) transitions.
// Phase 1: matrix 429 rows 509 cols
[2024-06-01 16:00:23] [INFO ] Computed 218 invariants in 1 ms
[2024-06-01 16:00:23] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 16:00:23] [INFO ] Invariant cache hit.
[2024-06-01 16:00:23] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 16:00:24] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 509/513 places, 429/431 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1157 ms. Remains : 509/513 places, 429/431 transitions.
RANDOM walk for 40000 steps (8 resets) in 357 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 175013 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 4
Probabilistic random walk after 175013 steps, saw 139201 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 16:00:27] [INFO ] Invariant cache hit.
[2024-06-01 16:00:27] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 108/205 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 133/338 variables, 73/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 28/249 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 5/343 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/353 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 121/474 variables, 66/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 6/480 variables, 7/360 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/480 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 10/490 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/490 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 146/636 variables, 84/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/636 variables, 26/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/636 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/636 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 8/644 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/644 variables, 8/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/644 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 14/658 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/658 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 115/773 variables, 67/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/773 variables, 19/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/773 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 5/778 variables, 6/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/778 variables, 5/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 8/786 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/786 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 98/884 variables, 62/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/884 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/884 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 4/888 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/888 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/888 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 4/892 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/892 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 30/922 variables, 21/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/922 variables, 7/729 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/922 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 1/923 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/923 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/923 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 2/925 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/925 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 13/938 variables, 10/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/938 variables, 4/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/938 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 0/938 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 746 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 108/205 variables, 97/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 133/338 variables, 73/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 28/251 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 5/343 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/343 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/353 variables, 5/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/353 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/353 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 121/474 variables, 66/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/474 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:00:28] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/474 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/474 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 6/480 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/480 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:29] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/480 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/480 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 10/490 variables, 5/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:00:29] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/490 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/490 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 146/636 variables, 84/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/636 variables, 26/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/636 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/636 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 8/644 variables, 9/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/644 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/644 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 14/658 variables, 7/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/658 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 115/773 variables, 67/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/773 variables, 19/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/773 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 5/778 variables, 6/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/778 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/778 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 8/786 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/786 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 98/884 variables, 62/679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/884 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/884 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 4/888 variables, 6/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/888 variables, 4/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/888 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 4/892 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/892 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 30/922 variables, 21/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/922 variables, 7/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/922 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 1/923 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/923 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/923 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 2/925 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/925 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 13/938 variables, 10/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/938 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/938 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 0/938 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 756 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 2855ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 657 ms.
Support contains 9 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 429/429 transitions.
Applied a total of 0 rules in 10 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 509/509 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 429/429 transitions.
Applied a total of 0 rules in 9 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-01 16:00:30] [INFO ] Invariant cache hit.
[2024-06-01 16:00:31] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-01 16:00:31] [INFO ] Invariant cache hit.
[2024-06-01 16:00:31] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 16:00:31] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-06-01 16:00:31] [INFO ] Redundant transitions in 24 ms returned []
Running 421 sub problems to find dead transitions.
[2024-06-01 16:00:31] [INFO ] Invariant cache hit.
[2024-06-01 16:00:31] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 16:00:35] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 16:00:36] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-06-01 16:00:36] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:00:36] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:00:36] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:00:36] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:00:36] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:00:36] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:00:37] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:00:37] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 3 ms to minimize.
[2024-06-01 16:00:37] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:00:37] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:00:37] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 16:00:37] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:00:38] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 16:00:39] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 6/509 variables, 33/258 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 16:00:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 16:00:48] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 16:00:49] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 16:00:49] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 10/268 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:00:50] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:00:51] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (OVERLAPS) 429/938 variables, 509/780 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/938 variables, 19/799 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 938/938 variables, and 799 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 44/229 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:01:02] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:01:06] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 6/509 variables, 33/267 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:01:12] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 16:01:13] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 7/283 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-01 16:01:16] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 10 (OVERLAPS) 429/938 variables, 509/793 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 19/812 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/938 variables, 421/1233 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 938/938 variables, and 1233 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 66/66 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60927 ms. Remains : 509/509 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 509 transition count 429
Applied a total of 117 rules in 20 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 429 rows 509 cols
[2024-06-01 16:01:31] [INFO ] Computed 218 invariants in 1 ms
[2024-06-01 16:01:31] [INFO ] [Real]Absence check using 218 positive place invariants in 26 ms returned sat
[2024-06-01 16:01:31] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 16:01:32] [INFO ] [Nat]Absence check using 218 positive place invariants in 29 ms returned sat
[2024-06-01 16:01:32] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 16:01:32] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 16:01:32] [INFO ] After 150ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 5 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:01:32] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 805 ms
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:01:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
TRAPS : Iteration 1
[2024-06-01 16:01:33] [INFO ] After 1436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 16:01:33] [INFO ] After 1847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2027 ms.
[2024-06-01 16:01:33] [INFO ] Flatten gal took : 42 ms
[2024-06-01 16:01:33] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:01:33] [INFO ] Input system was already deterministic with 1217 transitions.
Computed a total of 324 stabilizing places and 324 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1356 transition count 933
Reduce places removed 283 places and 0 transitions.
Iterating post reduction 1 with 283 rules applied. Total rules applied 566 place count 1073 transition count 933
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 566 place count 1073 transition count 779
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 874 place count 919 transition count 779
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 886 place count 907 transition count 767
Iterating global reduction 2 with 12 rules applied. Total rules applied 898 place count 907 transition count 767
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 898 place count 907 transition count 758
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 916 place count 898 transition count 758
Performed 315 Post agglomeration using F-continuation condition.Transition count delta: 315
Deduced a syphon composed of 315 places in 0 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1546 place count 583 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1547 place count 583 transition count 442
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1549 place count 582 transition count 441
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1551 place count 580 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1552 place count 579 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1552 place count 579 transition count 437
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1556 place count 577 transition count 437
Applied a total of 1556 rules in 172 ms. Remains 577 /1357 variables (removed 780) and now considering 437/1217 (removed 780) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 172 ms. Remains : 577/1357 places, 437/1217 transitions.
[2024-06-01 16:01:34] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:01:34] [INFO ] Flatten gal took : 18 ms
[2024-06-01 16:01:34] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 156 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-06-01 16:01:34] [INFO ] Flatten gal took : 33 ms
[2024-06-01 16:01:34] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:01:34] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 157 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-06-01 16:01:34] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:01:34] [INFO ] Flatten gal took : 29 ms
[2024-06-01 16:01:34] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1346 transition count 1206
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1344 transition count 1204
Applied a total of 26 rules in 160 ms. Remains 1344 /1357 variables (removed 13) and now considering 1204/1217 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 1344/1357 places, 1204/1217 transitions.
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:01:35] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 160 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:01:35] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 159 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:01:35] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1344 transition count 1204
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1344 transition count 1204
Applied a total of 26 rules in 101 ms. Remains 1344 /1357 variables (removed 13) and now considering 1204/1217 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 1344/1357 places, 1204/1217 transitions.
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:01:35] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:01:35] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1347 transition count 1207
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1345 transition count 1205
Applied a total of 24 rules in 156 ms. Remains 1345 /1357 variables (removed 12) and now considering 1205/1217 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 1345/1357 places, 1205/1217 transitions.
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:01:36] [INFO ] Input system was already deterministic with 1205 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1356 transition count 941
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1081 transition count 938
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1078 transition count 938
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 556 place count 1078 transition count 785
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 862 place count 925 transition count 785
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 873 place count 914 transition count 774
Iterating global reduction 3 with 11 rules applied. Total rules applied 884 place count 914 transition count 774
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 884 place count 914 transition count 765
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 902 place count 905 transition count 765
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 0 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 632 rules applied. Total rules applied 1534 place count 589 transition count 449
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1536 place count 587 transition count 447
Applied a total of 1536 rules in 115 ms. Remains 587 /1357 variables (removed 770) and now considering 447/1217 (removed 770) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115 ms. Remains : 587/1357 places, 447/1217 transitions.
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 10 ms
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 10 ms
[2024-06-01 16:01:36] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1356 transition count 936
Reduce places removed 280 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 281 rules applied. Total rules applied 561 place count 1076 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 1075 transition count 935
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 562 place count 1075 transition count 780
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 872 place count 920 transition count 780
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 882 place count 910 transition count 770
Iterating global reduction 3 with 10 rules applied. Total rules applied 892 place count 910 transition count 770
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 892 place count 910 transition count 763
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 906 place count 903 transition count 763
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1526 place count 593 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1527 place count 593 transition count 452
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1529 place count 592 transition count 451
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1531 place count 590 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1532 place count 589 transition count 449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1532 place count 589 transition count 447
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1536 place count 587 transition count 447
Applied a total of 1536 rules in 132 ms. Remains 587 /1357 variables (removed 770) and now considering 447/1217 (removed 770) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 132 ms. Remains : 587/1357 places, 447/1217 transitions.
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 11 ms
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 11 ms
[2024-06-01 16:01:36] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1357 transition count 936
Reduce places removed 281 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 282 rules applied. Total rules applied 563 place count 1076 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 564 place count 1075 transition count 935
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 564 place count 1075 transition count 784
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 866 place count 924 transition count 784
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 877 place count 913 transition count 773
Iterating global reduction 3 with 11 rules applied. Total rules applied 888 place count 913 transition count 773
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 888 place count 913 transition count 764
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 906 place count 904 transition count 764
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 1542 place count 586 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1543 place count 586 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1545 place count 585 transition count 444
Applied a total of 1545 rules in 107 ms. Remains 585 /1357 variables (removed 772) and now considering 444/1217 (removed 773) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 107 ms. Remains : 585/1357 places, 444/1217 transitions.
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:01:36] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1345 transition count 1205
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1343 transition count 1203
Applied a total of 28 rules in 158 ms. Remains 1343 /1357 variables (removed 14) and now considering 1203/1217 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 1343/1357 places, 1203/1217 transitions.
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 27 ms
[2024-06-01 16:01:36] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:01:36] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1356 transition count 933
Reduce places removed 283 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 284 rules applied. Total rules applied 567 place count 1073 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 568 place count 1072 transition count 932
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 568 place count 1072 transition count 779
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 874 place count 919 transition count 779
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 885 place count 908 transition count 768
Iterating global reduction 3 with 11 rules applied. Total rules applied 896 place count 908 transition count 768
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 896 place count 908 transition count 760
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 912 place count 900 transition count 760
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 0 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1534 place count 589 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1535 place count 589 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1537 place count 588 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1539 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1540 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1540 place count 585 transition count 443
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1544 place count 583 transition count 443
Applied a total of 1544 rules in 113 ms. Remains 583 /1357 variables (removed 774) and now considering 443/1217 (removed 774) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 113 ms. Remains : 583/1357 places, 443/1217 transitions.
[2024-06-01 16:01:37] [INFO ] Flatten gal took : 10 ms
[2024-06-01 16:01:37] [INFO ] Flatten gal took : 11 ms
[2024-06-01 16:01:37] [INFO ] Input system was already deterministic with 443 transitions.
[2024-06-01 16:01:37] [INFO ] Flatten gal took : 25 ms
[2024-06-01 16:01:37] [INFO ] Flatten gal took : 23 ms
[2024-06-01 16:01:37] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:01:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1357 places, 1217 transitions and 3154 arcs took 5 ms.
Total runtime 135961 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-01
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-05
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-07
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-08
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2023-14
Could not compute solution for formula : ShieldPPPt-PT-020B-CTLCardinality-2023-15

BK_STOP 1717257697534

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1007/ctl_0_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1007/ctl_1_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1007/ctl_2_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1007/ctl_3_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1007/ctl_4_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1007/ctl_5_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1007/ctl_6_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1007/ctl_7_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1007/ctl_8_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1007/ctl_9_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1007/ctl_10_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1007/ctl_11_
ctl formula name ShieldPPPt-PT-020B-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1007/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-020B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-020B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761500633"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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