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.r530-tall-171683779800638.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 ShieldRVt-PT-040B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683779800638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 489K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717228388107

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:53:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 07:53:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:53:09] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-01 07:53:09] [INFO ] Transformed 2003 places.
[2024-06-01 07:53:09] [INFO ] Transformed 2003 transitions.
[2024-06-01 07:53:09] [INFO ] Found NUPN structural information;
[2024-06-01 07:53:09] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 288 ms.
Structural test allowed to assert that 801 places are NOT stable. Took 22 ms.
RANDOM walk for 40000 steps (8 resets) in 3431 ms. (11 steps per ms) remains 821/1202 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 821/821 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 821/821 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 821/821 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 821/821 properties
// Phase 1: matrix 2003 rows 2003 cols
[2024-06-01 07:53:10] [INFO ] Computed 161 invariants in 31 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/821 variables, 821/821 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/4006 variables, and 821 constraints, problems are : Problem set: 0 solved, 821 unsolved in 5124 ms.
Refiners :[Domain max(s): 821/2003 constraints, Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/2003 constraints, PredecessorRefiner: 821/821 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 821 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/821 variables, 821/821 constraints. Problems are: Problem set: 0 solved, 821 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/4006 variables, and 821 constraints, problems are : Problem set: 0 solved, 821 unsolved in 5021 ms.
Refiners :[Domain max(s): 821/2003 constraints, Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/2003 constraints, PredecessorRefiner: 0/821 constraints, Known Traps: 0/0 constraints]
After SMT, in 10468ms problems are : Problem set: 0 solved, 821 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 821 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 425 rules applied. Total rules applied 425 place count 2003 transition count 1578
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 427 rules applied. Total rules applied 852 place count 1578 transition count 1576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 853 place count 1577 transition count 1576
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 853 place count 1577 transition count 1521
Deduced a syphon composed of 55 places in 5 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 963 place count 1522 transition count 1521
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 1041 place count 1444 transition count 1443
Iterating global reduction 3 with 78 rules applied. Total rules applied 1119 place count 1444 transition count 1443
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1119 place count 1444 transition count 1414
Deduced a syphon composed of 29 places in 11 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1177 place count 1415 transition count 1414
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 3 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 1859 place count 1074 transition count 1073
Renaming transitions due to excessive name length > 1024 char.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1931 place count 1038 transition count 1103
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1932 place count 1038 transition count 1102
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1933 place count 1038 transition count 1101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1934 place count 1037 transition count 1101
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1937 place count 1037 transition count 1101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1938 place count 1037 transition count 1100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1939 place count 1036 transition count 1099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1940 place count 1035 transition count 1099
Applied a total of 1940 rules in 511 ms. Remains 1035 /2003 variables (removed 968) and now considering 1099/2003 (removed 904) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 521 ms. Remains : 1035/2003 places, 1099/2003 transitions.
RANDOM walk for 3878582 steps (964 resets) in 117389 ms. (33 steps per ms) remains 344/821 properties
BEST_FIRST walk for 40004 steps (9 resets) in 204 ms. (195 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (10 resets) in 182 ms. (218 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (9 resets) in 176 ms. (226 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (9 resets) in 174 ms. (228 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (9 resets) in 177 ms. (224 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (9 resets) in 178 ms. (223 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (10 resets) in 185 ms. (215 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (10 resets) in 177 ms. (224 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40002 steps (8 resets) in 175 ms. (227 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (9 resets) in 176 ms. (226 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40002 steps (9 resets) in 174 ms. (228 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (10 resets) in 177 ms. (224 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (9 resets) in 179 ms. (222 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40001 steps (8 resets) in 183 ms. (217 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (9 resets) in 175 ms. (227 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40002 steps (9 resets) in 185 ms. (215 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (9 resets) in 179 ms. (222 steps per ms) remains 344/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 344/344 properties
// Phase 1: matrix 1099 rows 1035 cols
[2024-06-01 07:53:54] [INFO ] Computed 160 invariants in 4 ms
[2024-06-01 07:53:54] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (OVERLAPS) 78/422 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 425/847 variables, 422/472 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (OVERLAPS) 42/889 variables, 19/491 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (OVERLAPS) 31/920 variables, 6/497 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/920 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (OVERLAPS) 33/953 variables, 35/532 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/2134 variables, and 532 constraints, problems are : Problem set: 0 solved, 344 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/160 constraints, State Equation: 476/1035 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (OVERLAPS) 78/422 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:54:41] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 29 ms to minimize.
[2024-06-01 07:54:41] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:54:41] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 16 ms to minimize.
[2024-06-01 07:54:42] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:54:46] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:54:46] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:54:46] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:54:46] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 4 ms to minimize.
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:54:47] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:54:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-01 07:54:49] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:54:49] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:54:50] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:54:50] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:54:50] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 5 ms to minimize.
[2024-06-01 07:54:50] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:54:50] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:54:50] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:54:51] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:54:51] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:54:52] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:54:52] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:54:52] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:54:52] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:54:52] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:54:53] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:54:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:54:53] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:54:53] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 3 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:54:54] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:54:55] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:54:56] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:54:56] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:54:56] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:54:56] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:54:56] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:54:56] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:54:57] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:54:57] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:54:57] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:54:57] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:54:57] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:54:57] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:54:57] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 4 ms to minimize.
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:54:58] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:01] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:55:02] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:03] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:55:04] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:55:05] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:06] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:55:07] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:11] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:55:13] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:55:13] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:55:14] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:55:15] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 17/267 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 3 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 20/291 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/2134 variables, and 294 constraints, problems are : Problem set: 0 solved, 344 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 50/160 constraints, State Equation: 0/1035 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/344 constraints, Known Traps: 244/244 constraints]
After SMT, in 90091ms problems are : Problem set: 0 solved, 344 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 344 out of 1035 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1035/1035 places, 1099/1099 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 1035 transition count 974
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 250 place count 910 transition count 974
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 250 place count 910 transition count 912
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 374 place count 848 transition count 912
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 416 place count 806 transition count 870
Iterating global reduction 2 with 42 rules applied. Total rules applied 458 place count 806 transition count 870
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 458 place count 806 transition count 828
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 542 place count 764 transition count 828
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 732 place count 669 transition count 733
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 824 place count 623 transition count 780
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 828 place count 623 transition count 776
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 832 place count 619 transition count 776
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 834 place count 619 transition count 774
Applied a total of 834 rules in 120 ms. Remains 619 /1035 variables (removed 416) and now considering 774/1099 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 619/1035 places, 774/1099 transitions.
RANDOM walk for 4000000 steps (1037 resets) in 101414 ms. (39 steps per ms) remains 238/344 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 240 ms. (165 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 235 ms. (169 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 216 ms. (184 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 247 ms. (161 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40002 steps (9 resets) in 219 ms. (181 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 221 ms. (180 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 209 ms. (190 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (9 resets) in 233 ms. (170 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (9 resets) in 218 ms. (182 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (10 resets) in 229 ms. (173 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40002 steps (8 resets) in 274 ms. (145 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 237 ms. (168 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 201 ms. (198 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (9 resets) in 238 ms. (167 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40002 steps (8 resets) in 214 ms. (186 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 255 ms. (156 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (9 resets) in 248 ms. (160 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (9 resets) in 229 ms. (173 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 238/238 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 238/238 properties
// Phase 1: matrix 774 rows 619 cols
[2024-06-01 07:55:57] [INFO ] Computed 160 invariants in 4 ms
[2024-06-01 07:55:57] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 103/341 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 343/684 variables, 341/382 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/684 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 34/718 variables, 16/398 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 20/738 variables, 4/402 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/738 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (OVERLAPS) 20/758 variables, 22/424 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/758 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (OVERLAPS) 3/761 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/761 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 13 (OVERLAPS) 14/775 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/775 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 15 (OVERLAPS) 6/781 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/781 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 17 (OVERLAPS) 11/792 variables, 10/444 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/792 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/792 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 20 (OVERLAPS) 27/819 variables, 10/456 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/819 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/819 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 23 (OVERLAPS) 1/820 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/820 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/820 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 26 (OVERLAPS) 22/842 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/842 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/842 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 29 (OVERLAPS) 22/864 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/864 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 864/1393 variables, and 485 constraints, problems are : Problem set: 0 solved, 238 unsolved in 75015 ms.
Refiners :[Positive P Invariants (semi-flows): 62/160 constraints, State Equation: 423/619 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 103/341 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:13] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:57:13] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:57:13] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:57:14] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:57:15] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:57:16] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:57:17] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:18] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:57:18] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:57:19] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:57:20] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:57:20] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:57:20] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:57:20] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:57:20] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:57:21] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:57:21] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:57:21] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:57:21] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:57:21] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:57:21] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:57:22] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:57:22] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:57:22] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:57:22] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:23] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:57:23] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:57:23] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:57:23] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:57:23] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:57:24] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:57:24] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:57:24] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:57:25] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:57:25] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:57:26] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:57:26] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:57:26] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:57:26] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:57:27] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:57:27] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 9/129 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:28] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:57:28] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 10 (OVERLAPS) 343/684 variables, 341/472 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 238/710 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:57:40] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:57:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:57:41] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:57:42] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:57:42] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:57:42] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:57:42] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:57:42] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:57:43] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:57:45] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:57:46] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:57:46] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:57:46] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:57:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:57:48] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:57:48] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:57:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 17/727 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-01 07:58:07] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/684 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 15 (OVERLAPS) 34/718 variables, 16/744 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/1393 variables, and 744 constraints, problems are : Problem set: 0 solved, 238 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/160 constraints, State Equation: 357/619 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 108/108 constraints]
After SMT, in 150070ms problems are : Problem set: 0 solved, 238 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 238 out of 619 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 619/619 places, 774/774 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 619 transition count 748
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 593 transition count 748
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 52 place count 593 transition count 732
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 84 place count 577 transition count 732
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 573 transition count 728
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 573 transition count 728
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 92 place count 573 transition count 724
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 569 transition count 724
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 152 place count 543 transition count 698
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 168 place count 535 transition count 703
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 174 place count 535 transition count 697
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 180 place count 529 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 529 transition count 695
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 529 transition count 695
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 529 transition count 693
Applied a total of 186 rules in 99 ms. Remains 529 /619 variables (removed 90) and now considering 693/774 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 529/619 places, 693/774 transitions.
RANDOM walk for 4000000 steps (1119 resets) in 83348 ms. (47 steps per ms) remains 161/238 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 211 ms. (188 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 255 ms. (156 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (10 resets) in 260 ms. (153 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 246 ms. (161 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 252 ms. (158 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 269 ms. (148 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (11 resets) in 249 ms. (160 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (9 resets) in 204 ms. (195 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 201 ms. (198 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 284 ms. (140 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 231 ms. (172 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (10 resets) in 240 ms. (165 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 295 ms. (135 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (10 resets) in 275 ms. (144 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (9 resets) in 259 ms. (153 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 286 ms. (139 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 208 ms. (191 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 161/161 properties
// Phase 1: matrix 693 rows 529 cols
[2024-06-01 07:58:56] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 07:58:56] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 79/240 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 249/489 variables, 240/270 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 82/571 variables, 37/307 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 17/588 variables, 10/320 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 7/327 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 31/619 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/619 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/619 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 14 (OVERLAPS) 1/620 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/620 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/620 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 17 (OVERLAPS) 20/640 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/640 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/640 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 20 (OVERLAPS) 21/661 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/661 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/661 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 23 (OVERLAPS) 22/683 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/683 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/683 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 26 (OVERLAPS) 22/705 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/705 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/705 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 29 (OVERLAPS) 22/727 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/727 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/727 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 32 (OVERLAPS) 22/749 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/749 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/749 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 35 (OVERLAPS) 22/771 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/771 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/771 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 38 (OVERLAPS) 22/793 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/793 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/793 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 41 (OVERLAPS) 22/815 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/815 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/815 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 44 (OVERLAPS) 22/837 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/837 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/837 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 47 (OVERLAPS) 22/859 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/859 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/859 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 50 (OVERLAPS) 22/881 variables, 8/493 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/881 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/881 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 53 (OVERLAPS) 20/901 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/901 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/901 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 56 (OVERLAPS) 21/922 variables, 8/517 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/922 variables, 4/521 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/922 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 59 (OVERLAPS) 21/943 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/943 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/943 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 62 (OVERLAPS) 22/965 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/965 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/965 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/965 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 66 (OVERLAPS) 22/987 variables, 8/554 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/987 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/987 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/987 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 70 (OVERLAPS) 22/1009 variables, 8/567 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1009 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1009 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 73 (OVERLAPS) 22/1031 variables, 8/579 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1031 variables, 4/583 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1031 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 76 (OVERLAPS) 22/1053 variables, 8/591 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1053 variables, 4/595 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1053 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 79 (OVERLAPS) 22/1075 variables, 8/603 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1075 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1075 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 82 (OVERLAPS) 22/1097 variables, 8/615 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1097 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1097 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 85 (OVERLAPS) 22/1119 variables, 8/627 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1119 variables, 4/631 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1119 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 88 (OVERLAPS) 22/1141 variables, 8/639 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1141 variables, 4/643 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1141 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 161 unsolved
SMT process timed out in 90028ms, After SMT, problems are : Problem set: 0 solved, 161 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 693/693 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 529 transition count 674
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 510 transition count 674
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 38 place count 510 transition count 662
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 62 place count 498 transition count 662
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 496 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 496 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 66 place count 496 transition count 658
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 494 transition count 658
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 118 place count 470 transition count 634
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 467 transition count 637
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 467 transition count 632
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 134 place count 462 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 462 transition count 630
Applied a total of 136 rules in 63 ms. Remains 462 /529 variables (removed 67) and now considering 630/693 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 462/529 places, 630/693 transitions.
RANDOM walk for 3790657 steps (1054 resets) in 117105 ms. (32 steps per ms) remains 157/161 properties
BEST_FIRST walk for 40004 steps (9 resets) in 319 ms. (125 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (9 resets) in 349 ms. (114 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (10 resets) in 304 ms. (131 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (9 resets) in 262 ms. (152 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (9 resets) in 298 ms. (133 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (8 resets) in 257 ms. (155 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (9 resets) in 231 ms. (172 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (8 resets) in 266 ms. (149 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (9 resets) in 195 ms. (204 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (9 resets) in 223 ms. (178 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (9 resets) in 267 ms. (149 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (9 resets) in 267 ms. (149 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (9 resets) in 311 ms. (128 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (9 resets) in 207 ms. (192 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (9 resets) in 253 ms. (157 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (9 resets) in 291 ms. (137 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 264 ms. (150 steps per ms) remains 157/157 properties
Interrupted probabilistic random walk after 3179276 steps, run timeout after 102001 ms. (steps per millisecond=31 ) properties seen :1 out of 157
Probabilistic random walk after 3179276 steps, saw 2357160 distinct states, run finished after 102005 ms. (steps per millisecond=31 ) properties seen :1
// Phase 1: matrix 630 rows 462 cols
[2024-06-01 08:02:43] [INFO ] Computed 160 invariants in 1 ms
[2024-06-01 08:02:43] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 37/193 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 197/390 variables, 193/220 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 20/410 variables, 10/230 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 1/411 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 17/428 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 14 (OVERLAPS) 22/450 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 17 (OVERLAPS) 2/452 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/452 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/452 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 20 (OVERLAPS) 19/471 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/471 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/471 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 23 (OVERLAPS) 19/490 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/490 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/490 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 26 (OVERLAPS) 20/510 variables, 8/294 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/510 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/510 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 29 (OVERLAPS) 21/531 variables, 8/306 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/531 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/531 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 32 (OVERLAPS) 22/553 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/553 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/553 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 35 (OVERLAPS) 22/575 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/575 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/575 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 38 (OVERLAPS) 22/597 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/597 variables, 4/346 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/597 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 41 (OVERLAPS) 22/619 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/619 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/619 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 44 (OVERLAPS) 22/641 variables, 8/366 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/641 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/641 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 47 (OVERLAPS) 22/663 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/663 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/663 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 50 (OVERLAPS) 22/685 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/685 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/685 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 53 (OVERLAPS) 22/707 variables, 8/402 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/707 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/707 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 56 (OVERLAPS) 22/729 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/729 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/729 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 59 (OVERLAPS) 22/751 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/751 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/751 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 62 (OVERLAPS) 20/771 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/771 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/771 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 65 (OVERLAPS) 21/792 variables, 8/450 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/792 variables, 4/454 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/792 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 68 (OVERLAPS) 21/813 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/813 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/813 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 71 (OVERLAPS) 22/835 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/835 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/835 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/835 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 75 (OVERLAPS) 22/857 variables, 8/487 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/857 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/857 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/857 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 79 (OVERLAPS) 22/879 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/879 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/879 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 82 (OVERLAPS) 22/901 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/901 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/901 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 85 (OVERLAPS) 22/923 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/923 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/923 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 88 (OVERLAPS) 22/945 variables, 8/536 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/945 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/945 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 91 (OVERLAPS) 22/967 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/967 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/967 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 94 (OVERLAPS) 22/989 variables, 8/560 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/989 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/989 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 97 (OVERLAPS) 22/1011 variables, 8/572 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1011 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1011 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 100 (OVERLAPS) 22/1033 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1033 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1033 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 103 (OVERLAPS) 22/1055 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1055 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1055 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 106 (OVERLAPS) 20/1075 variables, 8/608 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1075 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1075 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 109 (OVERLAPS) 14/1089 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1089 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1089 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 112 (OVERLAPS) 3/1092 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1092 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1092 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 115 (OVERLAPS) 0/1092 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 624 constraints, problems are : Problem set: 0 solved, 156 unsolved in 97785 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 462/462 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 37/193 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 2 ms to minimize.
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:04:21] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:04:22] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:23] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:04:24] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 197/390 variables, 193/270 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 156/426 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 08:04:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:04:28] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:04:28] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:04:28] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:04:29] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:04:29] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:04:29] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:04:29] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:04:29] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:04:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 10/436 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 08:04:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 08:04:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (OVERLAPS) 20/410 variables, 10/448 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (OVERLAPS) 1/411 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 18 (OVERLAPS) 17/428 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/428 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 21 (OVERLAPS) 22/450 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/450 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/450 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 24 (OVERLAPS) 2/452 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/452 variables, 2/480 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/452 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 27 (OVERLAPS) 19/471 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/471 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/471 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 30 (OVERLAPS) 19/490 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/490 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/490 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 33 (OVERLAPS) 20/510 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/510 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/510 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 36 (OVERLAPS) 21/531 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/531 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/531 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 39 (OVERLAPS) 22/553 variables, 8/536 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/553 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/553 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 42 (OVERLAPS) 22/575 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/575 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/575 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 45 (OVERLAPS) 22/597 variables, 8/560 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/597 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/597 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 48 (OVERLAPS) 22/619 variables, 8/572 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/619 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/1092 variables, and 576 constraints, problems are : Problem set: 0 solved, 156 unsolved in 105011 ms.
Refiners :[Positive P Invariants (semi-flows): 72/160 constraints, State Equation: 286/462 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 62/62 constraints]
After SMT, in 202817ms problems are : Problem set: 0 solved, 156 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 156 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 630/630 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 462 transition count 625
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 457 transition count 625
Applied a total of 10 rules in 12 ms. Remains 457 /462 variables (removed 5) and now considering 625/630 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 457/462 places, 625/630 transitions.
RANDOM walk for 4000000 steps (1078 resets) in 53210 ms. (75 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 215 ms. (185 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 248 ms. (160 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (9 resets) in 245 ms. (162 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 252 ms. (158 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 225 ms. (177 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 224 ms. (177 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (10 resets) in 256 ms. (155 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 182 ms. (218 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 316 ms. (126 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (9 resets) in 251 ms. (158 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 232 ms. (171 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 202 ms. (197 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (11 resets) in 203 ms. (196 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (10 resets) in 254 ms. (156 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 243 ms. (163 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 197 ms. (202 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (9 resets) in 186 ms. (213 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 291 ms. (137 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 210 ms. (189 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (9 resets) in 209 ms. (190 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (9 resets) in 232 ms. (171 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (9 resets) in 226 ms. (176 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 156/156 properties
Finished probabilistic random walk after 1862162 steps, run visited all 156 properties in 45810 ms. (steps per millisecond=40 )
Probabilistic random walk after 1862162 steps, saw 1229752 distinct states, run finished after 45815 ms. (steps per millisecond=40 ) properties seen :156
Able to resolve query StableMarking after proving 1203 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 840998 ms.
ITS solved all properties within timeout

BK_STOP 1717229230271

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-040B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldRVt-PT-040B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r530-tall-171683779800638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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