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.r488-tall-171631132900550.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 DoubleExponent-PT-004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717193964199

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:19:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:19:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:19:25] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-31 22:19:25] [INFO ] Transformed 216 places.
[2024-05-31 22:19:25] [INFO ] Transformed 198 transitions.
[2024-05-31 22:19:25] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1306 resets) in 2131 ms. (18 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (119 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (109 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (110 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (114 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (120 resets) in 78 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (117 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (121 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (117 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 202886 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :3 out of 16
Probabilistic random walk after 202886 steps, saw 101463 distinct states, run finished after 3009 ms. (steps per millisecond=67 ) properties seen :3
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 198 rows 216 cols
[2024-05-31 22:19:29] [INFO ] Computed 24 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-03 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-06 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 49/190 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-10 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-12 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 26/216 variables, 18/24 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/24 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 198/414 variables, 216/240 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/240 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/240 constraints. Problems are: Problem set: 6 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 240 constraints, problems are : Problem set: 6 solved, 7 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 86/171 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
[2024-05-31 22:19:30] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 12 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 108 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 117 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 5/9 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Problem DoubleExponent-PT-004-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 45/216 variables, 20/29 constraints. Problems are: Problem set: 7 solved, 6 unsolved
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:19:31] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:19:32] [INFO ] Deduced a trap composed of 48 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:19:32] [INFO ] Deduced a trap composed of 55 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:19:32] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:32] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 14/43 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/43 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 198/414 variables, 216/259 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 6/265 constraints. Problems are: Problem set: 7 solved, 6 unsolved
[2024-05-31 22:19:32] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:19:33] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 2/267 constraints. Problems are: Problem set: 7 solved, 6 unsolved
[2024-05-31 22:19:33] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 1/268 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 0/268 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/414 variables, 0/268 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 268 constraints, problems are : Problem set: 7 solved, 6 unsolved in 3541 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 6/13 constraints, Known Traps: 22/22 constraints]
After SMT, in 4593ms problems are : Problem set: 7 solved, 6 unsolved
Parikh walk visited 0 properties in 19774 ms.
Support contains 70 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Graph (complete) has 360 edges and 216 vertex of which 213 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output 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 6 place count 213 transition count 193
Reduce places removed 5 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 13 rules applied. Total rules applied 19 place count 208 transition count 185
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 27 place count 200 transition count 185
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 200 transition count 174
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 49 place count 189 transition count 174
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 69 place count 179 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 178 transition count 164
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 178 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 175 transition count 161
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 88 place count 175 transition count 150
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 99 place count 164 transition count 150
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 105 place count 164 transition count 150
Applied a total of 105 rules in 95 ms. Remains 164 /216 variables (removed 52) and now considering 150/198 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 164/216 places, 150/198 transitions.
RANDOM walk for 40000 steps (2249 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1705 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1753 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1715 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1744 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1729 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 321433 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :2 out of 6
Probabilistic random walk after 321433 steps, saw 160939 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :2
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-004-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 150 rows 164 cols
[2024-05-31 22:19:57] [INFO ] Computed 22 invariants in 4 ms
[2024-05-31 22:19:57] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/164 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 150/314 variables, 164/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 4 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 193 constraints, problems are : Problem set: 0 solved, 4 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/164 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:19:58] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 150/314 variables, 164/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 5 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/314 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 211 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 2605ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5912 ms.
Support contains 69 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 150/150 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 150
Applied a total of 1 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 164/164 places, 150/150 transitions.
RANDOM walk for 40000 steps (2209 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1751 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1764 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1748 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 381833 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 4
Probabilistic random walk after 381833 steps, saw 191175 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
// Phase 1: matrix 150 rows 164 cols
[2024-05-31 22:20:09] [INFO ] Computed 22 invariants in 3 ms
[2024-05-31 22:20:09] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/164 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 150/314 variables, 164/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/314 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 190 constraints, problems are : Problem set: 0 solved, 4 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/164 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 42 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:20:10] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 150/314 variables, 164/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:11] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 8 ms to minimize.
[2024-05-31 22:20:11] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:11] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:20:11] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:11] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:20:11] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:20:11] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 7/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:12] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/314 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 219 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 25/25 constraints]
After SMT, in 3107ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3376 ms.
Support contains 69 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 150/150 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/164 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 150/150 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-31 22:20:16] [INFO ] Invariant cache hit.
[2024-05-31 22:20:16] [INFO ] Implicit Places using invariants in 83 ms returned [45, 71, 81, 89, 109, 117, 152]
[2024-05-31 22:20:16] [INFO ] Actually due to overlaps returned [109, 117, 45]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 90 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/164 places, 150/150 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 101 ms. Remains : 161/164 places, 150/150 transitions.
RANDOM walk for 40000 steps (2228 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1752 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1735 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1752 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 370676 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 4
Probabilistic random walk after 370676 steps, saw 185597 distinct states, run finished after 3003 ms. (steps per millisecond=123 ) properties seen :0
// Phase 1: matrix 150 rows 161 cols
[2024-05-31 22:20:19] [INFO ] Computed 19 invariants in 2 ms
[2024-05-31 22:20:19] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/161 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 150/311 variables, 161/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 161/161 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:20:19] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:20:19] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 14/161 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 150/311 variables, 161/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:20:21] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 206 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 161/161 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 2329ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 6318 ms.
Support contains 69 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 150/150 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 161/161 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 150/150 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-31 22:20:27] [INFO ] Invariant cache hit.
[2024-05-31 22:20:28] [INFO ] Implicit Places using invariants in 74 ms returned [70, 80, 88, 149]
[2024-05-31 22:20:28] [INFO ] Actually due to overlaps returned [70, 149, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/161 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 87 ms. Remains : 158/161 places, 150/150 transitions.
RANDOM walk for 40000 steps (2262 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1745 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2000 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1739 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1765 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 364199 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 4
Probabilistic random walk after 364199 steps, saw 182347 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
// Phase 1: matrix 150 rows 158 cols
[2024-05-31 22:20:31] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 22:20:31] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 82/158 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 150/308 variables, 158/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 178 constraints, problems are : Problem set: 0 solved, 4 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 158/158 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 7/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 82/158 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 150/308 variables, 158/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:20:32] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:20:33] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:20:33] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:20:33] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:33] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/308 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 202 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 158/158 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 20/20 constraints]
After SMT, in 2465ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 8177 ms.
Support contains 69 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 150/150 transitions.
Applied a total of 0 rules in 16 ms. Remains 158 /158 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 158/158 places, 150/150 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 150/150 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-31 22:20:41] [INFO ] Invariant cache hit.
[2024-05-31 22:20:42] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-31 22:20:42] [INFO ] Invariant cache hit.
[2024-05-31 22:20:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:20:42] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-31 22:20:42] [INFO ] Redundant transitions in 3 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-31 22:20:42] [INFO ] Invariant cache hit.
[2024-05-31 22:20:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:43] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 3 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2024-05-31 22:20:45] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 102 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 106 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 99 places in 41 ms of which 2 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 108 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:20:46] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:20:47] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 2 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:20:48] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:20:49] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:50] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 12 (OVERLAPS) 150/308 variables, 158/208 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:20:53] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 40 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:20:54] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:20:55] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:20:55] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 19/231 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:20:56] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 94 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:20:57] [INFO ] Deduced a trap composed of 104 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:20:59] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:20:59] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:20:59] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:20:59] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:20:59] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:20:59] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:21:00] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 7/258 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:21:00] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:00] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:21:00] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:21:01] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 105 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 106 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:21:02] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 103 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 90 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:21:03] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/308 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/308 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 79 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 2 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/308 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-31 22:21:11] [INFO ] Deduced a trap composed of 98 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:21:11] [INFO ] Deduced a trap composed of 101 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:21:11] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:21:11] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:11] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:21:12] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:21:12] [INFO ] Deduced a trap composed of 98 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:21:12] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
SMT process timed out in 30104ms, After SMT, problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 30113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30425 ms. Remains : 158/158 places, 150/150 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 158 transition count 149
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 157 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 156 transition count 148
Applied a total of 4 rules in 11 ms. Remains 156 /158 variables (removed 2) and now considering 148/150 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 148 rows 156 cols
[2024-05-31 22:21:12] [INFO ] Computed 16 invariants in 2 ms
[2024-05-31 22:21:12] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 22:21:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-05-31 22:21:12] [INFO ] [Nat]Absence check using 9 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-31 22:21:12] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:21:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 572 ms
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 60 places in 556 ms of which 1 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 883 ms
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:21:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-31 22:21:14] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 2
[2024-05-31 22:21:15] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:21:15] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:21:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
TRAPS : Iteration 3
[2024-05-31 22:21:15] [INFO ] After 3028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 22:21:15] [INFO ] After 3293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 3480 ms.
[2024-05-31 22:21:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-31 22:21:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 150 transitions and 466 arcs took 3 ms.
[2024-05-31 22:21:16] [INFO ] Flatten gal took : 74 ms
Total runtime 110684 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleExponent-PT-004-ReachabilityCardinality-2024-00
Could not compute solution for formula : DoubleExponent-PT-004-ReachabilityCardinality-2023-07
Could not compute solution for formula : DoubleExponent-PT-004-ReachabilityCardinality-2024-09
Could not compute solution for formula : DoubleExponent-PT-004-ReachabilityCardinality-2023-13

BK_STOP 1717194076340

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name DoubleExponent-PT-004-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1246/inv_0_
rfs formula name DoubleExponent-PT-004-ReachabilityCardinality-2023-07
rfs formula type AG
rfs formula formula --invariant=/tmp/1246/inv_1_
rfs formula name DoubleExponent-PT-004-ReachabilityCardinality-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1246/inv_2_
rfs formula name DoubleExponent-PT-004-ReachabilityCardinality-2023-13
rfs formula type AG
rfs formula formula --invariant=/tmp/1246/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;