About the Execution of ITS-Tools for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 531.688 | 84712.00 | 197263.00 | 55.50 | TFFTTFTFFFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399800574.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800574
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716336852249
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 00:14:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:14:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:14:13] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-22 00:14:13] [INFO ] Transformed 638 places.
[2024-05-22 00:14:13] [INFO ] Transformed 578 transitions.
[2024-05-22 00:14:13] [INFO ] Found NUPN structural information;
[2024-05-22 00:14:13] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:14:14] [INFO ] Flatten gal took : 138 ms
[2024-05-22 00:14:14] [INFO ] Flatten gal took : 44 ms
RANDOM walk for 40000 steps (262 resets) in 1982 ms. (20 steps per ms) remains 8/12 properties
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:14:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12283180851435373013.gal : 25 ms
[2024-05-22 00:14:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15118970214996182020.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12283180851435373013.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15118970214996182020.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (45 resets) in 404 ms. (98 steps per ms) remains 8/8 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15118970214996182020.prop.
BEST_FIRST walk for 40004 steps (46 resets) in 437 ms. (91 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 29
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :29 after 141
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :141 after 279
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :279 after 2.73815e+14
BEST_FIRST walk for 40003 steps (47 resets) in 624 ms. (64 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (49 resets) in 290 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (39 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (43 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (47 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (46 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
// Phase 1: matrix 570 rows 630 cols
[2024-05-22 00:14:15] [INFO ] Computed 100 invariants in 47 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 345/539 variables, 62/256 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 345/601 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 1/602 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 91/630 variables, 37/639 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 91/730 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/630 variables, 0/730 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 570/1200 variables, 630/1360 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1200 variables, 0/1360 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 1360 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1749 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 630/630 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 414/526 variables, 62/174 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 414/588 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 40 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 130 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 115 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 140 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/608 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 6 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 129 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 117 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 4 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 9 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 6 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 7037ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 112 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 624 transition count 511
Reduce places removed 58 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 72 rules applied. Total rules applied 131 place count 566 transition count 497
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 145 place count 552 transition count 497
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 145 place count 552 transition count 400
Deduced a syphon composed of 97 places in 2 ms
Ensure Unique test removed 5 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 344 place count 450 transition count 400
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 412 place count 382 transition count 332
Iterating global reduction 3 with 68 rules applied. Total rules applied 480 place count 382 transition count 332
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 480 place count 382 transition count 329
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 487 place count 378 transition count 329
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 599 place count 321 transition count 274
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 600 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 320 transition count 273
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 603 place count 320 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 319 transition count 272
Applied a total of 604 rules in 169 ms. Remains 319 /630 variables (removed 311) and now considering 272/570 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 319/630 places, 272/570 transitions.
RANDOM walk for 40000 steps (712 resets) in 1071 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (161 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (172 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (177 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (147 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (160 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 626130 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :1 out of 5
Probabilistic random walk after 626130 steps, saw 104440 distinct states, run finished after 3007 ms. (steps per millisecond=208 ) properties seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 272 rows 319 cols
[2024-05-22 00:14:26] [INFO ] Computed 87 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 151/262 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 54/316 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 272/588 variables, 316/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/588 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/591 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/591 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 406 constraints, problems are : Problem set: 0 solved, 4 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 319/319 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/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 151/262 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 3 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 54/316 variables, 31/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 272/588 variables, 316/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:36] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:14:36] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:36] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:14:36] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 14 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 20/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/588 variables, 20/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:49] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:14:49] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:14:49] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:14:49] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:14:49] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 5 ms to minimize.
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 20/597 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 4 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 20/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 4 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 7 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/588 variables, 20/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 4 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 2 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 20/657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 5 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 70 places in 243 ms of which 5 ms to minimize.
SMT process timed out in 45679ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2219 ms.
Support contains 111 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 272/272 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 318 transition count 271
Applied a total of 2 rules in 23 ms. Remains 318 /319 variables (removed 1) and now considering 271/272 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 318/319 places, 271/272 transitions.
RANDOM walk for 40000 steps (717 resets) in 688 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (166 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (142 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (159 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 606190 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 4
Probabilistic random walk after 606190 steps, saw 99613 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
// Phase 1: matrix 271 rows 318 cols
[2024-05-22 00:15:17] [INFO ] Computed 87 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 151/262 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 53/315 variables, 31/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 271/586 variables, 315/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/589 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/589 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 405 constraints, problems are : Problem set: 0 solved, 4 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 318/318 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/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 151/262 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 66 places in 4197 ms of which 27 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 1 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 53/315 variables, 31/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 6 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 4 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 6 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 4 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 5 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 4 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 3 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 64 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 9/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 271/586 variables, 315/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/586 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 3/589 variables, 3/509 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/589 variables, 0/509 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/589 variables, 1/510 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/589 variables, 0/510 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/589 variables, 0/510 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/589 variables, and 510 constraints, problems are : Problem set: 2 solved, 2 unsolved in 18302 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 102/102 constraints]
After SMT, in 18775ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 617 steps, including 12 resets, run visited all 1 properties in 12 ms. (steps per millisecond=51 )
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 145 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 83265 ms.
BK_STOP 1716336936961
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-16, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;